Parys, Pawel and Walukiewicz, Igor - Weak Alternating Timed Automata

lmcs:1214 - Logical Methods in Computer Science, September 19, 2012, Volume 8, Issue 3
Weak Alternating Timed Automata

Authors: Parys, Pawel and Walukiewicz, Igor

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.


Source : oai:arXiv.org:1208.5909
DOI : 10.2168/LMCS-8(3:18)2012
Volume: Volume 8, Issue 3
Published on: September 19, 2012
Submitted on: December 1, 2009
Keywords: Computer Science - Logic in Computer Science,F.1.1, F.4.3


Share

Consultation statistics

This page has been seen 70 times.
This article's PDF has been downloaded 63 times.