Distributed time-asynchronous automata

Authors:
Cătălin Dima;Ruggero Lanotte
Affiliations:
LACL, Université Paris 12, Créteil Cedex, France;Università dell'Insubria, Como, Italy
Venue:
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Year:
2007

Citing 10
Cited 5

A theory of timed automata

Theoretical Computer Science
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Timed regular expressions

Journal of the ACM (JACM)
Computing Reachability Relations in Timed Automata

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Regular Real-Time Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Preemptive Job-Shop Scheduling Using Stopwatch Automata

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking Timed Automata

Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
An algebraic approach to data languages and timed languages

Information and Computation
Revisiting Digitization, Robustness, and Decidability for Timed Automata

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Timed shuffle expressions

CONCUR 2005 - Concurrency Theory

Distributed Timed Automata with Independently Evolving Clocks

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Distributed event clock automata

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Regular set of representatives for time-constrained MSC graphs

Information Processing Letters
Symbolically bounding the drift in time-constrained MSC graphs

ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Avoiding shared clocks in networks of timed automata

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata.