A Theory of Implementation and Refinement in Timed Petri Nets

We define formally the notion of implementation for time critical systems in terms of provability of properties described abstractly at the specification level. We characterize this notion in terms of formulas of the temporal logic TRIO and operational models of timed Petri nets, and provide a method to prove that two given nets are in the implementation relation. Refinement steps are often used as a means to derive in a systematic way the system design starting from its abstract specification. We present a method to formally prove the correctness of refinement rules for timed Petri nets and apply it to a few simple cases. We show how the possibility to retain properties of the specification in its implementation can simplify the verification of the designed systems by performing incremental analysis at various levels of the specification/implementation hierarchy.

[1]  Jacob Itzhack Aizikowitz.  Designing distributed services using refinement mappings , 1989 .

[2]  Angelo Morzenti,et al.  Validating Real-Time Systems by Executing Logic Specifications , 1991, REX Workshop.

[3]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[4]  Carlo Ghezzi,et al.  TRIO: A logic language for executable specifications of real-time systems , 1990, J. Syst. Softw..

[5]  Michal Young,et al.  Compositional reachability analysis using process algebra , 1991, TAV4.

[6]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[7]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[8]  Carlo Ghezzi,et al.  Analyzing refinements of state based specifications: the case of TB nets , 1993, ISSTA '93.

[9]  Klaus Müller.  Constructable Petri Nets , 1985, J. Inf. Process. Cybern..

[10]  Walter Vogler,et al.  Behaviour Preserving Refinement of Petri Nets , 1986, WG.

[11]  Thomas A. Henzinger,et al.  Temporal proof methodologies for real-time systems , 1991, POPL '91.

[12]  Bernhard Josko,et al.  Modular Verification of Petri Nets: The Temporal Logic Approach , 1989, REX Workshop.

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

[14]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

[15]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[16]  Bernhard Josko,et al.  Modular verification of Petri Nets , 1990 .

[17]  Nancy A. Lynch,et al.  Using mappings to prove timing properties , 1990, PODC '90.

[18]  Dino Mandrioli,et al.  Proving Properties of Real-Time Systems Through Logical Specifications and Petri Net Models , 1994, IEEE Trans. Software Eng..

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

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

[21]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[22]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[23]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[24]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[25]  Walter Vogler,et al.  Modular Construction and Partial Order Semantics of Petri Nets , 1992, Lecture Notes in Computer Science.

[26]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .