Pages that link to "Item:Q1115196"
From MaRDI portal
The following pages link to A linear algorithm to solve fixed-point equations on transition systems (Q1115196):
Displaying 19 items.
- Sequential and distributed on-the-fly computation of weak tau-confluence (Q436408) (← links)
- Compositional checking of satisfaction (Q685107) (← links)
- The expressive power of implicit specifications (Q685409) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- An example of sequentialization of a parallel algorithm (Q1262778) (← links)
- Model checking and boolean graphs (Q1325844) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
- An improved algorithm for the evaluation of fixpoint expressions (Q1391536) (← links)
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- A planner agent that tries its best in presence of nondeterminism (Q1948282) (← links)
- Consistent Consequence for Boolean Equation Systems (Q2891375) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Solving Linear Equations in *-continuous Action Lattices (Q3498422) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- A selection property of the boolean $\mu $-calculus and some of its applications (Q4380557) (← links)
- Efficient local correctness checking for single and alternating boolean equation systems (Q4632435) (← links)
- Verification and comparison of transition systems (Q5044730) (← links)
