Handbook of theoretical computer science (vol. B)
Branching processes of Petri nets
Acta Informatica
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Partial order verification with PEP
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Symbolic Model Checking
A New Unfolding Approach to LTL Model Checking
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Unfolding Algorithm for Synchronous Products of Transition Systems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Computing Reachability Properties Hidden in Finite Net Unfoldings
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Fixed Points of Büchi Automata
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
| Hi-index | 0.00 |
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a symbolic representation of an interleaved reachability graph. We show that model checking a fixed size formula of several temporal logics, including LTL, CTL, and CTL*, is PSPACE-complete in the size of a finite complete prefix of a 1-safe Petri net. This proof employs a class of 1-safe Petri nets for which it is easy to generate a finite complete prefix in polynomial time.