Skip to main content
SpringerLink
Log in
Book cover

International SPIN Workshop on Model Checking of Software

SPIN 2000: SPIN Model Checking and Software Verification pp 148–162Cite as

Interaction Abstraction for Compositional Finite State Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1885))

Abstract

A new algorithm for reducing the state space of compositional finite state systems is introduced. Its goal is similar to compositional minimization algorithms as it tries to preserve only the relevant information for checking properties. It works better than compositional minimization because it reduces components individually and does not need to compose components. Hence it does not suffer from state explosion. Instead, it uses information about interactions with other components, and merges interactions that do not lead to different relevant behaviour. Experiments show that it reduces state spaces dramatically in the cases when only a part of the system’s behaviour is of interest

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. In: Sixth ACM Symposium on the Foundations of Software Engineering, pp. 175–188 (1998)

    Google Scholar 

  2. Bouajjani, A., Fernandez, J.-C., Graf, S., Rodriguez, C., Sifakis, J.: Safety for Branching Time Semantics. 18th ICALP, July 1991. Springer, Heidelberg (1991)

    Google Scholar 

  3. Bouajjani, A., Fernandez, J.C., Halbwachs, N., Ratel, C., Raymond, P.: Minimal state graph generation. Science of Computer Programming 18(3) (June 1992)

    Google Scholar 

  4. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, J.: Symbolic Model Checking: 1020 states and beyond. Technical Report, Carnegie Mellon University (1989)

    Google Scholar 

  5. Cheung, S.C., Kramer, J.: Context Constraints for Compositional Reachability Analysis. ACM Transactions on Software Engineering and Methodology ( October 1996)

    Google Scholar 

  6. Fernandez, J.-C., Garavel, H., Kerbrat, A., Mateescu, R., Mounier, L., Sighireanu, M.: CADP: A Protocol Validation and Verification Toolbox. In: Proceedings of the 8th Conference on Computer-Aided Verification, New Brunswick, New Jersey, USA, August 1996, pp. 437–440 (1996)

    Google Scholar 

  7. Fernandez, J.-C.: An Implementation of an Efficient Algorithm for Bisimulation Equivalence. Science of Computer Programming 13(2-3), 219–236 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Grégoire, J.-C.: State space compression in SPIN with GETSs”, Second SPIN Workshop (August 1996)

    Google Scholar 

  9. Godefroid, P., Wolper, P.: A partial approach to model checking. In: Proc. 6th Annual Symposium on Logic in Computer Science, July 1991, pp. 406–415 (1991)

    Google Scholar 

  10. Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall, Englewood Cliffs (1991)

    Google Scholar 

  11. Holzmann, G.J.: The engineering of a model checker: the Gnu i-protocol case study revisited. In: Dams, D.R., Gerth, R., Leue, S., Massink, M. (eds.) SPIN 1999. LNCS, vol. 1680, p. 232. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  12. Holzmann, G.J.: Designing executable abstractions. In: Proc. Formal Methods in Software Practice, March 1998. ACM Press, Clearwater Beach (1998)

    Google Scholar 

  13. Jensen, K.: Coloured Petri Nets. In: Monographs in Theoretical Computer Science 575. Analysis Methods, vol. 2, pp. 192–202. Springer, Heidelberg (1992)

    Google Scholar 

  14. Liu, W., Dasiewicz, P.: Selecting System Test Cases for Object-oriented Programs Using Event-Flow. Proceedings of the Canadian Conference on Electrical and Computer Engineering (CCECE 1997)

    Google Scholar 

  15. Lyons, A.: UML for Real-Time Overview. RATIONAL Software Corporation Whitepaper (April 1998), Available at http://www.rational.com/

  16. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Google Scholar 

  17. Steffen, B., Graf, S., Lüttgen, G.: Compositional Minimization of Finite State Systems. International Journal on Formal Aspects of Computing 8, 607–616 (1996)

    Article  MATH  Google Scholar 

  18. 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 

  19. Varpaaniemi, K., Halme, J., Hiekkanen, K., Pyssysalo, T.: PROD reference manual. Technical Report B13, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland (August. 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo,  

    Wayne Liu

Authors
  1. Wayne Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Kestrel Technology, Palo Alto, California, USA

    Klaus Havelund

  2.  ,  

    John Penix

  3. SEVEN Networks, 94063, Redwood City, CA, USA

    Willem Visser

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, W. (2000). Interaction Abstraction for Compositional Finite State Systems. In: Havelund, K., Penix, J., Visser, W. (eds) SPIN Model Checking and Software Verification. SPIN 2000. Lecture Notes in Computer Science, vol 1885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722468_9

Download citation

  • DOI: https://doi.org/10.1007/10722468_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41030-0

  • Online ISBN: 978-3-540-45297-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation