Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3209108.3209143acmconferencesArticle/Chapter ViewAbstractPublication PageslicsConference Proceedingsconference-collections
research-article

Automaton-Based Criteria for Membership in CTL

Published: 09 July 2018 Publication History

Abstract

Computation Tree Logic (CTL) is widely used in formal verification, however, unlike linear temporal logic (LTL), its connection to automata over words and trees is not yet fully understood. Moreover, the long sought connection between LTL and CTL is still missing; It is not known whether their common fragment is decidable, and there are very limited necessary conditions and sufficient conditions for checking whether an LTL formula is definable in CTL.
We provide sufficient conditions and necessary conditions for LTL formulas and ω-regular languages to be expressible in CTL. The conditions are automaton-based; We first tighten the automaton characterization of CTL to the class of Hesitant Alternating Linear Tree Automata (HLT), and then conduct the conditions by relating between the cycles of a word automaton for a given ω-regular language and the cycles of a potentially equivalent HLT.
The new conditions allow to simplify proofs of known results on languages that are definable, or not, in CTL, as well as to prove new results. Among which, they allow us to refute a conjecture by Clarke and Draghicescu from 1988, regarding a condition for a CTL formula to be expressible in CTL.

References

[1]
A. Aziz, V. Singhal, F. Balarin, R. Brayton, and A.L. Sangiovanni-Vincentelli. 1994. Equivalences for fair Kripke Structures. In Proc. ICALP. 364--375.
[2]
M. Bojańczyk. 2008. The common fragment of ACTL and LTL. In Proc. of FoSSaCS. Springer, 172--185.
[3]
E.M. Clarke. 2008. The birth of model checking. In 25 Years of Model Checking. Springer, 1--26.
[4]
E.M. Clarke and LA. Draghicescu. 1988. Expressibility results for linear-time and branching-time logics. In Proc. Workshop on Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency (LNCS), Vol. 354. 428--437.
[5]
E.M. Clarke and E.A. Emerson. 1981. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logic of Programs (LNCS), Vol. 131. Springer, 52--71.
[6]
V. Diekert and P. Gastin. 2008. First-order definable languages. Logic and automata 2 (2008), 261--306.
[7]
Rüdiger Ehlers. 2012. ACTL ∩ LTL Synthesis. In Proc. of CAV. 39--54.
[8]
C. Eisner. 2007. PSL for runtime verification: Theory and practice. LNCS 4839 (2007), 1--8.
[9]
E.A. Emerson and J.Y. Halpern. 1986. Sometimes and Not Never Revisited: On Branching Versus Linear Time. J. ACM 33, 1 (1986), 151--178.
[10]
O. Grumberg and R.P. Kurshan. 1994. How linear can branching-time be. In Proc. 1st Int. Conf. on Temporal Logic, Vol. 827. Springer, 180--194.
[11]
D. Kirsten. 2002. Alternating Tree Automata and Parity Games. 153--167.
[12]
S.C. Krishnan, A. Puri, and R.K. Brayton. 1994. Deterministic ω-automata vis-a-vis deterministic Büchi automata. In Algorithms and Computations (LNCS), Vol. 834. Springer, 378--386.
[13]
O. Kupferman, S. Safra, and M.Y. Vardi. 1996. Relating word and tree automata. In Proc. 11th IEEE Symp. on Logic in Computer Science. 322--333.
[14]
O. Kupferman, S. Safra, and M.Y. Vardi. 2006. Relating word and tree automata. Ann. Pure Appl. Logic 138, 1-3 (2006), 126--146.
[15]
O. Kupferman and M.Y. Vardi. 2005. From linear time to branching time. ACM Transactions on Computational Logic 6, 2 (2005), 273--294.
[16]
O. Kupferman, M.Y. Vardi, and P. Wolper. 2000. An Automata-Theoretic Approach to Branching-Time Model Checking. J. ACM 47, 2 (2000), 312--360.
[17]
L. Lamport. 1980. "Sometimes" is sometimes "Not never" - on the temporal logic of programs. In Proc. of PoPL. 174--185.
[18]
C. Löding and W. Thomas. 2000. Alternating automata and logics over infinite words. In Theoretical Computer Science (LNCS), Vol. 1872. Springer, 521--535.
[19]
M. Maidl. 2000. The common fragment of CTL and LTL. In Proc. FoCS. 643--652.
[20]
K.L. McMillan. 1993. Symbolic Model Checking. Kluwer Academic Publishers.
[21]
R. McNaughton. 1966. Testing and Generating Infinite Sequences by a Finite Automaton. Information and Control 9 (1966), 521--530.
[22]
R. McNaughton and S. Papert. 1971. Counter-Free Automata. MIT Pres.
[23]
D.E. Muller, A. Saoudi, and P.E. Schupp. 1992. Alternating automata, the weak monadic theory of trees and its complexity. Theoretical Computer Science 97, 2 (1992), 233--244.
[24]
D.E. Muller and P.E. Schupp. 1987. Alternating automata on infinite trees. Theoretical Computer Science 54 (1987), 267--276.
[25]
D.E. Muller and P.E. Schupp. 1995. Simulating Alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science 141 (1995), 69--107.
[26]
A. Pnueli. 1977. The temporal logic of programs. In Proc. FoCS. 46--57.
[27]
S. Safra. 1988. On the Complexity of ω-Automata. In Proc. FoCS. 319--327.
[28]
M.Y. Vardi. 1995. Alternating automata and program verification. In Computer Science Today --Recent Trends and Developments (LNCS), Vol. 1000. 471--485.
[29]
M.Y. Vardi. 1997. Alternating automata -- unifying truth and validity checking for temporal logics. In Proc. of the 14th Int. Conf. on Automated Deduction (Lecture Notes in Artificial Intelligence), W. McCune (Ed.), Vol. 1249. Springer, 191--206.
[30]
M.Y. Vardi. 1998. Sometimes and Not Never Re-revisited: On Branching Versus Linear Time. In International Conference on Concurrency Theory. Springer, 1--17.
[31]
M.Y. Vardi and T. Wilke. 2008. Automata: from logics to algorithms. Logic and automata 2 (2008), 629--736.
[32]
M.Y. Vardi and P. Wolper. 1986. An Automata-Theoretic Approach to Automatic Program Verification. In Proc. on Logic in Computer Science. 332--344.
[33]
T. Wilke. 1999. CTL+ is exponentially more succinct than CTL. In Proc. of FoSSaCS (LNCS), Vol. 1738. Springer, 110--121.
[34]
T. Wilke. 2001. Alternating Tree Automata, Parity Games, and Modal μ-Calculus. Bulletin of the Belgian Mathematical Society Simon Stevin 8, 2 (2001), 359.

Cited By

View all
  • (2023)Enriching the Semantics of Information Flow Tracking with Source-Level Memory Allocation Event Logging2023 IEEE Conference on Dependable and Secure Computing (DSC)10.1109/DSC61021.2023.10354156(1-10)Online publication date: 7-Nov-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
LICS '18: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
July 2018
960 pages
ISBN:9781450355834
DOI:10.1145/3209108
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 July 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. CTL
  2. LTL
  3. automaton characterization

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

LICS '18
Sponsor:

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)15
  • Downloads (Last 6 weeks)5
Reflects downloads up to 26 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Enriching the Semantics of Information Flow Tracking with Source-Level Memory Allocation Event Logging2023 IEEE Conference on Dependable and Secure Computing (DSC)10.1109/DSC61021.2023.10354156(1-10)Online publication date: 7-Nov-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media