Skip to main content

Closing Open SDL-Systems for Model Checking with DTSpin

  • Conference paper
  • First Online:
FME 2002:Formal Methods—Getting IT Right (FME 2002)

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

Included in the following conference series:

Abstract

Model checkers like Spin can handle closed reactive systems, only. Thus to handle open systems, in particular when using assume-guarantee reasoning, we need to be able to close (sub-)systems, which is commonly done by adding an environment process. For models with asynchronous message-passing communication, however, modelling the environment as separate process will lead to a combinatorial explosion caused by all combinations of messages in the input queues.

In this paper we describe the implementation of a tool which automatically closes DTPromela translations of SDL-specifications by embedding the timed chaotic environment into the system. To corroborate the usefulness of our approach, we compare the state space of models closed by embedding chaos with the state space of the same models closed with chaos as external environment process on some simple models and on a case study from a wireless ATM medium-access protocol.

Supported by the CWI-project “Systems Validation Centre (SVC)”.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Telelogic TAU SDL Suite. http://www.telelogic.com/products/sdl/, 2002.

  2. R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: Modularity in model checking. In A. J. Hu and M. Y. Vardi, editors, Proceedings of CAV’ 98, volume 1427 of Lecture Notes in Computer Science, pages 521–525. Springer-Verlag, 1998.

    Google Scholar 

  3. D. Bošnački and D. Dams. Integrating real time into Spin: A prototype implementation. In S. Budkowski, A. Cavalli, and E. Najm, editors, Proceedings of Formal Description Techniques and Protocol Specification, Testing, and Verification (FORTE/PSTV’98). Kluwer Academic Publishers, 1998.

    Google Scholar 

  4. D. Bošnački, D. Dams, L. Holenderski, and N. Sidorova. Verifying SDL in Spin. In S. Graf and M. Schwartzbach, editors, TACAS 2000, volume 1785 of Lecture Notes in Computer Science. Springer-Verlag, 2000.

    Google Scholar 

  5. M. Bozga, J.-C. Fernandez, L. Ghirvu, S. Graf, J.-P. Krimm, and L. Mounier. IF: An intermediate representation and validation environment for timed asynchronous systems. In J. Wing, J. Woodcock, and J. Davies, editors, Proceedings of Symposium on Formal Methods (FM 99), volume 1708 of Lecture Notes in Computer Science. Springer-Verlag, Sept. 1999.

    Google Scholar 

  6. M. Bozga, J.-C. Fernandez, L. Ghirvu, S. Graf, J.-P. Krimm, and L. Mounier. IF: A validation environment for timed asynchronous systems. In E. A. Emerson and A. P. Sistla, editors, Proceedings of CAV’ 00, volume 1855 of Lecture Notes in Computer Science. Springer-Verlag, 2000.

    Google Scholar 

  7. M. Bozga, S. Graf, A. Kerbrat, L. Mounier, I. Ober, and D. Vincent. SDL for real-time: What is missing? In Y. Lahav, S. Graf, and C. Jard, editors, Electronic Proceedings of SAM’00, 2000.

    Google Scholar 

  8. E. Clarke, O. Grumberg, and D. Long. 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 92.

    Article  Google Scholar 

  9. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic specifications. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs 1981, volume 131 of Lecture Notes in Computer Science, pages 244–263. Springer-Verlag, 1982.

    Google Scholar 

  10. E. M. Clarke and J. M. Wing. Formal methods: State of the art and future directions. ACM Computing Surveys, Dec. 1996. Available also as Carnegie Mellon University technical report CMU-CS-96-178.

    Google Scholar 

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

    Google Scholar 

  12. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximaton of fixpoints. In Fourth Annual Symposium on Principles of Programming Languages (POPL) (Los Angeles, Ca), pages 238–252. ACM, January 1977.

    Google Scholar 

  13. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems: Abstraction preserving ∀CTL*,∃CTL*, and CTL*. In E.-R. Olderog, editor, Proceedings of PROCOMET’ 94. IFIP, North-Holland, June 1994.

    Google Scholar 

  14. Discrete-time Spin. http://win.tue.nl/dragan/DTSpin.html, 2000.

  15. M. Dwyer and D. Schmidt. Limiting state explosion with filter-based refinement. In Proceedings of the 1st International Workshop in Verification, Abstract Interpretation, and Model Checking, Oct. 1997.

    Google Scholar 

  16. M. B. Dwyer and J. Hatcliff. Slicing software for model construction. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM’99), Jan. 1999.

    Google Scholar 

  17. M. B. Dwyer and C. S. Pasareanu. Filter-based model checking of partial systems. In Proceedings of the 6th ACM SIGSOFT Symposium on the Foundations of Software Engineering (SIGSOFT’ 98), pages 189–202, 1998.

    Google Scholar 

  18. A. B. F. Regensburger. Formal verification of SDL systems at the Siemens mobile phone department. In B. Steffen, editor, Proceedings of TACAS’ 98, number 1384 in Lecture Notes in Computer Science, pages 439–455. Springer-Verlag, 1998.

    Google Scholar 

  19. J. Guoping and S. Graf. Verification experiments on the Mascara protocol. In M. B. Dwyer, editor, Model Checking Software, Proceedings of the 8th International SPIN Workshop (SPIN 2001), Toronto, Canada, Lecture Notes in Computer Science, pages 123–142. Springer-Verlag, 2001.

    Google Scholar 

  20. M. S. Hecht. Flow Analysis of Programs. North-Holland, 1977.

    Google Scholar 

  21. U. Hinkel. Verification of SDL specifications on the basis of stream semantics. In Y. Lahav, A. Wolisz, J. Fischer, and E. Holz, editors, Proceedings of the 1st Workshop of the SDL Forum Society on SDL and MSC (SAM’98), pages 241–250, 1998.

    Google Scholar 

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

    Google Scholar 

  23. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.

    Google Scholar 

  24. G. Kildall. A unified approach to global program optimization. In Proceedings of POPL’ 73, pages 194–206. ACM, January 1973.

    Google Scholar 

  25. O. Kupferman and M. Y. Vardi. Module checking revisited. In O. Grumberg, editor, CAV’ 97, Proceedings of the 9th International Conference on Computer-Aided Verification, Haifa. Israel, volume 1254 of Lecture Notes in Computer Science. Springer, June 1997.

    Google Scholar 

  26. O. Kupferman, M. Y. Vardi, and P. Wolper. Module checking. In R. Alur, editor, Proceedings of CAV’ 96, volume 1102 of Lecture Notes in Computer Science, pages 75–86, 1996.

    Google Scholar 

  27. L. G. M. Bozga, J. Cl. Fernandez. State space reduction based on Live. In A. Cortesi and G. Filé, editors, Proceedings of SAS’ 99, volume 1694 of Lecture Notes in Computer Science. Springer-Verlag, 1999.

    Google Scholar 

  28. L. I. Millet and T. Teitelbaum. Slicing promela and its application to model checking, simulation, and protocol understanding. In E. Najm, A. Serhrouchni, and G. Holzmann, editors, Electronic Proceedings of the Fourth International SPIN Workshop, Paris, France, Nov. 1998.

    Google Scholar 

  29. F. Nielson, H.-R. Nielson, and C. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.

    Google Scholar 

  30. ObjectGeode 4. http://www.csverilog.com/products/geode.htm, 2000.

  31. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In M. Dezani-Ciancaglini and U. Montanari, editors, Proceedings of the 5th International Symposium on Programming 1981, volume 137 of Lecture Notes in Computer Science, pages 337–351. Springer-Verlag, 1982.

    Google Scholar 

  32. N. Sidorova and M. Steffen. Embedding chaos. In P. Cousot, editor, Proceedings of the 8th Static Analysis Symposium (SAS’01), volume 2126 of Lecture Notes in Computer Science, pages 319–334. Springer-Verlag, 2001.

    Google Scholar 

  33. N. Sidorova and M. Steffen. Verifying large SDL-specifications using model checking. In R. Reed and J. Reed, editors, Proceedings of the 10th International SDL Forum SDL 2001: Meeting UML, volume 2078 of Lecture Notes in Computer Science, pages 403–416. Springer-Verlag, Feb. 2001.

    Chapter  Google Scholar 

  34. N. Sidorova and M. Steffen. Synchronous closing of timed SDL systems for model checking. In A. Cortesi, editor, Proceedings of the hird International Workshop on Verification, Model Checking, and Abstract Interpretation (VMCAI) 2002, volume 2294 of Lecture Notes in Computer Science, pages 79–93. Springer-Verlag, 2002.

    Chapter  Google Scholar 

  35. H. Tuominen. Embedding a dialect of SDL in Promela. In D. Dams, R. Gerth, S. Leue, and M. Massink, editors, Theoretical and Practical Aspects of SPIN Model Checking, Proceedings of 5th and 6th International SPIN Workshops, Trento/Toulouse, volume 1680 of Lecture Notes in Computer Science, pages 245–260. Springer-Verlag, 1999.

    Chapter  Google Scholar 

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

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ioustinova, N., Sidorova, N., Steffen, M. (2002). Closing Open SDL-Systems for Model Checking with DTSpin. In: Eriksson, LH., Lindsay, P.A. (eds) FME 2002:Formal Methods—Getting IT Right. FME 2002. Lecture Notes in Computer Science, vol 2391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45614-7_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-45614-7_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45614-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics