scientific article; zbMATH DE number 4119650

MaRDI QIDQ4733423zbMATH OpenFDO

Authors Wolfgang Thomas

Publication date 1989

zbMATH Keywords

branching time logicBüchi automatacomputation tree logicnon-counting property

Mathematics Subject Classification ID

Temporal logic (03B44) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4027441
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• scientific article; zbMATH DE number 1114349
• Extended computation tree logic
• scientific article; zbMATH DE number 4119616

Cited in

(17)

• 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?)
• scientific article; zbMATH DE number 1114349 (Why is no real title available?)
• scientific article; zbMATH DE number 1136085 (Why is no real title available?)
• 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)