Pages that link to "Item:Q1801498"

The following pages link to A linear-time model-checking algorithm for the alternation-free modal mu- calculus (Q1801498):

Displaying 45 items.

• Improved model checking of hierarchical systems (Q418123) (← links)
• Symbolic bounded synthesis (Q453535) (← links)
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
• Maximally permissive controlled system synthesis for non-determinism and modal logic (Q513185) (← 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)
• On decidability of recursive weighted logics (Q1797779) (← links)
• Module checking (Q1854407) (← links)
• Local model checking and protocol analysis (Q1856171) (← links)
• Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
• Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus (Q1870865) (← links)
• Complete proof systems for weighted modal logic (Q2253184) (← links)
• Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← 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 autoamta (Q2729632) (← links)
• Parallel model checking for the alternation free \(\mu\)-calculus (Q2771064) (← links)
• Alternating context-free languages and linear time \(\mu \)-calculus with sequential composition (Q2842604) (← links)
• Using assumptions to distribute alternation free {\(\mu\)}-calculus model checking (Q2845490) (← links)
• Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• Computation Tree Regular Logic for Genetic Regulatory Networks (Q3540063) (← links)
• Practical Efficient Modular Linear-Time Model-Checking (Q3540089) (← 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)
• (Q4472245) (← links)
• Local model checking for context-free processes (Q4630295) (← links)
• Efficient local correctness checking for single and alternating boolean equation systems (Q4632435) (← links)
• An even faster solver for general systems of equations (Q5030194) (← links)
• Data flow analysis as model checking (Q5096226) (← links)
• Generating diagnostic information for behavioral preorders (Q5137006) (← links)
• Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
• STACS 2004 (Q5309728) (← links)
• On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
• Alternation-free weighted mu-calculus: decidability and completeness (Q5971405) (← links)
• Automated temporal reasoning about reactive systems (Q6560389) (← links)
• Operations on fixpoint equation systems (Q6597955) (← links)