Abstract
Net unfoldings are a well-studied partial order semantics for Petri nets. In this paper, we show that the finite prefix of an unfolding, introduced by McMillan, is suited for model checking linear-time temporal properties. The method is based on the so-called automata-theoretic approach to model checking. We propose a technique to treat this approach within the framework of safe Petri nets, and give an efficient algorithm for detecting the system runs violating a given specification.
This work was supported by the SFB 342 (subproject A3) of the DFG.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A.V. Aho, J.E. Hopcroft, J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
E. Best, H. Fleischhack (eds.). PEP: Programming Environment based on Petri nets. Technical report, University of Hildesheim, 1995.
E. Chang, R. Roberts. An Inproved Algorithm for Decentralised Extremafinding in Circular Distributed Systems. Communication of the ACM, 22(5):281–283, 1979.
J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575–591, 1991.
J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23:151–195, 1994.
J. Esparza, S. Melzer. Model Checking LTL Using Constraint Programming. In Proc. of 18th Int. Conf, on Application and Theory of Petri Nets, LNCS 1248, pp. 1–20, 1997.
J. Esparza, S. Römer, W. Vogler. An Improvement of McMillan's Unfolding Algorithm. In Tools and Algorithms for the Construction and Analysis of Systems TACAS '96, LNCS 1055, pp. 87–106, 1996.
R. Gerth, D. Peled, M. Vardi, P. Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In Protocol Specification, Testing, and Verification PSTV'95, pp. 3–18, 1995.
P. Godefroid, G.J. Holzmann. On the Verification of Temporal Properties. In Protocol Specification, Testing, and Verification PSTV'93, 1993.
P. Godefroid, P. Wolper. A Partial Approach to Model Checking. In Proc. of 6th IEEE Symp. on Logic in Computer Science, pp. 406–415, 1991.
G.J. Holzmann. The model checker Spin. IEEE Trans. on Software Engineering, 23(5):279–295, 1997.
I. Kokkarinen, D. Peled, A. Valmari. Relaxed Visibility Enhances Partial Order Reduction. In Proc. of 9th Computer-Aided Verification CAV'97, LNCS 1254, pp. 328–339, 1997.
L. Lamport. What good is temporal logic? Information Processing 83, pp. 657–668, 1983.
K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. 4th Workshop on Computer-Aided Verification, LNCS 663, pp. 164–174, 1992.
M. Nielsen, G. Plotkin, G. Winskel. Petri nets, event structures and domains. Theoretical Computer Science, 13(1):85–108, 1980.
D. Peled. All from one, one for all: on model checking using representatives. In Proc. of 5th Computer-Aided Verification CAV'93, LNCS 697, pp. 409–423,1993.
D. Peled. Combining partial order reductions with on-the-fly model checking. In Proc. of 6th Computer-Aided Verification CAV'94, LNCS 818, pp. 377–390, 1994.
A. Valmari. A Stubborn Attack on State Explosion. Formal Methods in System Design, 1:297–322, 1992.
A. Valmari. On-the-fly Verification with Stubborn Sets. In Proc. of 5th Computer-Aided Verification CAV'93, LNCS 697, pp. 397–408, 1993.
M.Y. Vardi, P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. of 1st IEEE Symp. on Logic in Computer Science, pp. 322–331, 1986.
P. Wolper. On the relations on programs and computations to models of temporal logic. In Proc. of Temporal Logic in Specification, LNCS 398, pp. 75–123, 1989.
P. Wolper, M.Y. Vardi, A.P. Sistla. Reasoning about infinite computation paths. In Proc. of 24th IEEE Symp. on Foundations of Computer Science, pp. 185–194, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wallner, F. (1998). Model checking LTL using net unforldings. In: Hu, A.J., Vardi, M.Y. (eds) Computer Aided Verification. CAV 1998. Lecture Notes in Computer Science, vol 1427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028746
Download citation
DOI: https://doi.org/10.1007/BFb0028746
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64608-2
Online ISBN: 978-3-540-69339-0
eBook Packages: Springer Book Archive