The following pages link to (Q4733423):
Displayed 12 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- \(R\)-generability, and definability in branching time logics (Q1197983) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Strategies, model checking and branching-time properties in Maude (Q2239275) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Unified temporal logic (Q2661764) (← links)
- A proof system for unified temporal logic (Q2686105) (← links)
- Satisfiability of ECTL* with Tree Constraints (Q3194710) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)