Abstract
In this paper we develop a model checking algorithm which is fast in the size of the system. The class of system models we consider are safe persistent Petri nets; the logic is S 4, i.e. prepositional logic with a ‘some time’ operator. Our algorithm does not require to construct any transition system: We reduce the model checking problem to the problem of computing certain Parikh vectors, and we show that for the class of safe marked graphs these vectors can be computed — from the structure of the Petri net — in polynomial time in the size of the system.
Partly supported by the Esprit Basic Research Action 3148 DEMON.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G.S. Avrunin, U.A. Buy, J.C. Corbett, L.K. Dillon and J.C. Wileden: Automated Analysis of Concurrent Systems with the Constrained Expression Toolset. COINS Technical Report 90–116, University of Massachussets at Amherst (1990).
E. Best and R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. TCS Vol. 55, 87–136 (1987).
E. Best and J. Esparza: Model Checking of Persistent Petri Nets. Hildesheimer Informatik Fachbericht 11/91 (1991).
E. Best and C. Fernández: Nonsequential Processes — a Petri Net View. EATCS Monographs on Theoretical Computer Science Vol.13 (1988).
E.M. Clarke, O. Grumberg, M.C. Browne: Reasoning about Networks with many identical finite—state processes. Proceedings of the Fifth Annual Symposium on Principles of Distributed Computing, 240–248 (1986).
J.M. Colom: Structural Analysis Techniques Based on Linear Programming and Convex Geometry. Ph. D. Thesis, University of Zaragoza (1990) (in Spanish).
F. Commoner, A.W. Holt, S. Even and A. Pnueli: Marked Directed Graphs. Journal of Computer and System Science Vol.5, 511–523 (1971).
C. Fernández, M. Nielsen and P.S. Thiagarajan: Notions of Realisable Non-Sequential Processes. Fundamenta Informaticae IX, 421–454 (1986).
P. Godefroid: Using Partial Orders to Improve Automatic Verification Methods. Proc. of Computer-Aided Verification Workshop, Rutgers, New Jersey (1990).
G.E. Hughes and M.J. Creswell: An Introduction to Modal Logic. Methuen and Co. (1968).
R. Janicki and M. Koutny: Optimal Simulation for the Verification of Concurrent Systems. Technical report, McMaster University (1989).
M. Jantzen: Complexity of Place/Transition Nets. Petri Nets: Central Models and Their Properties. W. Brauer, W. Reisig, G. Rozenberg (eds.), LNCS 254, 397–412 (1987).
L.H. Landweber and E.L. Robertson: Properties of Conflict-free and Persistent Petri Nets. JACM Vol.25, No.3, 352–364 (1978).
T. Murata: Petri Nets: Properties, Analysis and Applications. Proc. of the IEEE Vol. 77, No. 4, 541–580 (1989).
H. Qin: Efficient Verification of Determinate Processes. CONCUR'91, J.C.M. Baeten, J.F. Groote (eds.), LNCS 527, 470–479 (1991).
W. Reisig: Petri Nets-an Introduction. EATCS Monographs on Theoretical Computer Science, Vol. 4, Springer Verlag (1985).
M. Tiusanen: Some Unsolved Problems in Modelling Self-timed Circuits Using Petri Nets. EATCS Bulletin, Vol. 36, 152–160 (1988).
A. Valmari: Stubborn Sets for Reduced State Space Generation. Advances in Petri Nets 1990, G. Rozenberg (ed.), LNCS 483, 491–515 (1990).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., Esparza, J. (1992). Model checking of persistent Petri nets. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023756
Download citation
DOI: https://doi.org/10.1007/BFb0023756
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive