Concurrency in Timed Automata

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Simone Tini
Affiliations:
-;-;-
Venue:
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Year:
2001

Citing 8
Cited 0

On the power of bounded concurrency I: finite automata

Journal of the ACM (JACM)
A theory of timed automata

Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Timed cooperating automata

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Expressiveness of Updatable Timed Automata

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the Composition of Hybrid Systems

HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Relating Time Progress and Deadlines in Hybrid Systems

HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Are Timed Automata Updatable?

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce Concurrent Timed Automata (CTAs) where automata running in parallel are synchronized. We consider the subclasses of CTAs obtained by admitting, or not, diagonal clock constraints and constant updates, and by letting, or not, sequential automata to update the same clocks. We prove that such subclasses recognize the same languages but differ from the point of view of succinctness.