Advertisement

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

  • Charles A. Lakos
  • Lars M. Kristensen
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

State Space Garbage Collection Port Place Progress Measure State Space Explosion 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agha, G.A., De Cindio, F., Rozenberg, G. (eds.): APN 2001. LNCS, vol. 2001. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  2. 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)zbMATHCrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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. 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)CrossRefGoogle Scholar
  7. 7.
    Comer, D.: Internetworking with TCP/IP: Principles, Protocols and Architectures, 2nd edn., vol. 1. Prentice-Hall, Englewood Cliffs (1991)Google Scholar
  8. 8.
    Gosling, J., Joy, B., Steele, G.: The JavaTMLanguage Specification. Addison-Wesley, Reading (1996)Google Scholar
  9. 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. 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)CrossRefGoogle Scholar
  11. 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. 12.
    Jensen, K., Christensen, S., Huber, P., Holla, M.: Design/CPNTM: A Reference Manual. MetaSoftware Corporation (1992)Google Scholar
  13. 13.
    Junttila, T.A.: Finding Symmetries of Algebraic System Nets. Fundamenta Informatica 37, 269–289 (1999)zbMATHMathSciNetGoogle Scholar
  14. 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)CrossRefGoogle Scholar
  15. 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)CrossRefGoogle Scholar
  16. 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)CrossRefGoogle Scholar
  17. 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. 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. 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)CrossRefGoogle Scholar
  20. 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)CrossRefGoogle Scholar
  21. 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)CrossRefGoogle Scholar
  22. 22.
    Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)zbMATHGoogle Scholar
  23. 23.
    Reisig, W., Rozenberg, G. (eds.): APN 1998. LNCS, vol. 1492. Springer, Heidelberg (1998)Google Scholar
  24. 24.
    Stroustrup, B.: The C++ Programming Language, 2nd edn. Addison-Wesley, New York (1991)Google Scholar
  25. 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. 26.
    Wegner, P.: Dimensions of Object-Based Language Design. In: Meyrowitz, N. (ed.) OOPSLA 1987, pp. 168–182. ACM Press, New York (1987)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Charles A. Lakos
    • 1
  • Lars M. Kristensen
    • 2
  1. 1.School of Computer ScienceUniversity of AdelaideAdelaideAustralia
  2. 2.Department of Computer ScienceUniversity of AarhusAarhus NDenmark

Personalised recommendations