文章基本信息

标题：Weak Alternating Timed Automata
本地全文：下载
作者：Pawel Parys ; Igor Walukiewicz
期刊名称：Logical Methods in Computer Science
印刷版ISSN：1860-5974
电子版ISSN：1860-5974
出版年度：2012
卷号：8
期号：3
页码：1
DOI：10.2168/LMCS-8(3:18)2012
出版社：Technical University of Braunschweig
摘要：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.
其他关键词：verification, timed systems, alternating timed automata