In this paper, we consider bounded Time Petri Nets where time intervals (strict and laxge) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are : (i) with strong semantics, A-TPN is strictly more expressive than P-TPN and T-TPN; (ii) with strong semantics P-TPN and T-TPN are incomparable; (iii) T- TPN with strong semantics and T- TPN with weak semantics are incomparable. Moreover, we give a classification by a set of 9 relations explained in Fig. 14 (p. 80). © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Boyer, M., & Roux, O. H. (2007). Comparison of the expressiveness of arc, place and transition time Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4546 LNCS, pp. 63–82). Springer Verlag. https://doi.org/10.1007/978-3-540-73094-1_7
Mendeley helps you to discover research relevant for your work.