Verifying networks of timed processes

Extended abstract
  • Parosh Aziz Abdulla
  • Bengt Jonsson
Regular Sessions Verification of Real-Time Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1384)


Over the last years there has been an increasing research effort directed towards the automatic verification of infinite state systems, such as timed automata, hybrid automata, data-independent systems, relational automata, Petri nets, and lossy channel systems. We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of identical timed automata, each with a single real-valued clock. Using a standard reduction from safety properties to reachability properties, we can use our algorithm to decide general safety properties of timed networks. To our knowledge, this is the first decidability result concerning verification of systems that are infinite-state in “two dimensions”: they contain an arbitrary set of (identical) processes, and they use infinite data-structures, viz. real-valued clocks. We illustrate our method by showing how it can be used to automatically verify Fischer's protocol, a timer-based protocol for enforcing mutual exclusion among an arbitrary number of processes.


Shared Variable Critical Section Constraint System Mutual Exclusion Controller State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [ACD90]
    R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th IEEE Int. Symp. on Logic in Computer Science, pages 414–425, Philadelphia, 1990.Google Scholar
  2. [ACHH92]
    R. Alur, C. Courcoubetis, T. Henzinger, and P.-H. Ho. Hybrid automata: An algorithmic approach to the specification and verificationof hybrid systems. In Grossman, Nerode, Ravn, and Rischel, editors, Hybrid Systems, number 736 in Lecture Notes in Computer Science, pages 209–229, 1992.Google Scholar
  3. [ACJYK96]
    Parosh Aziz Abdulla, Karlis čerāns, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. 11th IEEE Int. Symp. on Logic in Computer Science, pages 313–321, 1996.Google Scholar
  4. [AJ96]
    Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91–101, 1996.zbMATHMathSciNetCrossRefGoogle Scholar
  5. [AK95]
    Parosh Aziz Abdulla and Mats Kindahl. Decidability of simulation and bisimulation between lossy channel systems and finite state systems. In Lee and Smolka, editors, Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 333–347. Springer Verlag, 1995.Google Scholar
  6. [BD91]
    B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. on Software Engineering, 17(3):259–273, 1991.MathSciNetCrossRefGoogle Scholar
  7. [BS95]
    O. Burkart and B. Steffen. Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89–125, 1995.zbMATHMathSciNetGoogle Scholar
  8. [Cer94]
    K. čerāns. Deciding properties of integral relational automata. In Abiteboul and Shamir, editors, Proc. ICALP '94, volume 820 of Lecture Notes in Computer Science, pages 35–46. Springer Verlag, 1994.Google Scholar
  9. [CES86]
    E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans. on Programming Languages and Systems, 8(2):244–263, April 1986.zbMATHCrossRefGoogle Scholar
  10. [CGJ95]
    E. M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. In Lee and Smolka, editors, Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 395–407. Springer Verlag, 1995.Google Scholar
  11. [Fin90]
    A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89:144–179, 1990.zbMATHMathSciNetCrossRefGoogle Scholar
  12. [GMMP91]
    C. Ghezzi, D. Mandrioli, S. Morasca, and M. Pezzè. A unified high-level Petri net formalism for time-critical systems. IEEE Trans. on Software Engineering, 17(2):160–172, 1991.CrossRefGoogle Scholar
  13. [God94]
    J.C. Godskesen. Timed Modal Specifications. PhD thesis, Aalborg University, 1994.Google Scholar
  14. [GS92]
    S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675–735, 1992.zbMATHMathSciNetCrossRefGoogle Scholar
  15. [Hen95]
    T.A. Henzinger. Hybrid automata with finite bisimulations. In Proc. ICALP '95, 1995.Google Scholar
  16. [Hig52]
    G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc, 2:326–336, 1952.zbMATHMathSciNetGoogle Scholar
  17. [JM95]
    P. Jancar and F. Moller. Checking regular properties of Petri nets. In Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory, pages 348–362, 1995.Google Scholar
  18. [JP93]
    B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and Computation, 107(2):272–302, Dec. 1993.zbMATHMathSciNetCrossRefGoogle Scholar
  19. [KLL+97]
    K.J. Kristoffersen, F. Larroussinie, K. G. Larsen, P. Pettersson, and W. Yi. A compositional proof of a real-time mutual exclusion protocol. In TAP-SOFT '97 7th International Joint Conference on the Theory and Practice of Software Development, Lecture Notes in Computer Science, Lille, France, April 1997. Springer Verlag.Google Scholar
  20. [KM89]
    R.P. Kurshan and K. McMillan. A structural induction theorem for processes. In Proc. 8th ACM Symp. on Principles of Distributed Computing, Canada, pages 239–247, Edmonton, Alberta, 1989.Google Scholar
  21. [LSW95]
    K.G. Larsen, B. Steffen, and C. Weise. Fischer's protocol revisited: a simples proof using modal constraints. In 4th DIM ACS Workshop on Verification and Control of Hybrid Systems, New Brunswick, New Jersey, Oct. 1995.Google Scholar
  22. [SBK92]
    F. B. Schneider, Bloom B, and Marzullo K. Putting time into proof outlines. In de Bakker, Huizing, de Roever, and Rozenberg, editors, RealTime: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 1992.Google Scholar
  23. [VW86]
    M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st IEEE Int. Symp. on Logic in Computer Science, pages 332–344, June 1986.Google Scholar
  24. [Wol86]
    Pierre Wolper. Expressing interesting properties of programs in prepositional temporal logic (extended abstract). In Proc. 13th ACM Symp. on Principles of Programming Languages, pages 184–193, Jan. 1986.Google Scholar
  25. [Yi91]
    Wang Yi. CCS + Time = an interleaving model for real time systems. In Leach Albert, Monien, and Rodriguez Artalejo, editors, Proc. ICALP '91, volume 510 of Lecture Notes in Computer Science. Springer Verlag, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Parosh Aziz Abdulla
    • 1
  • Bengt Jonsson
    • 1
  1. 1.Dept. of Computer SystemsUppsala UniversityUppsalaSweden

Personalised recommendations