Weak Alternating Timed Automata
Pawel Parys (Warsaw University), Igor Walukiewicz (LaBRI)
TL;DR
This paper characterizes acceptance conditions for alternating timed automata on infinite words, establishing decidability results for certain fragments of timed temporal logics, and shows these results hold even without punctual constraints.
Contribution
It provides a new characterization of acceptance conditions ensuring decidability of the emptiness problem for alternating timed automata, extending to cases without punctual constraints.
Findings
Decidability of emptiness for specific acceptance conditions
New decidability results for fragments of timed temporal logics
Characterization remains valid without punctual constraints
Abstract
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHermeneutics and Narrative Identity · Aging, Elder Care, and Social Issues · Health, Medicine and Society