Real-Time Systems Design with PEP

The PEP tool provides an integrated development and verification environment for parallel systems. Beginning with version 2.0 it also offers use of timed systems. This paper describes a sample session for the design and the verification by partial order based techniques of a simple real-time model for a mutual exclusion algorithm.

[1]  Javier Esparza.  Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

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

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

[4]  Hans Fleischhack,et al.  Computing a Finite Prefix of a Time Petri Net , 2002, ICATPN.

[5]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[6]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..

[7]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[8]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1991, TOPL.

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

[10]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice , 1991, Lecture Notes in Computer Science.

[11]  Hans Fleischhack,et al.  A Compositional Petri Net Semantics for SDL , 1998, ICATPN.

[12]  Maciej Koutny,et al.  LP Deadlock Checking Using Partial Order Dependencies , 2000, CONCUR.

[13]  Maciej Koutny,et al.  A Compositional Model of Time Petri Nets , 2000, ICATPN.

[14]  Keijo Heljanko,et al.  Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.

[15]  Richard P. Hopkins,et al.  B(PN)2 - a Basic Petri Net Programming Notation , 1993, PARLE.

[16]  Keijo Heljanko.  Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.

[17]  C. Grundmann.  Humboldt‐Universität Berlin , 1950 .