Abstract
We present an unfolding-based approach to LTL-X model-checking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4,5] and a state of the art parallel high-level net unfolder described in [15,13]. We present experimental results comparing our approach to the one of [4,5] and the model-checker Spin [12].
Chapter PDF
Similar content being viewed by others
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
Best, E., Fleischhack, H., Fraczak, W., Hopkins, R., Klaudel, H., Pelz, E.: An M-net Semantics of B( PN) 2. In: Proc. of STRICT 1995, Berlin, pp. 85–100 (1995)
Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Esparza, J., Heljanko, K.: A new unfolding approach to LTL model checking. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 475–486. Springer, Heidelberg (2000)
Corbett, J.C.: Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering 22(3), 161–180 (1996)
Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 37–56. Springer, Heidelberg (2001)
Esparza, J., Römer, S., Vogler, W.: An Improvement of McMillan’s Unfolding Algorithm. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 87–106. Springer, Heidelberg (1996) ;Full version: FMSD 20(3) ,285–310 (2002)
Esparza, J., Schröter, C.: Net reductions for LTL model-checking. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol. 2144, pp. 310–324. Springer, Heidelberg (2001)
Esparza, J., Schröter, C.: Unfolding Based Algorithms for the Reachability Problem. Fundamenta Informaticae 47(3,4), 231–245 (2001)
Grahlmann, B., Römer, S., Thielke, T., Graves, B., Damm, M., Riemann, R., Jenner, L., Melzer, S., Gronewold, A.: Pep: Programming Environment Based on Petri Nets. Technical Report 14, Universität Hildesheim (1995)
Heljanko, K.: Combining Symbolic and Partial Order Methods for Model Checking 1-Safe Petri Nets. PhD thesis, Helsinki University of Technology (2002)
Heljanko, K., Khomenko, V., Koutny, M.: Parallelisation of the petri net unfolding algorithm. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 371–385. Springer, Heidelberg (2002)
Holzmann, G.J.: The Spin Model Checker. Addison-Wesley, Reading (2003)
Khomenko, V.: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD Thesis, School of Computing Science, University of Newcastle upon Tyne (2003)
Khomenko, V., Koutny, M.: Towards an efficient algorithm for unfolding petri nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 366–380. Springer, Heidelberg (2001)
Khomenko, V., Koutny, M.: Branching processes of high-level petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 458–472. Springer, Heidelberg (2003)
Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of petri net unfoldings. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 95–118. Springer, Heidelberg (2002)
McMillan, K.L.: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 164–174. Springer, Heidelberg (1993)
Melzer, S., Römer, S.: Deadlock Checking Using Net Unfoldings. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 352–363. Springer, Heidelberg (1997)
Peled, D.: All from One, One for All — on Model Checking Using Representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 409–423. Springer, Heidelberg (1993)
Römer, S.: Entwicklung und Implementierung von Verifikationstechniken auf der Basis von Netzentfaltungen. PhD thesis, Technische Universität München (2000)
Vardi, M.Y., Wolper, P.: An Automata Theoretic Approach to Automatic Program Verification. In: Proc. of LICS 1986, pp. 322–331. Cambridge (1986)
Wallner, F.: Model Checking LTL Using Net Unfoldings. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 207–218. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schröter, C., Khomenko, V. (2004). Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings. In: Alur, R., Peled, D.A. (eds) Computer Aided Verification. CAV 2004. Lecture Notes in Computer Science, vol 3114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27813-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-27813-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22342-9
Online ISBN: 978-3-540-27813-9
eBook Packages: Springer Book Archive