3229 search results - page 4 / 646 » The Theory of Timed Automata |
107
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward t...
82
Voted
FUIN
2008
14 years 11 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
79
Voted
TACS
2001
Springer
15 years 4 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
104
Voted
LATA
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...