Back in Time Petri Nets
- 498 Downloads
The time progress assumption is at the core of the semantics of real-time formalisms. It is also the major obstacle to the development of partial-order techniques for real-time distributed systems since the events are ordered both by causality and by their occurrence in time. Anyway, extended free choice safe time Petri nets (TPNs) were already identified as a class where partial order semantics behaves well. We show that, for this class, the time progress assumption can even be dropped (time may go back in case of concurrency), which establishes a nice relation between partial-order semantics and time progress assumption.
KeywordsFree Choice Discrete Action Classical Semantic Standard Semantic Input Place
Unable to display preview. Download preview PDF.
- 3.Best, E.: Structure theory of Petri nets: the free choice hiatus. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986, Part 1. LNCS, vol. 254, pp. 168–205. Springer, Heidelberg (1987)Google Scholar
- 6.Chatain, T.: Dépliages symboliques de réseaux de Petri de haut niveau et application à la supervision des systèmes répartis. Thèse de doctorat, Université Rennes 1, Rennes, France (November 2006)Google Scholar
- 8.Desel, J., Esparza, J.: Free Choice Petri nets. Cambridge University Press (1995)Google Scholar
- 10.Merlin, P.M., Farber, D.J.: Recoverability of communication protocols – implications of a theorical study. IEEE Transactions on Communications 24 (1976)Google Scholar