Skip to main content
SpringerLink
Log in

State Space Exploration of Object-Based Systems Using Equivalence Reduction and the Sweepline Method

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3707))

Abstract

Object-based systems present particular challenges for state space exploration. Objects can be dynamically created and discarded, and can be referenced via object identifiers. Consistent relabelling of object identifiers in a state leads to a state that is superficially different but behaviourally equivalent to the original. Similarly, object-based systems can include garbage which has no effect on subsequent behaviour but which results in unnecessary differentiation of states. Both of these factors can lead to state space explosion.

This paper considers state space exploration for object-based systems based on the Petri Net formalism. It addresses the above issues by using both equivalence reduction and the sweep-line technique. Experimental results are presented for a simple case study of a communication protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agha, G.A., De Cindio, F., Rozenberg, G. (eds.): APN 2001. LNCS, vol. 2001. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  2. Bastide, R., Sy, O., Palanque, P.: A Formal Notation and Tool for the Engineering of CORBA Systems. Concurrency: Practice and Experience 12, 1379–1403 (2000)

    Article  MATH  Google Scholar 

  3. Biberstein, O., Buchs, D., Guelfi, N.: Object-Oriented Nets with Algebraic Specifications: The CO-OPN/2 Formalism. In: Agha, G.A., De Cindio, F., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2001, pp. 70–127. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Billington, J., Gallasch, G.E., Kristensen, L.M., Mailund, T.: Exploiting Equivalence Redution and the Sweep-Line Method for Detecting Terminal States. IEEE Transactions on System, Man and Cybernetics 34(1), 23–37 (2004)

    Article  Google Scholar 

  5. Ceska, M., Janousek, V., Vojnar, T.: Generating and Using State Spaces of Object-Oriented Petri Nets. International Journal of Computer Systems Science and Engineering 16(3), 183–193 (2001)

    Google Scholar 

  6. Christensen, S., Kristensen, L.M., Mailund, T.: A Sweep-Line Method for State Space Exploration. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 450–464. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Comer, D.: Internetworking with TCP/IP: Principles, Protocols and Architectures, 2nd edn., vol. 1. Prentice-Hall, Englewood Cliffs (1991)

    Google Scholar 

  8. Gosling, J., Joy, B., Steele, G.: The JavaTMLanguage Specification. Addison-Wesley, Reading (1996)

    Google Scholar 

  9. Iosif, R.: Exploiting Heap Symmetries in Explicit-State Model Checking of Software. In: 16th IEEE Conference on Automated Software Engineeering, pp. 254–261. IEEE, Los Alamitos (2001)

    Google Scholar 

  10. Iosif, R., Sisto, R.: dSPIN: A Dynamic Extension of SPIN. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, pp. 261–276. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use — Volume 1: Basic Concepts. EATCS Monographs in Computer Science, vol. 26. Springer, Berlin (1992)

    Google Scholar 

  12. Jensen, K., Christensen, S., Huber, P., Holla, M.: Design/CPNTM: A Reference Manual. MetaSoftware Corporation (1992)

    Google Scholar 

  13. Junttila, T.A.: Finding Symmetries of Algebraic System Nets. Fundamenta Informatica 37, 269–289 (1999)

    MATH  MathSciNet  Google Scholar 

  14. Junttila, T.A.: New Canonical Representative Marking Algorithms for Place/Transition Nets. In: Cortadella, J., Reisig, W. (eds.) 25th International Conference on the Application and Theory of Petri Nets, Bologna, Italy, vol. 3099, pp. 258–277. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Kristensen, L.M., Mailund, T.: A Generalised Sweep-Line Method for Safety Properties. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 549–567. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Kummer, O., Wienberg, F., Duvigneau, M., Schumacher, J., Köhler, M., Moldt, D., Rölke, H., Valk, R.: An extensible editor and simulation engine for Petri nets: Renew. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 484–493. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Lakos, C.A.: Object Petri Nets Definition and Relationship to Coloured Nets. Technical Report TR94-3, Computer Science Department, University of Tasmania (April 1994)

    Google Scholar 

  18. Lakos, C.A.: From Coloured Petri Nets to Object Petri Nets. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 278–297. Springer, Heidelberg (1995)

    Google Scholar 

  19. Lakos, C.A.: A Petri Net View of Mobility. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 174–188. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Lorentsen, L., Kristensen, L.: Exploiting Stabilizers and Parallelism in State Space Generation with the Symmetry Method. In: 2nd International Conference on Application of Concurrency to System Design, Newcastle, U.K, pp. 211–220. IEEE Computer Society, Los Alamitos (2001)

    Chapter  Google Scholar 

  21. Mailund, T.: Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 314–334. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  23. Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1492. Springer, Heidelberg (1998)

    Google Scholar 

  24. Stroustrup, B.: The C++ Programming Language, 2nd edn. Addison-Wesley, New York (1991)

    Google Scholar 

  25. Valmari, A.: The State Explosion Problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)

    Google Scholar 

  26. Wegner, P.: Dimensions of Object-Based Language Design. In: Meyrowitz, N. (ed.) OOPSLA 1987, pp. 168–182. ACM Press, New York (1987)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Adelaide, Adelaide, SA, 5005, Australia

    Charles A. Lakos

  2. Department of Computer Science, University of Aarhus, DK-8200, Aarhus N, Denmark

    Lars M. Kristensen

Authors
  1. Charles A. Lakos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lars M. Kristensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar Ilan University, 52900, Ramat Gan, Israel

    Doron A. Peled

  2. Department of Information Management, National Taiwan University, Taiwan

    Yih-Kuen Tsay

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lakos, C.A., Kristensen, L.M. (2005). State Space Exploration of Object-Based Systems Using Equivalence Reduction and the Sweepline Method. In: Peled, D.A., Tsay, YK. (eds) Automated Technology for Verification and Analysis. ATVA 2005. Lecture Notes in Computer Science, vol 3707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562948_16

Download citation

  • DOI: https://doi.org/10.1007/11562948_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29209-8

  • Online ISBN: 978-3-540-31969-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation