FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...