Theoretical Computer Science
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Timed automata with periodic clock constraints
Journal of Automata, Languages and Combinatorics
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Folk theorems on the determinization and minimization of timed automata
Information Processing Letters
Representation, Verification, and Computation of Timed Properties in Web
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
Proceedings of the 45th annual Design Automation Conference
Undecidable problems about timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
When Are Timed Automata Determinizable?
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A game approach to determinize timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
| Hi-index | 0.00 |
In this paper, we consider a syntactic subset of timed automata called integer reset timed automata (IRTA) where resetsare restricted to occur at integral time points. We argue with examples that the notion of global sparse time base used in time triggered architecture and distributed web services can naturally be modelled/specified as IRTA. As our main result, we show that the language inclusion problem $L(\mathcal A) \subseteq L(\mathcal{B})$ for a timed automaton $\mathcal A$ and an IRTA $\mathcal{B}$ is decidable with EXPSPACE complexity. The expressive power and the closure properties of IRTA are also summarized. In particular, the IRTA are (highly succinct but) expressively equivalent to 1-clock deterministic IRTA and they are closed under boolean operations.