Sciweavers

Share
ICALP
2009
Springer

Weak Alternating Timed Automata

9 years 8 months ago
Weak Alternating Timed Automata
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 decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.
Pawel Parys, Igor Walukiewicz
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2009
Where ICALP
Authors Pawel Parys, Igor Walukiewicz
Comments (0)
books