Efficient Detection of Deadlocks in Petri Nets Eecient Detection of Deadlocks in Petri Nets
暂无分享,去创建一个
[1] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[2] Pierre Wolper,et al. Reliable Hashing without Collosion Detection , 1993, CAV.
[3] Pierre Wolper,et al. Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..
[4] Laure Petrucci,et al. Avoiding State Exposion by Composition of Minimal Covering Graphs , 1991, CAV.
[5] Stephen D. Crocker,et al. Verification of Concurrent Systems: Function and Timing , 1982, PSTV.
[6] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[7] Antti Valmari,et al. Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.
[8] Eike Best,et al. Semantic Independence , 1989, Sci. Comput. Program..
[9] Pierre Wolper,et al. A Partial Approach to Model Checking , 1994, Inf. Comput..
[10] Maciej Koutny,et al. Optimal simulations, nets and reachability graphs , 1990, Applications and Theory of Petri Nets.
[11] Martti Tienari,et al. An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm , 1991, Protocol Specification, Testing and Verification.
[12] Hartmann J. Genrich,et al. Predicate/Transition Nets , 1986, Advances in Petri Nets.
[13] Antti Valmari,et al. A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..
[14] 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.
[15] Mikko Tiusanen. Static analysis of ADA tasking programs: models and algorithms , 1993 .
[16] Maciej Koutny,et al. Using Optimal Simulations to Reduce Reachability Graphs , 1990, CAV.
[17] Gérard Berthelot,et al. Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.
[18] Patrice Godefroid,et al. An Efficient Reactive Planner for Synthesizing Reactive Plans , 1991, AAAI.
[19] Tadao Murata,et al. Detection of Ada Static Deadlocks Using Petri Net Invariants , 1989, IEEE Trans. Software Eng..
[20] A. Richard Newton,et al. Implicit manipulation of equivalence classes using binary decision diagrams , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.
[21] Wolfgang Reisig,et al. Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.
[22] Juan Quemada. Compressed State Space Representation in LOTOS with the Interleaved Expansion , 1991, PSTV.
[23] Kenneth L. McMillan,et al. Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.
[24] Orna Grumberg,et al. Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.
[25] Antti Valmari,et al. The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic , 1992, CONCUR.
[26] Wolfgang Reisig,et al. Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.
[27] Kimmo Varpaaniemi,et al. The Stubborn Set Method in Practice , 1992, Application and Theory of Petri Nets.
[28] Eike Best,et al. Proceedings of the 4th International Conference on Concurrency Theory , 1993 .
[29] Courcoubetis M. Vardi P. Wolper M. Yannakakis. Memory-E cient Algorithms for theVeri cationof Temporal PropertiesC , 1992 .
[30] Peter Huber,et al. Towards reachability trees for high-level Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.
[31] Antti Valmari,et al. Compositional State Space Generation , 1991, Applications and Theory of Petri Nets.
[32] Gerard J. Holzmann. Algorithms for automated protocol verification , 1990, AT&T Technical Journal.
[33] Gerard J. Holzmann,et al. State-space caching revisited , 1992, Formal Methods Syst. Des..
[34] Patrice Godefroid,et al. Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.
[35] Gerard J. Holzmann,et al. Coverage Preserving Reduction Strategies for Reachability Analysis , 1992, PSTV.
[36] Kurt Jensen. Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.
[37] Doron A. Peled,et al. All from One, One for All: on Model Checking Using Representatives , 1993, CAV.
[38] Grzegorz Rozenberg,et al. High-level Petri Nets: Theory And Application , 1991 .
[39] P. H. Starke,et al. Reachability analysis of Petri nets using symmetries , 1991 .
[40] Pierre Wolper,et al. Partial-Order Methods for Temporal Verification , 1993, CONCUR.
[41] Wolfgang Reisig. Place/Transition Systems , 1986, Advances in Petri Nets.
[42] Antti Valmari,et al. Eliminating Redundant Interleavings During Concurrent Program Verification , 1989, PARLE.
[43] Kurt Jensen,et al. Proceedings of the 13th International Conference on Application and Theory of Petri Nets , 1992 .
[44] Zohar Manna,et al. Formalization of properties of parallel programs , 1970 .
[45] Doron A. Peled,et al. Sometimes 'Some' is as Good as 'All' , 1992, CONCUR.
[46] Kurt Jensen,et al. Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..
[47] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[48] Larry L. Kinney,et al. REDUCTION OF PETRI NETS. , 1976 .
[49] Doron A. Peled,et al. Defining Conditional Independence Using Collapses , 1992, Theor. Comput. Sci..
[50] Alain Kerbrat,et al. Symbolic Equivalence Checking , 1993, CAV.
[51] Greg Findlow,et al. Obtaining Deadlock-Preserving Skeletons for Coloured Nets , 1992, Application and Theory of Petri Nets.
[52] Serge Haddad,et al. A reduction theory for coloured nets , 1988, European Workshop on Applications and Theory in Petri Nets.
[53] G Wheeler,et al. Baby TORAS Eats Philosophers But Thinks About Solitaire , 1990 .
[54] Wolfgang Reisig,et al. Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.
[55] Hon Fung Li,et al. Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems , 1990, CAV.
[56] Markus Lindqvist,et al. Parameterized reachability trees for predicate/transition nets , 1991 .