scientific article; zbMATH DE number 4119650
[For the entire collection see Zbl 0683.68001.] The paper discusses the treatment of the computation tree logic \(CTL^*\), and of the extended \(CTL^*(ECTL^*)\), in the framework of Büchi automata and regular \(\omega\)-languages. \(CTL^*\) is characterized by those \(ECTL^*\) formulas where all occurring Büchi automata recognize star-free \(\omega\)-languages. The decidability result on star-freeness of regular \(\omega\)-languages is transferred to the case of branching time logic: given an \(ECTL^*\)-formula, one can decide whether it can be written as a \(CTL^*\)-formula. The proof is based on a generalization of the notion of non-counting property from \(\omega\)- languages to tree languages.
- R-generability, and definability in branching time logics
- CTL^* and ECTL^* as fragments of the modal -calculus
- Axiomatising extended computation tree logic
- Mathematical modal logic: A view of its evolution
- Strategies, model checking and branching-time properties in Maude
- Compositional verification of asynchronous concurrent systems using CADP
- Unified temporal logic
- A proof system for unified temporal logic
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Logical definability of Y-tree and trellis systolic -languages
- Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
- scientific article; zbMATH DE number 4027441 (Why is no real title available?)
- Interpretation of the full computation tree logic \(\text{CTL}^*\) on sets of infinite sequences
- Axiomatizing the equational theory of regular tree languages. (Extended abstract)
- The Common Fragment of ACTL and LTL
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
- Axiomatising extended computation tree logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733423)