Concurrency in timed automata

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Simone Tini
Affiliations:
Dipartimento di Informatica, Università di Pisa, Via Buonarroti 2, 56127 Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Via Buonarroti 2, 56127 Pisa, Italy;Dipartimento di Scienze CC.FF.MM., Università dell'Insubria, Via Valleggio 11, 22100 Como, Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 9
Cited 4

On the power of bounded concurrency I: finite automata

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

Theoretical Computer Science
Languages, automata, and logic

Handbook of formal languages, vol. 3
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)
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
Transformations of Timed Cooperating Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)

Monotonic hybrid systems

Journal of Computer and System Sciences
On conciseness of extensions of timed automata

Journal of Automata, Languages and Combinatorics
Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems

Journal of Systems and Software
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets

Theoretical Computer Science

Quantified Score

Hi-index	5.23

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 w.r.t. the succinctness of the models. Moreover, we distinguish between subclasses that are polynomially closed w.r.t. finite union and finite intersection, and subclasses that do not have such properties.