Pages that link to "Item:Q1325848"
From MaRDI portal
The following pages link to CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848):
Displaying 36 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus (Q549180) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- Maximal traces and path-based coalgebraic temporal logics (Q639645) (← links)
- Games for the \(\mu\)-calculus (Q671352) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- Compositional checking of satisfaction (Q685107) (← links)
- Local model checking for infinite state spaces (Q1190489) (← links)
- Proving properties of dynamic process networks (Q1383156) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- Towards physical hybrid systems (Q2305415) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- The power of first-order quantification over states in branching and linear time temporal logics (Q2390310) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Decidability and Expressivity of Ockhamist Propositional Dynamic Logics (Q2835868) (← links)
- Modal expressiveness of graph properties (Q2866735) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Flat fragments of CTL and CTL: separating the expressive and distinguishing powers (Q4238500) (← links)
- Temporal Logics with Reference Pointers and Computation Tree Logics (Q4443400) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
- A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
- A CTL* Model Checker for Petri Nets (Q5100762) (← links)
- A Logical Approach to Hamiltonian Graphs (Q5178965) (← links)
- Branching-Time Model-Checking of Probabilistic Pushdown Automata (Q5179051) (← links)
- A Multi-Core Solver for Parity Games (Q5415659) (← links)
- Coalgebraic CTL: fixpoint characterization and polynomial-time model checking (Q6666771) (← links)
