In: Lecture Notes in Computer Science : Formal Modeling and Analysis of Timed Systems, Volume 4202, 2006, pages 82-97. 2006. URL: http://dx.doi.org/10.1007/118673407.
Abstract: 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.
Keywords: Time Petri nets; priorities; Timed Automata; weak timed bisimilarity; real-time systems modeling and verification.
Back to the Petri Nets Bibliography