Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
The logic of event clocks: decidability, complexity and expressiveness
Automatica (Journal of IFAC)
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Kleene Theorems for Event-Clock Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Event-Clock Visibly Pushdown Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Safraless procedures for timed specifications
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Hi-index | 0.00 |
Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby disproving a claim in the original work on ECA. This means in particular that regions do not form a time abstract bisimulation. Nevertheless, we show that regions can still be used to build a finite automaton recognizing the untimed language of an ECA. Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs). We discuss algorithms to handle event zones represented as EDBMs, as well as (semi-) algorithms based on EDBMs to decide language emptiness of ECA.