Abstract
We propose an extension of Recursive Petri Nets (TRPNs) based on the semantics of the Time Petri Nets (TPNs). TRPNs are well suited for analyzing and modeling timing requirements of complex discrete event system and allow to represent a model at different levels of abstraction. We give a formal semantics of this extended model and show that TRPNs are more expressive than TPNs. Moreover, we propose a method for building a specific state class graph that can be used to analyze timing properties efficiently.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. Journal IEEE Transactions on Software Engineering 17(3), 259–273 (1991)
Bouyer, P., Haddad, S., Reynier, P.A.: Extended timed automata and time petri nets. In: Proc. of ACSD: 6th Int. Conf. on App. of Concurrency to System Design, Turku, Finland (2006)
Bouyer, P., Haddad, S., Reynier, P.A.: Timed Petri Nets and timed automata: on the discriminating Power of Zeno Sequences. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 420–431. Springer, Heidelberg (2006)
Boyer, M., Diaz, M.: Non equivalence between Time Petri Nets and Time Stream Petri Nets. In: Proc. of the 8th Int. Workshop on Petri Nets and Performance Modeling (PNPM 1999), Zaragoza, Spain, pp. 198–207 (September 1999)
Boyer, M., Roux, O.H.: Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546. Springer, Heidelberg (2007)
Gardey, G., Roux, O.H., Roux, O.F.: State Space Computation and Analysis of Time Petri Nets. Journal Theory and Practice of Logic Programming (TPLP). Spec. Issue on Specification Analysis and Verification of Reactive System 6(3), 301–320 (2006)
Haddad, S., Poitrenaud, D.: Theoretical aspects of Recursive Petri Nets. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 228–247. Springer, Heidelberg (1999)
Haddad, S., Poitrenaud, D.: Recursive Petri Nets, an expressive model for discrete event systems. Acta Informatica (to appear, 2007)
Seghrouchni, A.E.F., Hadddad, S.: A recursive model for distributed planning. In: 2nd Int. Conf. on Multi-Agent Systems, Kyoto, Japan (1996)
Storrle, H.: Semantics of Uml 2.0 Activities with Data-Flow. In: Proc. of Int. Symp. of Visual Languages/Human Computer Centered Systems, Rome, Italy (2004)
Valk, R.: Object Petri Nets: Using the Nets-within-Nets Paradigm. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 819–848. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dahmani, D., Ilié, JM., Boukala, M. (2008). Time Recursive Petri Nets. In: Jensen, K., van der Aalst, W.M.P., Billington, J. (eds) Transactions on Petri Nets and Other Models of Concurrency I. Lecture Notes in Computer Science, vol 5100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89287-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-89287-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89286-1
Online ISBN: 978-3-540-89287-8
eBook Packages: Computer ScienceComputer Science (R0)