Distributed event clock automata

Authors:
James Ortiz;Axel Legay;Pierre-Yves Schobbens
Affiliations:
Computer Science Faculty, University of Namur;INRIA, IRISA, Rennes and Institut Montefiore, University of Liège;Computer Science Faculty, University of Namur
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 16
Cited 0

A theory of timed automata

Theoretical Computer Science
The benefits of relaxing punctuality

Journal of the ACM (JACM)
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Axioms for real-time logics

Theoretical Computer Science
The Regular Real-Time Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Partial Order Reductions for Timed Systems

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Dynamical Properties of Timed Automata

FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
State Clock Logic: A Decidable Real-Time Logic

HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
A Determinizable Class of Timed Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Logics and Models of Real Time: A Survey

Proceedings of the Real-Time: Theory in Practice, REX Workshop
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Distributed Timed Automata with Independently Evolving Clocks

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Realizability of Real-Time Logics

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Distributed time-asynchronous automata

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Memory event clocks

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
An expressive temporal logic for real time

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In distributed real-time systems, we cannot assume that clocks are perfectly synchronized. To model them, we use independent clocks and define their timed semantics. The universal timed language, and the timed language inclusion of icTA are undecidable. Thus, we propose Recursive Distributed Event Clock Automata (DECA). DECA are closed under all boolean operations and their timed language inclusion problem is decidable (more precisely PSPACE-complete), allowing stepwise refinement. We also propose Distributed Event Clock Temporal Logic (DECTL), a real-time logic with independent time evolutions. This logic can be model-checked by translating a DECTL formula into a DECA automaton.