Reduction rules for time Petri nets

Abstract. The goal of net reduction is to increase the effectiveness of Petri-net-based real-time program analysis. Petri-net-based analysis, like all reachability-based methods, suffers from the state explosion problem. Petri net reduction is one key method for combating this problem.In this paper, we extend several rules for the reduction of ordinary Petri nets to work with time Petri nets. We introduce a notion of equivalence among time Petri nets, and prove that our reduction rules yield equivalent nets. This notion of equivalence guarantees that crucial timing and concurrency properties are preserved.

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

[2]  Sol M. Shatz,et al.  Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada , 1994, TSEM.

[3]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[4]  Jörg Desel,et al.  Reduction and Design of Well-behaved Concurrent Systems , 1990, CONCUR.

[5]  Robert H. Sloan,et al.  A Petri-net-based approach to real-time program analysis , 1993, Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design.

[6]  C. Ghezzi,et al.  A general way to put time in Petri nets , 1989, IWSSD '89.

[7]  Sol M. Shatz,et al.  Design and Implementation of a Petri Net Based Toolkit for Ada Tasking Analysis , 1990, IEEE Trans. Parallel Distributed Syst..

[8]  Tomohiro Yoneda,et al.  Efficient Verification of Parallel Real–Time Systems , 1993, Formal Methods Syst. Des..

[9]  Gérard Berthelot,et al.  Checking properties of nets using transformation , 1985, Applications and Theory in Petri Nets.

[10]  Robert H. Sloan,et al.  Analysis of real-time programs with simple time Petri nets , 1994, ISSTA '94.

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

[12]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[13]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[14]  Guy Juanole,et al.  Specification and verification of distributed systems using prolog interpreted petri nets. , 1984, ICSE '84.

[15]  P. H. Starke,et al.  Reachability analysis of Petri nets using symmetries , 1991 .

[16]  Mary K. Vernon,et al.  SARA (System ARchitects Apprentice): Modeling, analysis, and simulation support for design of concurrent systems , 1986, IEEE Transactions on Software Engineering.

[17]  Manuel Silva Suárez,et al.  Top-down synthesis of live and bounded free choice nets , 1990, Applications and Theory of Petri Nets.

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

[19]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1989, covers the 9th European Workshop on Applications and Theory in Petri Nets, held in Venice, Italy in June 1988, selected papers , 1990, Applications and Theory of Petri Nets.

[20]  S. Tu,et al.  Applying Petri net reduction to support Ada-tasking deadlock detection , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.