The inconsistent labelling problem of stutter-preserving partial-order reduction
From MaRDI portal
Recommendations
- A detailed account of the inconsistent labelling problem of stutter-preserving partial-order reduction
- Stubborn set intuition explained
- Abstractions for transition systems with applications to stubborn sets
- What's wrong with on-the-fly partial order reduction
- A pragmatic approach to stateful partial order reduction
Cites work
- scientific article; zbMATH DE number 177511 (Why is no real title available?)
- scientific article; zbMATH DE number 1059329 (Why is no real title available?)
- scientific article; zbMATH DE number 1515297 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A partial order approach to branching time logic model checking.
- A stubborn attack on state explosion
- Combining partial-order reductions with on-the-fly model-checking.
- On stubborn sets in the verification of linear time temporal properties
- Partial Order Reduction for State/Event LTL
- Partial order reduction for reachability games
- Partial order reduction for state/event LTL with application to component-interaction automata
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Stubborn set intuition explained
Cited in
(4)
This page was built for publication: The inconsistent labelling problem of stutter-preserving partial-order reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200842)