On the composition of time Petri nets

Complex systems are often designed and built from smaller pieces, called components. Components are open sub-systems meant to be combined (or composed) to form other components or closed systems. It is well known that Petri nets allow such a component based modeling, relying on parallel composition and transition synchronization. However, synchronizing transitions that carry temporal constraints does not yield a compositional method for assembling components, a highly desirable property. The paper addresses this particular problem: how to build complex systems in a compositional manner from components specified by Time Petri nets (TPN). A first solution is proposed, adequate for a particular subclass of Time Petri nets but significantly increasing the complexity of components. Then an improved solution is developed, relying on an extension of Time Petri nets with two relations added on transitions. This latter solution requires a much simpler transformation of nets, does not significantly increase their complexity, and is applicable to a larger class of TPN.

[1]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[2]  Marc Boyer,et al.  Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets , 2007, ICATPN.

[3]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[4]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[5]  Serge Haddad,et al.  When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? , 2005, FSTTCS.

[6]  Didier Lime,et al.  Romeo: A Tool for Analyzing Time Petri Nets , 2005, CAV.

[7]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[8]  F. Vernadat,et al.  The tool TINA – Construction of abstract state spaces for petri nets and time petri nets , 2004 .

[9]  Rob J. van Glabbeek,et al.  The Linear Time-Branching Time Spectrum (Extended Abstract) , 1990, CONCUR.

[10]  Florent Peres.  Réseaux de Petri temporels à inhibitions/permissions - Application à la modélisation et vérification de systèmes de tâches temps réel. (Forbid/Allow time Petri nets - Application to the modeling and checking of real time tasks systems) , 2010 .

[11]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[12]  Serge Haddad,et al.  Comparison of the Expressiveness of Timed Automata and Time Petri Nets , 2005, FORMATS.

[13]  François Vernadat,et al.  State Class Constructions for Branching Analysis of Time Petri Nets , 2003, TACAS.

[14]  Patricia Bouyer,et al.  Extended Timed Automata and Time Petri Nets , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[15]  Enrico Vicario,et al.  Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets , 1995, IEEE Trans. Software Eng..

[16]  Colin Stirling,et al.  Verifying Temporal Properties of Processes , 1990, CONCUR.

[17]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[18]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[19]  Jetty Kleijn,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings , 2007, ICATPN.

[20]  Joseph Sifakis,et al.  Composition for component-based modeling , 2005, Sci. Comput. Program..

[21]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[22]  Joseph Sifakis,et al.  Compositional Specification of Timed Systems (Extended Abstract) , 1996, STACS.

[23]  Olivier H. Roux,et al.  Structural translation from Time Petri Nets to Timed Automata , 2005, J. Syst. Softw..

[24]  François Vernadat,et al.  Bridging the Gap Between Timed Automata and Bounded Time Petri Nets , 2006, FORMATS.

[25]  François Vernadat,et al.  Composer des réseaux de Petri temporels , 2009 .