State clock logic: A decidable real-time logic

  • Jean-François Raskin
  • Pierre-Yves Schobbens
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1201)


In this paper we define a real-time logic called SC logic. This logic is defined in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al [6]. Unlike timed automata [4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A procedure to translate each SC formula into a SC automaton is presented. The main contribution of this paper is to complete the framework of this class of determinizable automata with a temporal logic and to introduce the notion of event clock in the domain of temporal logic.


Model Check Temporal Logic Linear Temporal Logic Satisfiability Problem State Clock 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Stanford University, 1991.Google Scholar
  2. 2.
    R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proceedings of the 5th Symposium on Logic in Computer Science, pages 414–425, Philadelphia, June 1990.Google Scholar
  3. 3.
    R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2–34, 1993. Preliminary version appears in the Proc. of 5th LICS, 1990.Google Scholar
  4. 4.
    R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994. Preliminary version appears in Proc. 17th ICALP, 1990, LNCS 443.Google Scholar
  5. 5.
    R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116–146, 1996.Google Scholar
  6. 6.
    R. Alur, L. Fix, and T.A. Henzinger. A determinizable class of timed automata. In Proceedings of the Sixth Conference on Computer-Aided Verification, Lecture Notes in Computer Science 818, pages 1–13. Springer-Verlag, 1994.Google Scholar
  7. 7.
    R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 74–106. Springer-Verlag, 1992.Google Scholar
  8. 8.
    R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104(1):35–77, 1993. Preliminary version appears in the Proc. of 5th LICS, 1990.Google Scholar
  9. 9.
    R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181–204, 1994. Preliminary version appears in Proc. 30th FOCS, 1989.Google Scholar
  10. 10.
    A. Bouajjani and Y. Lakhnech. Temporal Logic + Timed Automata: Expressiveness and Decidability. In Proc. Intern. Conf. on Concurrency Theory (CONCUR'95), Philadelphia, August 1995. LNCS 962, 1995.Google Scholar
  11. 11.
    J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the 5th Symposium on Logic in Computer Science, pages 428–439, Philadelphia, June 1990.Google Scholar
  12. 12.
    E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, January 1986.Google Scholar
  13. 13.
    P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of Fourth ACM Symposium on Programming Languages (POPL'77), pages 238–252, Los Angeles, California, January 1977.Google Scholar
  14. 14.
    Dennis René Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands, July 1996.Google Scholar
  15. 15.
    E.A. Emerson. Handbook in Theoretical Computer Science, Formal Models and Semantics, chapter Temporal and Modal Logic, pages 995–1072. Elsevier, 1990.Google Scholar
  16. 16.
    R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Work. Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.Google Scholar
  17. 17.
    N. Halbwachs. Verification of Linear Hybrid Systems by Means of Convex Approximations. In Proceedings of SAS'94, Lecture Notes in Computer Science 864, pages 223–237, 1994.Google Scholar
  18. 18.
    C.L. Heitmeyer and N. Lynch. The generalized railroad crossing: A case study in formal verification of real-time systems. In Proc. of the IEEE Real-Time Systems Symposium, San Juan, Puerto Rico, December 7–9, 1994.Google Scholar
  19. 19.
    Ron Koymans. Specifying message passing and time-critical systems with temporal logic. LNCS 651, Springer-Verlag, 1992.Google Scholar
  20. 20.
    Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, Berlin, January 1995.Google Scholar
  21. 21.
    A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46–57, 1977.Google Scholar
  22. 22.
    J.-F. Raskin and P.-Y. Schobbens. State Clock Logic: a Decidable Real-Time Logic. Research Paper RP-10-96, Computer Science Department, FUNDP, Namur (Belgium), May 1996.Google Scholar
  23. 23.
    C. Stirling. Comparing linear and branching time temporal logics. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, volume 398, pages 1–20. Lecture Notes in Computer Science, Springer-Verlag, 1987.Google Scholar
  24. 24.
    P. Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, (110–111):119–136, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jean-François Raskin
    • 1
  • Pierre-Yves Schobbens
    • 1
  1. 1.Computer Science InstituteUniversity of NamurNamurBelgium

Personalised recommendations