zbMATH — the first resource for mathematics

Bridging the gap between timed automata and bounded time Petri nets. (English) Zbl 1141.68426
Asarin, Eugene (ed.) et al., Formal modeling and analysis of timed systems. 4th international conference, FORMATS 2006, Paris, France, September 25–27, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-45026-9/pbk). Lecture Notes in Computer Science 4202, 82-97 (2006).
Summary: Several recent papers investigate the relative expressiveness of Timed Automata and Time Petri Nets, two widespread models for realtime systems. It has been shown notably that Timed Automata and Bounded Time Petri Nets are equally expressive in terms of timed language acceptance, but that Timed Automata are strictly more expressive in terms of weak timed bisimilarity. This paper compares Timed Automata with Bounded Time Petri Nets extended with static Priorities, and shows that two large subsets of these models are equally expressive in terms of weak timed bisimilarity.
For the entire collection see [Zbl 1137.68001].

68Q45 Formal languages and automata
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDF BibTeX Cite
Full Text: DOI