Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
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.
KeywordsTime Petri nets priorities Timed Automata weak timed bisimilarity real-time systems modeling and verification
Unable to display preview. Download preview PDF.
- 5.Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time Petri nets. IFIP Congress Series 9, 41–46 (1983)Google Scholar
- 8.Bouyer, P., Haddad, S., Reynier, P.-A.: Extended timed automata and time Petri nets. In: Proc. of 6th Int. Conf. on Application of Concurrency to System Design (ACSD 2006), Turku, Finland. IEEE Computer Society Press, Los Alamitos (2006)Google Scholar
- 9.Cassez, F., Roux, O.H.: Structural translation from time petri nets to timed automata. Journal of Systems and Software (forthcoming, 2006)Google Scholar
- 11.Haar, S., Kaiser, L., Simonot-Lion, F., Toussaint, J.: Equivalence of Timed State Machines and safe Time Petri Nets. In: Proc. of the 6th Workshop on Discrete Events Systems (WODES 2002), Zaragoza, Spain, pp. 119–124 (October 2002)Google Scholar
- 12.Hack, M.: Petri net languages. TR 159. MIT, Cambridge, Mass (1976)Google Scholar
- 13.Larsen, K.G., Pettersson, P., Yi, W.Y.: Model-checking for real-time systems. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 62–88. Springer, Heidelberg (1995)Google Scholar