DSouza, Deepak and Raj, Mohan M (2005) Eventual Timed Automata. In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, December 15-18, 2005., Hyderabad, India..
fulltext.pdf - Published Version
Restricted to Registered users only
Download (268Kb) | Request a copy
We study the class of timed automata called eventual timed automata (ETA's) obtained using guards based on the operator lozenge. In this paper we show that ETA's form a decidable class of timed automata via a flattening to non-recursive ETA's followed by a reduction to 1-clock alternating timed automata. We also study the expressiveness of the class of ETA's and show that they compare favourably with other classes in the literature. Finally we show that class obtained using the dual operator lozenge is also decidable, though the two operators together lead to an undecidable class of languages.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||17 Jul 2009 10:12|
|Last Modified:||19 Sep 2010 04:54|
Actions (login required)