Translating a Continuous-Time Temporal Logic into Timed Automata

  • Guangyuan Li
  • Zhisong Tang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2895)


LTLC is a continuous-time linear temporal logic for the specification of real-time systems. It can express both real-time systems and their properties. With LTLC, real-time systems can be described at different levels of abstraction, from high-level requirement specifications to low-level implementation models, and the conformance between different descriptions can be expressed by logical implication. The full logic of LTLC is undecidable. This paper will show that the existentially quantified fragment of LTLC is decidable. We achieve this goal by showing that the fragment can be translated into timed automata. Because the emptiness problem for timed automata is decidable, we then get a decision procedure for satisfiability for this fragment. This decidable part of LTLC is quite expressive. Many important real-time properties, such as bounded-response and bounded-invariance properties, can be expressed in it. The translation also enables us to develop a decision procedure for model checking real-time systems with quantifier-free LTLC specifications.


Temporal Logic Critical Section Boolean Variable Linear Temporal Logic Proof Obligation 
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.
    Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Information and Computation 104, 2–34 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM 43, 116–146 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Alur, R., Henzinger, T.A.: Logics and models of real time: a survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, Springer, Heidelberg (1992)Google Scholar
  5. 5.
    Alur, R., Henzinger, T.A.: A really temporal logic. Journal of the ACM 41, 181–204 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bjørner, N., Manna, Z., Sipma, H., Uribe, T.: Deductive Verification of Real-time Systems using STeP. Theoretical Computer Science 253, 27–60 (2001)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Hirshfeld, Y., Rabinovich, A.: Quantitative Temporal Logic. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 172–187. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. 8.
    Laroussinie, F., Larsen, K., Weise, C.: From timed automata to logic -and back. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 529–540. Springer, Heidelberg (1995)Google Scholar
  9. 9.
    Li, G.: LTLC: A Continuous-time Temporal Logic for Real-time and Hybrid Systems, PhD Thesis, Institute of Software, Chinese Academy of Sciences (March 2001)Google Scholar
  10. 10.
    Li, G., Tang, Z.: Modeling Real-Time Systems with Continuous-Time Temporal Logic. In: George, C.W., Miao, H. (eds.) ICFEM 2002. LNCS, vol. 2495, pp. 231–236. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems: Specification. Springer, New York (1992)Google Scholar
  12. 12.
    Manna, Z., Pnueli, A.: Clocked transition systems. In: Logic and Software Workshop, Beijing, China (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Guangyuan Li
    • 1
  • Zhisong Tang
    • 1
  1. 1.Key Laboratory of Computer Science, Institute of SoftwareThe Chinese Academy of SciencesBeijingP.R. of China

Personalised recommendations