Pages that link to "Item:Q1177939"

The following pages link to Local model checking in the modal mu-calculus (Q1177939):

Displaying 46 items.

• Multi-valued model checking games (Q414899) (← links)
• Towards the hierarchical verification of reactive systems (Q596025) (← links)
• Games for the \(\mu\)-calculus (Q671352) (← links)
• Trapping mutual exclusion in the box calculus (Q672869) (← links)
• Modular abstractions for verifying real-time distributed systems (Q685095) (← links)
• The expressive power of implicit specifications (Q685409) (← links)
• Abstract reduction in directed model checking CCS processes (Q715051) (← links)
• Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
• Reduced models for efficient CCS verification (Q816205) (← links)
• \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
• Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• Model checking for hybrid logic (Q1047796) (← links)
• Local model checking for infinite state spaces (Q1190489) (← links)
• Symbolic model checking: \(10^{20}\) states and beyond (Q1193587) (← links)
• A compositional \(\mu\)-calculus proof system for statecharts processes (Q1285661) (← links)
• CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
• Proving properties of dynamic process networks (Q1383156) (← links)
• Axiomatising extended computation tree logic (Q1389439) (← links)
• Petri nets, traces, and local model checking (Q1391100) (← links)
• A graphical \(\mu\)-calculus and local model checking. (Q1433941) (← links)
• A local approach for temporal model checking of Java bytecode (Q1776379) (← links)
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336) (← links)
• Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
• On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions (Q1854404) (← links)
• Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
• Discrete tense logic with infinitary inference rules and systematic frame constants: A Hilbert-style axiomatization (Q1914372) (← links)
• Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
• Bounded model checking of infinite state systems (Q2369883) (← links)
• On complexity of verification of interacting agents' behavior (Q2498917) (← links)
• Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
• Using heuristic search for finding deadlocks in concurrent systems (Q2573636) (← links)
• Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
• Two Ways to Common Knowledge (Q3185764) (← links)
• On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
• Tableaux and algorithms for Propositional Dynamic Logic with Converse (Q4647551) (← links)
• A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
• Polynomial-Time Under-Approximation of Winning Regions in Parity Games (Q4982057) (← links)
• Petri nets, traces, and local model checking (Q5096394) (← links)
• The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
• Formal Verification of Concurrent Systems via Directed Model Checking (Q5178996) (← links)
• (Q5875397) (← links)
• Axiomatising extended computation tree logic (Q5878903) (← links)
• On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
• Free \(\mu\)-lattices (Q5960406) (← links)
• Modal and temporal logics for processes (Q6560391) (← links)