Abstract
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTL-X model checking. We have implemented our method in the reachability analyser Maria and performed experiments. As is the case for modular analysis in general, in some cases the gains can be considerable while in other cases the gain is negligible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Christensen, S., Petrucci, L.: Modular analysis of Petri Nets. The Computer Journal 43(3), 224–242 (2000)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
Clarke, E.M., Long, D.E., McMillan, K.L.: Compositional model checking. In: Parikh, R. (ed.) Proc. 4th IEEE Symposium on Logic in Computer Science, pp. 353–362. IEEE Computer Society Press, Los Alamitos (1989)
Clarke, E.M., Schlingloff, B.-H.: Model checking. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1637–1790. Elsevier, Amsterdam (2001)
Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design 1, 275–288 (1992)
Dolev, D., Klawe, M., Rodeh, M.: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms 3(3), 245–260 (1982)
Donatelli, S.: Kronecker algebra and (stochastic) Petri nets: Is it worth the effort. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 1–18. Springer, Heidelberg (2001)
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., Heljanko, K.: A new unfolding approach to LTL model checking. Technical Report HUT-TCS-A60, Helsinki University of Technology (April 2000), Available from http://www.tcs.hut.fi/Publications
Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)
Giannakopoulou, D., Lerda, F.: From states to transitions: Improving translation of ltl formulae to büchi automata. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 308–326. Springer, Heidelberg (2002)
Hansen, H., Penczek, W., Valmari, A.: Stuttering-insensitive automata for on-the-fly detection livelock properties. In: Formal Methods for Industrial Critical Systems. Electronic Notes in Theoretical Computer Science, vol. 66(2). Elsevier, Amsterdam (2002)
Jensen, K.: Coloured Petri Nets, vol. 1. Springer, Berlin (1997)
Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)
Latvala, T.: Efficient model checking of safety properties. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 74–88. Springer, Heidelberg (2003)
Latvala, T.: Model checking LTL properties of high-level Petri nets with fairness constraints. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 242–262. Springer, Heidelberg (2001)
Mäkelä, M.: Model checking safety properties in modular high-level nets. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 201–220. Springer, Heidelberg (2003)
Mäkelä, M.: Maria: modular reachability analyser for algebraic system nets. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 434–444. Springer, Heidelberg (2002)
Petrucci, L.: Design and validation of a controller. In: Proceedings of the 4th World Multiconference on Systemics, Cybernetics and Informatics, Orlando, FL, USA, July 2000, vol. VIII, pp. 684–688. International Institute of Informatics and Systemics (2000)
Somenzio, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248–263. Springer, Heidelberg (2000)
Thomas, W.: Automata on infinite objects. In: Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier, Amsterdam (1990)
Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Valmari, A.: Composition and abstraction. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 58–99. Springer, Heidelberg (2001)
Valmari, A.: On-the-fly verification with stubborn sets. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 397–408. Springer, Heidelberg (1993)
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences 32, 183–221 (1986)
Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)
Varpaaniemi, K., Heljanko, K., Lilius, J.: PROD 3.2 – an advanced tool for efficient reachability analysis. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 472–475. Springer, Heidelberg (1997)
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
Latvala, T., Mäkelä, M. (2004). LTL Model Checking for Modular Petri Nets. In: Cortadella, J., Reisig, W. (eds) Applications and Theory of Petri Nets 2004. ICATPN 2004. Lecture Notes in Computer Science, vol 3099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27793-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-27793-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22236-1
Online ISBN: 978-3-540-27793-4
eBook Packages: Springer Book Archive