Pages that link to "Item:Q685106"
From MaRDI portal
The following pages link to A stubborn attack on state explosion (Q685106):
Displaying 33 items.
- Stutter-invariant temporal properties are expressible without the next-time operator (Q290250) (← links)
- Transparent partial order reduction (Q453518) (← links)
- Stubborn set reduction for timed reachability and safety games (Q832029) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Permutation rewriting and algorithmic verification (Q865624) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- A valuation-based analysis of conflict-free Petri nets (Q1605406) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- On stubborn sets in the verification of linear time temporal properties (Q1774568) (← links)
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking (Q1884313) (← links)
- Automata-driven partial order reduction and guided search for LTL model checking (Q2152647) (← links)
- Exponential automatic amortized resource analysis (Q2200835) (← links)
- The inconsistent labelling problem of stutter-preserving partial-order reduction (Q2200842) (← links)
- On commutativity based edge lean search (Q2268917) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- An expressively complete linear time temporal logic for Mazurkiewicz traces (Q2506491) (← links)
- More efficient on-the-fly LTL verification with Tarjan's algorithm (Q2575734) (← links)
- AN EXPRESSIVE EXTENSION OF TLC (Q3021958) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata (Q3503894) (← links)
- An Incremental and Modular Technique for Checking LTL∖X Properties of Petri Nets (Q3612361) (← links)
- Exploring the Scope for Partial Order Reduction (Q3648689) (← links)
- Specification Languages for Stutter-Invariant Regular Properties (Q3648702) (← links)
- Model Checking Linear-Time Properties of Probabilistic Systems (Q5072555) (← links)
- (Q5155669) (← links)
- Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems (Q5164176) (← links)
- (Q5856425) (← links)
- Partial order reduction for reachability games (Q5875384) (← links)
- Star-Topology Decoupling in SPIN (Q5883577) (← links)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods (Q6649454) (← links)
