206 search results - page 1 / 42 » Weak Alternating Automata Are Not That Weak |
ISTCS
1997
Springer
13 years 9 months ago
1997
Springer
STOC
1998
ACM
13 years 9 months ago
1998
ACM
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...