512 search results - page 21 / 103 » Automata as Abstractions |
126
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
142
click to vote
VMCAI
2007
Springer
16 years 16 hour ago
2007
Springer
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
183
click to vote
LICS
2008
IEEE
16 years 9 days ago
2008
IEEE
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
133
click to vote
STACS
2010
Springer
16 years 27 days ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
150
click to vote
ICALP
2007
Springer
16 years 2 days ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...