A Compositional Model of Time Petri Nets

This paper presents two related algebras which can be used to specify and analyse concurrent systems with explicit timing information. The first algebra is based on process expressions, called t-expressions, and a system of SOS rules providing their operational semantics. The second algebra is based on a class of time Petri nets, called ct-boxes, and their transition firing rule. The two algebras are related through a mapping which, for a t-expression, returns a corresponding ct-box with behaviourally equivalent transition system. The resulting model, called the Time Petri Box Calculus (tPBC), extends the existing approach of the Petri Box Calculus (PBC).

[1]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[2]  Maciej Koutny,et al.  Petri Net Algebra , 2001, Monographs in Theoretical Computer Science An EATCS Series.

[3]  Maciej Koutny,et al.  Operational and Denotational Semantics for the Box Algebra , 1999, Theor. Comput. Sci..

[4]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

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

[8]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems: The Cosy Approach , 1992 .

[11]  Hans Fleischhack,et al.  Model Checking of Time Petri Nets Based on Partial Order Semantics , 1999, CONCUR.

[12]  Grzegorz Rozenberg Advances in Petri Nets 1992 , 1992, Lecture Notes in Computer Science.

[13]  Raymond R. Devillers,et al.  General Refinement and Recursion Operators for the Petri Box Calculus , 1993, STACS.

[14]  Wolfgang Reisig,et al.  Lectures on Petri Nets II: Applications , 1996, Lecture Notes in Computer Science.

[15]  Maciej Koutny,et al.  The Box Algebra - A Model of Nets and Process Expressions , 1999, ICATPN.

[16]  Maciej Koutny,et al.  Petri Nets, Process Algebras and Concurrent Programming Languages , 1996, Petri Nets.

[17]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.