Skip to main content
SpringerLink
Log in

Synchronous Closing and Flow Analysis for Model Checking Timed Systems

  • Conference paper
Formal Methods for Components and Objects (FMCO 2003)

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

Included in the following conference series:

Abstract

Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully automatic verification, however, a combination of decomposition and abstraction techniques is needed. To model check components of a system, a standard approach is to close the component with an abstraction of its environment, as standard model checkers often do not handle open reactive systems directly. To make it useful in practice, the closing of the component should be automatic, both for data and for control abstraction. Specifically for model checking asynchronous open systems, external input queues should be removed, as they are a potential source of a combinatorial state explosion.

In this paper we investigate a class of environmental processes for which the asynchronous communication scheme can safely be replaced by a synchronous one. Such a replacement is possible only if the environment is constructed under rather a severe restriction on the behavior, which can be partially softened via the use of a discrete-time semantics. We employ data-flow analysis to detect instances of variables and timers influenced by the data passing between the system and the environment.

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. Alur, R., Henzinger, T.A., Mang, F., Qadeer, S., Rajamani, S.K., Tasiran, S.: Mocha: Modularity in model checking. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 521–525. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Bos˘nac˘ki, D., Dams, D.: Integrating real time into Spin: A prototype implementation. In: Budkowski, S., Cavalli, A., Najm, E. (eds.) Proceedings of Formal Description Techniques and Protocol Specification, Testing, and Verification (FORTE/PSTV’98), Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  3. Bos˘nac˘ki, D., Dams, D., Holenderski, L., Sidorova, N.: Verifying SDL in Spin. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol. 1785, Springer, Heidelberg (2000)

    Google Scholar 

  4. Bozga, M., Fernandez, J.-C., Ghirvu, L.: State space reduction based on live variables analysis. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, p. 164. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Bozga, M., Fernandez, J.-C., Ghirvu, L., Graf, S., Krimm, J.-P., Mounier, L.: An intermediate representation and validation environment for timed asynchronous systems. In: Wing, J., Woodcock, J., Davies, J. (eds.) Proceedings of Symposium on Formal Methods (FM 1999), Sept. 1999. LNCS, vol. 1708, Springer, Heidelberg (1999)

    Google Scholar 

  6. Bozga, M., Graf, S., Kerbrat, A., Mounier, L., Ober, I., Vincent, D.: SDL for real-time: What is missing? In: Lahav, Y., Graf, S., Jard, C. (eds.) Electronic Proceedings of SAM (2000)

    Google Scholar 

  7. Brock, J., Ackerman, W.: An anomaly in the specifications of nondeterministic packet systems. In: Technical Report Computation Structures Group Note CSG-33, MIT Lab. for Computer Science (November 1977)

    Google Scholar 

  8. Clarke, E., Grumberg, O., Long, D.: Model checking and abstraction. ACM Transactions on Programming Languages and Systems 16(5), 1512–1542 (1994); A preliminary version appeared in the Proceedings of POPL 1992

    Article  Google Scholar 

  9. Colby, C., Godefroid, P., Jagadeesan, L.J.: Automatically closing of open reactive systems. In: Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, New York (1998)

    Google Scholar 

  10. Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems: Abstraction preserving ∀CTL∗,∃CTL∗, and CTL∗. In: Olderog, E.-R. (ed.) Proceedings of PROCOMET 1994, June 1994. IFIP, North-Holland, Amsterdam (1994)

    Google Scholar 

  11. Discrete-time Spin (2000), http://www.win.tue.nl/~dragan/DTSpin.html

  12. Godefroid, P.: Using partial orders to improve automatic verification methods. In: Clarke, E.M., Kurshan, R.P. (eds.) Computer Aided Verification 1990. LNCS, vol. 531, pp. 176–449. Springer, Heidelberg (1991); an extended Version appeared in ACM/AMS DIMACS Series, vol. 3, pp. 321–340, 1991.

    Google Scholar 

  13. Guoping, J., Graf, S.: Verification experiments on the MASCARA protocol. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, p. 123. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Hecht, M.S.: Flow Analysis of Programs. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  15. Holzmann, G., Patti, J.: Validating SDL specifications: an experiment. In: Brinksma, E. (ed.) International Workshop on Protocol Specification, Testing and Verification IX, Twente, The Netherlands. IFIP TC-6 International Workshop, pp. 317–326. North-Holland, Amsterdam (1989)

    Google Scholar 

  16. Holzmann, G.J.: The Spin Model Checker. Addison-Wesley, Reading (2003)

    Google Scholar 

  17. Ioustinova, N., Sidorova, N., Steffen, M.: Abstraction and flow analysis for model checking open asynchronous systems. In: Proceedings of the 9th Asia-Pacific Software Engineering Conference (APSEC 2002), Gold Coast, Queensland, Australia, December (4–6) 2002, pp. 227–235. IEEE Computer Society, Los Alamitos (2002)

    Google Scholar 

  18. Ioustinova, N., Sidorova, N., Steffen, M.: Closing open SDL-systems for model checking with dTSpin. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 531–548. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Kildall, G.: A unified approach to global program optimization. In: Proceedings of POPL 1973, January 1973, pp. 194–206. ACM, New York (1973)

    Google Scholar 

  20. Kupferman, O., Vardi, M.Y.: Module checking revisited. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, Springer, Heidelberg (1997)

    Google Scholar 

  21. Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. In: Alur, R. (ed.) Proceedings of CAV 1996. LNCS, vol. 1102, pp. 75–86 (1996)

    Google Scholar 

  22. Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: Twelfth Annual Symposium on Principles of Programming Languages (POPL), New Orleans, LA, January 1985, pp. 97–107. ACM, New York (1985)

    Google Scholar 

  23. Long, D.: Model Checking, Abstraction and Compositional Verification. PhD thesis, Carnegie Mellon University (1993)

    Google Scholar 

  24. Nielson, F., Nielson, H.-R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  25. Olsen, A., Færgemand, O., Møller-Pedersen, B., Reed, R., Smith, J.R.W.: System Engineering Using SDL-92. Elsevier Science, Amsterdam (1997)

    Google Scholar 

  26. Pnueli, A.: The temporal logic of programs. In: Proceeding of the 18th Annual Symposium on Foundations of Computer Science, pp. 45–57 (1977)

    Google Scholar 

  27. Specification and Description Language SDL. CCITT (1993)

    Google Scholar 

  28. Specification and Description Language SDL, blue book. CCITT Recommendation Z.100 (1992)

    Google Scholar 

  29. Sidorova, N., Steffen, M.: Embedding chaos. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 319–334. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  30. Sidorova, N., Steffen, M.: Verifying large SDL-specifications using model checking. In: Reed, R., Reed, J. (eds.) SDL 2001. LNCS, vol. 2078, pp. 403–416. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  31. Sidorova, N., Steffen, M.: Synchronous closing of timed SDL systems for model checking. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 79–93. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  32. Valmari, A.: A stubborn attack on state explosion. Formal Methods in System Design. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 156–165. Springer, Heidelberg (1991); CAV 1990. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 3, pp. 25–41. AMS & ACM (1992)

    Google Scholar 

  33. A wireless ATM network demonstrator (WAND), ACTS project AC085.http:// (1998), http://www.tik.ee.ethz.ch/~wand/

Download references

Author information

Authors and Affiliations

  1. Department of Software Engineering, CWI, P.O. Box 94079, 1090 GB, Amsterdam, The Netherlands

    Natalia Ioustinova

  2. Department of Mathematics and Computer Science, Eindhoven University of Technology, Den Dolech 2, P.O. Box 513, 5612 MB, Eindhoven, The Netherlands

    Natalia Sidorova

  3. Institute of Computer Science and Applied Mathematics, Christian-Albrechts-Universität, Hermann-Rodewaldstr. 3, 24118, Kiel, Germany

    Martin Steffen

Authors
  1. Natalia Ioustinova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natalia Sidorova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Steffen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Mathematics and Computer Science, CWI, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Frank S. de Boer

  2. Leiden Institute of Advanced Computer Science, Leiden University, P.O. Box 9512, 2300, Leiden, RA, The Netherlands

    Marcello M. Bonsangue

  3. Centre Equitation, VERIMAG, 2 Avenue de Vignate, 38610, Grenoble-Gières, France

    Susanne Graf

  4. Institute of Computer Science and Applied Mathematics, Christian-Albrechts University Kiel, Hermann-Rodewald-Straße 3, 24118, Kiel, Germany

    Willem-Paul de Roever

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ioustinova, N., Sidorova, N., Steffen, M. (2004). Synchronous Closing and Flow Analysis for Model Checking Timed Systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2003. Lecture Notes in Computer Science, vol 3188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30101-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30101-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22942-1

  • Online ISBN: 978-3-540-30101-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation