Pages that link to "Item:Q1801498"
From MaRDI portal
The following pages link to A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498):
Displayed 21 items.
- Improved model checking of hierarchical systems (Q418123) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Model checking for hybrid logic (Q1047796) (← links)
- Model checking and boolean graphs (Q1325844) (← links)
- Model checking for action-based logics (Q1326587) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
- Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (Q1395428) (← links)
- Module checking (Q1854407) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- Model checking hybrid logics (with an application to semistructured data) (Q2506828) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- Characteristic Formulae for Timed Automata (Q2729632) (← links)
- Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- Solving μ-Calculus Parity Games by Symbolic Planning (Q3614877) (← links)
- Logical Foundations of XML and XQuery (Q3638998) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
