The following pages link to (Q3341881):
Displaying 23 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Arity hierarchy for temporal logics (Q944387) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- Computation paths logic: An expressive, yet elementary, process logic (Q1295436) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints (Q2411048) (← links)
- Expressiveness of propositional projection temporal logic with star (Q2430015) (← links)
- Decidability and Expressivity of Ockhamist Propositional Dynamic Logics (Q2835868) (← links)
- Functional Specification of Hardware via Temporal Logic (Q3176382) (← links)
- Satisfiability of ECTL* with Tree Constraints (Q3194710) (← links)
- Trace Semantics for IPDL (Q3457701) (← links)
- Process in Reality: A logical offering (Q3592814) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- On the Model Checking Problem for Some Extension of CTL* (Q5060078) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)
- Automated temporal reasoning about reactive systems (Q6560389) (← links)
