Advertisement

Abstract

In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (absence of deadlocks) and time progress (absence of deadlocks and timelocks) and give static sufficient conditions for a model of TA to be deadlock- and timelock-free. We also present dynamic techniques for deadlock and timelock detection. The techniques are based on forward symbolic reachability and are on-the-fly, that is, they can return an answer as soon as possible, without necessarily having to construct and store the whole state space.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACD93]
    R. Alur, C. Courcoubetis, and D.L. Dill. Model checking in dense real time. Information and Computation, 104(1):2–34, 1993.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [BFK+98]_H. Bowman, G. Faconti, J-P. Katoen, D. Latella, and M. Massink. Automatic verification of a lip synchronisation algorithm using uppaal. In 3rd International Workshop on Formal Methods for Industrial Critical Systems, 1998.Google Scholar
  3. [BS97]
    S. Bornot and J. Sifakis. Relating time progress and deadlines in hybrid systems. In International Workshop, HART’97, pages 286–300, Grenoble, France, March 1997. Lecture Notes in Computer Science 1201, Spinger-Verlag.Google Scholar
  4. [BST98]
    S. Bornot, J. Sifakis, and S. Tripakis. Modeling urgency in timed systems. In Compositionality, LNCS 1536, 1998. To appear.Google Scholar
  5. [Daw98]
    C. Daws. Méthodes d’analyse de systèmes temporisés: de la théorie à la pratique. PhD thesis, Institut National Polytechnique de Grenoble, 1998. In french.Google Scholar
  6. [Dil89]
    D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science 407, pages 197–212. Springer-Verlag, 1989.CrossRefGoogle Scholar
  7. [DT98]
    C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In Tools and Algorithms for the Construction and Analysis of Systems’ 98, Lisbon, Portugal, volume 1384 of LNCS. Springer-Verlag, 1998.Google Scholar
  8. [HNSY94]
    T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.MathSciNetCrossRefzbMATHGoogle Scholar
  9. [Oli94]
    A. Olivero. Modélisation et analyse de systèmes temporisés et hybrides. PhD thesis, Institut National Polytechnique de Grenoble, 1994. In french.Google Scholar
  10. [SY96]
    J. Sifakis and S. Yovine. Compositional specification of timed systems. In 13th Annual Symposium on Theoretical Aspects of Computer Science, STACS’96, pages 347–359, Grenoble, France, February 1996. Lecture Notes in Computer Science 1046, Spinger-Verlag.Google Scholar
  11. [Tri98]
    S. Tripakis. The formal analysis of timed systems in practice. PhD thesis, Université Joseph Fourrier de Grenoble, 1998. To be published.Google Scholar
  12. [Yov93]
    S. Yovine. Méthodes et outils pour la vérification symbolique de systèmes temporisés. PhD thesis, Institut National Polytechnique de Grenoble, 1993. In french.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Stavros Tripakis
    • 1
  1. 1.BerkeleyUSA

Personalised recommendations