ABSTRACT: McMillan has presented a verification method for finite-state Petri nets based on finite complete prefixes of net unfoldings. Computational complexity of using finite complete prefixes as a symbolic representation of the state space is discussed. In addition a novel way of deadlock and reachability checking using the finite complete prefix approach is devised. More specifically, the main contributions are: (i) The possible extensions calculation subroutine of the prefix generation algorithm is proved NPcomplete. (ii) Model checking a fixed size CTL formula with finite complete prefixes is proved PSPACE-complete. (iii) The translations of the problems of deadlock and reachability checking using finite complete prefixes into the problem of finding a stable model of a logic program are devised. (iv) The implementation of the above mentioned translations in the mcsmodels tool is presented, with experimental results supporting the feasibility of the approach. The implementation combines the prefix generator of the PEP-tool, the translations, and an implementation of a constraint-based logic programming
|
1604
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1152
|
Symbolic Model Checking
– McMillan
- 1993
|
|
1139
|
The stable model semantics for logic programming
– Gelfond, Lifschitz
- 1988
|
|
913
|
Temporal and modal logics
– Emerson
- 1990
|
|
702
|
The Well-Founded Semantics for General Logic Programs
– Gelder, Ross, et al.
- 1991
|
|
467
|
Symbolic model checking without BDDs
– Biere, Cimatti, et al.
- 1999
|
|
341
|
First-Order Logic and Automated Theorem Proving
– Fitting
- 1996
|
|
235
|
A stubborn attack on state explosion
– Valmari
- 1991
|
|
232
|
Elements of the theory of computation
– Lewis, Papadimitriou
- 1981
|
|
135
|
An improvement of McMillan’s unfolding algorithm
– Esparza, Römer, et al.
- 1996
|
|
127
|
Petri nets, event structures and domains
– Nielsen, Plotkin, et al.
- 1981
|
|
111
|
Branching Processes of Petri Nets
– Engelfriet
- 1991
|
|
107
|
Evaluating deadlock detection methods for concurrent software
– Corbett
- 1996
|
|
103
|
Model Checking Using Net Unfoldings
– Esparza
- 1994
|
|
67
|
Decidability Issues for Petri Nets - a survey
– Esparza, Nielsen
- 1994
|
|
67
|
The state explosion problem
– Valmari
- 1998
|
|
65
|
Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae 37(3):247–268
– Heljanko
- 1999
|
|
45
|
Decidability and complexity of petri net problems - an introduction
– Esparza
- 1998
|
|
44
|
A technique of state space search based on unfolding
– McMillan
- 1995
|
|
43
|
Deadlock checking using net unfoldings
– Melzer, Roemer
- 1997
|
|
40
|
An Unfolding Algorithm for Synchronous Products of Transition Systems
– Esparza, Römer
- 1999
|
|
35
|
Extending the stable model semantics with more expressive rules
– Simons
- 1999
|
|
33
|
The pep tool
– Grahlmann
- 1997
|
|
29
|
Towards constraint satisfaction through logic programs and the stable model semantics
– Simons
- 1997
|
|
23
|
Complexity of some problems in Petri nets
– Jones, Landweber, et al.
- 1977
|
|
19
|
Smodels - an implementation of the stable model and well-founded semantics for normal logic programs
– Niemel, Simons
- 1997
|
|
19
|
Model checking LTL using net unfoldings
– Wallner
- 1998
|
|
17
|
Partial Order Verification with PEP
– Best
- 1996
|
|
17
|
Logic programs with stable model semantics as a constraint programming paradigm
– Niemel
- 1999
|
|
14
|
Minimizing Finite Complete Prefixes
– Heljanko
- 1999
|
|
14
|
Trace theoretic verification of asynchronous circuits using unfoldings
– McMillan
- 1995
|
|
14
|
Alternating Automata and Program Verification
– Vardi
- 1995
|
|
9
|
Computing Reachability Properties Hidden in Finite Net Unfoldings
– Graves
- 1997
|
|
6
|
A Complete Finite Prefix for Process Algebra
– Langerak, Brinksma
- 1999
|
|
6
|
Using unfoldings to avoid the state space explosion problem in the verification of asynchronous circuits
– McMillan
- 1992
|
|
5
|
Branching Processes of general S/T-Systems
– Haar
- 1998
|
|
3
|
Deadlock checking for complete finite prefixes using logic programs with stable model semantics (extended abstract
– Heljanko
- 1998
|
|
3
|
The use of Petri nets for the design and verification of asynchronous circuits and systems
– Kondratyev, Kishinevsky, et al.
- 1998
|
|
3
|
Truszczy nski. Autoepistemic logic
– Marek, M
- 1991
|
|
2
|
Fixpoints of Bchi automata
– Dam
- 1992
|
|
1
|
An improvement of McMillan's unfolding algorithm. Unpublished manuscript, submitted to Formal Methods
– Esparza, Rmer, et al.
- 1998
|
|
1
|
Concurrent Hardware: The Theory and
– Kishinewsky, Kondratyev, et al.
- 1994
|
|
