The following pages link to (Q4037382):
Displaying 25 items.
- Partial order reduction for state/event LTL with application to component-interaction automata (Q549692) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- Symmetry and partial order reduction techniques in model checking Rebeca (Q845239) (← links)
- Symbolic model checking: \(10^{20}\) states and beyond (Q1193587) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Proving partial order properties (Q1322161) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem (Q1910794) (← links)
- Compositional reasoning for shared-variable concurrent programs (Q2024370) (← links)
- Automata-driven partial order reduction and guided search for LTL model checking (Q2152647) (← links)
- Second-order finite automata (Q2158302) (← links)
- Deadlock-freedom in component systems with architectural constraints (Q2441719) (← links)
- Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
- Lazy slicing for state-space exploration (Q2637297) (← links)
- Modular synthesis of timed circuits using partial orders on LPNs (Q2842584) (← links)
- Partial Order Reduction for State/Event LTL (Q3605476) (← links)
- Reduced state space representation for unbounded vector state spaces (Q4633164) (← links)
- Second-Order Finite Automata (Q5042226) (← links)
- (Q5856425) (← links)
- Adding partial orders to linear temporal logic (Q6044113) (← links)
- An algorithmic approach for checking closure properties of Ω-regular languages (Q6162107) (← links)
- Towards automata for branching time and partial order (Q6162108) (← links)
