Concurrency in timed automata

DOI10.1016/S0304-3975(03)00316-5zbMath1070.68073OpenAlexW2076608736MaRDI QIDQ1884910

Ruggero Lanotte, Simone Tini, Andrea Maggiolo-Schettini

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00316-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets ⋮ Monotonic hybrid systems

Cites Work

• A theory of timed automata
• On the power of bounded concurrency I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrency in timed automata