scientific article; zbMATH DE number 4119650

From MaRDI portal
Publication:4733423





[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.











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)