scientific article
From MaRDI portal
Publication:4037382
zbMath0765.68122MaRDI QIDQ4037382
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Second-Order Finite Automata ⋮ Symmetry and partial order reduction techniques in model checking Rebeca ⋮ Lazy slicing for state-space exploration ⋮ Automata-driven partial order reduction and guided search for LTL model checking ⋮ Second-order finite automata ⋮ Unnamed Item ⋮ Petri nets, traces, and local model checking ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ An algorithmic approach for checking closure properties of Ω-regular languages ⋮ Deadlock-freedom in component systems with architectural constraints ⋮ Abstract interpretation of microcontroller code: intervals meet congruences ⋮ Reduced state space representation for unbounded vector state spaces ⋮ Complexity results for 1-safe nets ⋮ Symbolic model checking: \(10^{20}\) states and beyond ⋮ Partial order reduction for state/event LTL with application to component-interaction automata ⋮ Compositional reasoning for shared-variable concurrent programs ⋮ Partial Order Reduction for State/Event LTL ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ Using partial orders for the efficient verification of deadlock freedom and safety properties ⋮ An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages ⋮ Modular Synthesis of Timed Circuits using Partial Orders on LPNs
