scientific article; zbMATH DE number 1059329
From MaRDI portal
Publication:4353636
Recommendations
Cited in
(24)- More stubborn set methods for process algebras
- On stubborn sets in the verification of linear time temporal properties
- Exponential automatic amortized resource analysis
- The inconsistent labelling problem of stutter-preserving partial-order reduction
- On constructibility and unconstructibility of LTS operators from other LTS operators
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
- On the origin of events: branching cells as stubborn sets
- Partial-Order Reduction
- Can stubborn sets be optimal?
- scientific article; zbMATH DE number 177237 (Why is no real title available?)
- scientific article; zbMATH DE number 177511 (Why is no real title available?)
- scientific article; zbMATH DE number 2064471 (Why is no real title available?)
- Stubborn Sets, Frozen Actions, and Fair Testing
- Model checking linear-time properties of probabilistic systems
- A detailed account of the inconsistent labelling problem of stutter-preserving partial-order reduction
- Partial-order reduction for parity games with an application on parameterised Boolean equation systems
- Stubborn set reduction for two-player reachability games
- Equivalence checking 40 years after: a review of bisimulation tools
- Taking Some Burden Off an Explicit CTL Model Checker
- A stubborn attack on state explosion
- Optimising the ProB model checker for B using partial order reduction
- Stubborn set reduction for timed reachability and safety games
- Optimistic synchronization-based state-space reduction
- Question-guided stubborn set methods for state properties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353636)