No label defined (Q4733423)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4119650
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4119650

      Statements

      0 references
      1989
      0 references
      computation tree logic
      0 references
      Büchi automata
      0 references
      branching time logic
      0 references
      non-counting property
      0 references
      [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.
      0 references

      Identifiers