Skip to main content
Log in

Issues in distributed timed model checking

Building Zeus

  • Special section on parallel and distributed model checking
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

In this work we present Zeus, a distributed timed model checker that evolves from the TCTL model checker Kronos [13] and that currently can handle backwards computation of reachability properties [2] over timed automata [3].

Zeus was developed following a software architecture-centric approach. Its conceptual architecture was conceived to be sufficiently modular to house several features such as a priori graph partitioning, synchronous and asynchronous computation, communication piggybacking, delayed messaging, and dead-time utilization.

Surprisingly enough, early experiments pinpointed the difficulties of getting speedups using asynchronous versions and showed interesting results on the synchronous counterpart, although being intuitively less attractive.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur R, Courcoubetis C, Dill D, Halbwachs N, Wong-Toi H (1992) An implementation of three algorithms for timing verification based on automata emptiness. In: Proceedings of the 13th IEEE Real-Time Systems Symposium (RTSS ’92), Phoenix, AZ, pp 157–166

  2. Alur R, Courcoubetis C, Dill DL (1993) Model-checking in dense real-time. Inf Comput 104(1):2–34

    Article  MathSciNet  Google Scholar 

  3. Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126(2):183–235

    Article  MathSciNet  Google Scholar 

  4. Barnat J, Brim L, Stríbřná J (2001) Distributed LTL model-checking in SPIN. In: Proceedings of the 7th international SPIN workshop. Lecture notes in computer science, vol 2057. Springer, Berlin Heidelberg New York, pp 200–216

  5. Behrmann G (2002) A performance study of distributed timed automata reachability analysis. In: Proceedings of the workshop on parallel and distributed model checking, affiliated with the 13th international conference on concurrency theory (CONCUR ’02), Brno, Czech Republic, August 2002. Eelectronic notes in theoretical computer science, vol 68. Elsevier, Amsterdam

  6. Behrmann G, Hune T, Vaandrager FW (2000) Distributing timed model checking – how the search order matters. In: Proceedings of the 12th international conference on computer aided verification (CAV ’00). Lecture notes in computer science, vol 1855. Springer, Berlin Heidelberg New York, pp 216–231

  7. Ben-David S, Heyman T, Grumberg O, Schuster A (2000) Scalable distributed on-the-fly symbolic model checking. In: Proceedings of the 3rd international conference on formal methods in computer-aided design 2000. Lecture notes in computer science, vol 1954. Springer, Berlin Heidelberg New York, pp 390–404

  8. Bollig B, Leucker M, Weber M (2001) Parallel model checking for the alternation free μ-calculus. In: Proceedings of the 7th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’01). Lecture notes in computer science, vol 2031. Springer, Berlin Heidelberg New York, pp 543–558

  9. Braberman V, Garbervetsky D, Olivero A (2002a) Improving the verification of timed systems using influence information. In: Proceedings of the 8th international conference on tools and algorithms for the construction and analysis of systems (TACAS ’02), Grenoble, France, April 2002. Lecture notes in computer science, vol 2280. Springer, Berlin Heidelberg New York, pp 21–36

  10. Braberman V, López Pombo C, Olivero A (2002b) On improving backwards verification for timed automata. In: Proceedings of the workshop on theory and practice of timed systems (TPTS ’02), satellite event for the Joint European conference on theory and practice of software, ETAPS 2002, Grenoble, France, April 2002. Electronic notes in theoretical computer science, vol 65. Elsevier, Amsterdam

  11. Braberman V, Olivero A, Schapachnik F (2002c) Zeus: A distributed timed model checker based on Kronos. In: Proc. of the Workshop on Parallel and Distributed Model Checking, afiliated to the 13th International Conference on Concurrency Theory (CONCUR ’02), Brno, Czech Republic, ENTCS, vol 68. Elsevier, August

  12. Cousot P (1978) Methodes iteratives de construction et d’aproximation de points fixes d’operateurs monotones sur un treillis, analyse semantique des programmes. Ph.D. thesis, Université Scientifique et Médicale de Grenoble, Institut National Polytechnique de Grenoble, France

  13. Daws C, Olivero A, Tripakis S, Yovine S (1996) The tool KRONOS. In: Proceedings of Hybrid Systems III. Lecture notes in computer science, vol 1066. Springer, Berlin Heidelberg New York, pp 208–219

  14. Daws C, Yovine S (1995) Two examples of verification of multirate timed automata with Kronos. In: Proceedings of the 16th IEEE real-time systems symposium (RTSS ’95), Pisa, Italy, December 1995. IEEE Press, New York, pp 66–75

  15. Daws C, Yovine S (1996) Reducing the number of clock variables of timed automata. In: Proceedings of the 17th IEEE real-time systems symposium (RTSS ’96), Washington DC, December 1996. IEEE Press, New York, pp 73–81

  16. Dill DL (1990) Timing assumptions and verification of finite-state concurrent systems. In: Proceedings of the international workshop of automatic verification methods for finite state systems, Grenoble, France, June 1990. Lecture notes in computer science, vol 407. Springer, Berlin Heidelberg New York, pp 197–212

  17. Garavel H, Mateescu R, Smarandache IM (2001) Parallel state space construction for model-checking. In: Dwyer MB (ed) Proceedings of the 8th international SPIN workshop, Toronto, Canada, pp 217–234

  18. Goldsmith M, Martin J (2002) Parallelization of FDR. In: Proceedings of the workshop on parallel and distributed model checking, affiliated with the 13th international conference on concurrency theory (CONCUR ’02), Brno, Czech Republic, August 2002

  19. Grumberg O, Heyman T, Schuster A (2001) Distributed symbolic model checking for μ-calculus. In: Proceedings of the 13th international conference on computer aided verification (CAV ’01). Lecture notes in computer science, vol 2102. Springer, Berlin Heidelberg New York, pp 350–362

  20. Heljanko K, Khomenko V, Koutny M (2002) Parallelisation of the petri net unfolding algorithm. In: Proceedings of the 8th international conference on tools and algorithms for construction and analysis of systems (TACAS ’02). Lecture notes in computer science, vol 2280. Springer, Berlin Heidelberg New York, pp 371–385

  21. Henzinger TA, Nicollin X, Sifakis J, Yovine S (1994) Symbolic model checking for real-time systems. Inf Comput 111(2):193–244

    Article  MathSciNet  Google Scholar 

  22. Heyman T, Geist D, Grumberg O, Schuster A (2002) Achieving scalability in parallel reachability analysis of very large circuits. Formal Meth Sys Des 21(2):317–338

    Article  Google Scholar 

  23. Karypis G, Kumar V (1998) Parallel multilevel k-way partitioning scheme for irregular graphs. Technical report, University of Minnesota, Department of Computer Science /US Army HPC Research Center, Minneapolis, MN, March 1998

  24. Lerda F, Sisto R (1999) Distributed-memory model checking with SPIN. In: Proceedings of the 5th international SPIN workshop. Lecture notes in computer science, vol 1680. Springer, Berlin Heidelberg New York

  25. Bozga M, Maler O, Pnueli A, Yovine S (1997) Some progress in the symbolic verification of timed automata. In: Grumberg O (ed) Proceedings of the 9th international conference on computer aided verification (CAV ’97), Israel. Lecture notes in computer science, vol 1254. Springer, Berlin Heidelberg New York, pp 179–190

  26. Ranjan R, Sanghavi J, Brayton R, Sangiovanni-Vincentelli A (1996) Binary decision diagrams on network of workstations. In: Proceedings of the international conference on computer design. IEEE Press, New York, pp 358–364

  27. Schapachnik F (2002) Distributed and parallel verification of real-time systems. Degree thesis, Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, June 2002

  28. Stern U, Dill DL (1997) Parallelizing the Murϕ verifier. In: Proceedings of the 9th international conference on computer aided verification (CAV ’97). Lecture notes in computer science, vol 1254. Springer, Berlin Heidelberg New York, pp 256–278

  29. Tripakis S (1998) The analysis of timed systems in practice. Ph.D. thesis, Universitè Joseph Fourier, Grenoble, France, December 1998

  30. Tripakis S, Yovine S (1998) Verification of the fast reservation protocol with delayed transmission using the tool Kronos. In: Proceedings of the 4th IEEE real-time technology and applications symposium (RTAS ’98), Denver, CO, June 1998. IEEE Press, New York, pp 165–170

  31. Yovine S (1997) Kronos: a verification tool for real-time systems. Int J Softw Tools Technol Transfer 1(1+2):123–133

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Víctor Braberman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Braberman, V., Olivero, A. & Schapachnik, F. Issues in distributed timed model checking. Int J Softw Tools Technol Transfer 7, 4–18 (2005). https://doi.org/10.1007/s10009-004-0143-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-004-0143-z

Keywords

Navigation