Abstract
Timed computation tree logic (Tctl) extends Ctl by allowing timing constraints on the temporal operators. The semantics of Tctl is defined on a dense tree. The satisfiability of Tctl-formulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs. According to the known results there are two possible causes of such undecidability: the denseness of the underlying structure and the equality in the timing constraints. We prove that the second one is the only source of undecidability when the structures are defined by timed graphs. In fact, if the equality is not allowed in the timing constraints of Tctl-formulae then the finite satisfiability in Tctl is decidable. We show this result by reducing this problem to the emptiness problem of timed tree automata, so strengthening the already well-founded connections between finite automata and temporal logics.
Work partially supported by M.U.R.S.T. grant TOSCA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2–34, 1993.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43(1):116–146, 1996.
R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104(1):35–77, 1993.
E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of Workshop on Logic of Programs, LNCS 131, pages 52–71. Springer-Verlag, 1981.
M. Dickhofer and T. Wilke. Timed alternating tree automata: the automatatheoretic solution to the TCTL model checking problem. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming, LNCS 1644, pages 281–290. Springer-Verlag, 1999.
E.A. Emerson. Temporal and modal logic. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995–1072. Elsevier Science Publishers, 1990.
E.A. Emerson, A.K. Mok, A.P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In Proceedings of the 2nd International Conference on Computer Aided Verification, LNCS 531, pages 136–145. Springer-Verlag, 1990.
T.A. Henzinger. It’s about time: Real-time logics reviewed. In Proceedings of the 9th International Conference on Concurrency Theory, CONCUR’98, LNCS 1466, pages 439–454. Springer-Verlag, 1998.
D. Harel and A. Pnueli. On the development of reactive systems. In Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477–498. Springer-Verlag, 1985.
F. Jahanian and A.K. Mok. Safety analysis of timing properties in real-time systems. IEEE Transactions on Software Engineering, SE-12(9):890–904, 1986.
R. Koymans. Specifying real-time properties with metric temporal logic. Journal of Real-Time Systems, 2:255–299, 1990.
S. LaTorre and M. Napoli. Timed tree automata with an application to temporal logic. Technical report, Dipartimento di Informatica ed Applicazioni, Universitá degli Studi di Salerno Italy, 1997. URL:“http://www.cis.upenn.edu/~latorre/Papers/stctl.ps.gz”.
A. Pnueli and E. Harel. Applications of temporal logic to the specification of real-time systems. In Formal Techniques in Real-time and Fault-tolerant Systems, LNCS 331, pages 84–98. Springer-Verlag, 1988.
A. Pnueli. The temporal logic of programs. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 46–77, 1977.
M.O. Rabin. Automata on infinite objects and Churchś problem. Trans. Amer. Math. Soc., 1972.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133–191. Elsevier Science Publishers, 1990. [URL] URL: “http://www.cis.upenn.edu/~latorre/Papers/fsttcs.ps.gz”.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torre, S.L., Napoli, M. (2000). A Decidable Dense Branching-Time Temporal Logic. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-44450-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41413-1
Online ISBN: 978-3-540-44450-3
eBook Packages: Springer Book Archive