Pages that link to "Item:Q685106"
From MaRDI portal
The following pages link to A stubborn attack on state explosion (Q685106):
Displayed 11 items.
- 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)
- 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)
- 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)
- 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)