Stubborn Sets, Frozen Actions, and Fair Testing
From MaRDI portal
(Redirected from Publication:4989170)
Recommendations
- Fair testing and stubborn sets
- Stubborn sets with frozen actions
- Experimenting with stubborn sets on Petri nets
- Publication:4507831
- Stubborn sets for simple linear time properties
- Applying a testing approach to the calculus of fair ambients
- On stubborn sets in the verification of linear time temporal properties
- On Stubborn Sets in the Verification of Linear Time Temporal Properties
- Stubborn set reduction for two-player reachability games
- Publication:4507830
Cites work
- Computer aided verification. 31st international conference, CAV 2019, New York City, NY, USA, July 15--18, 2019. Proceedings. Part II
- Depth-First Search and Linear Graph Algorithms
- Fair testing
- Fair testing and stubborn sets
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 177254 (Why is no real title available?)
- scientific article; zbMATH DE number 1059329 (Why is no real title available?)
- scientific article; zbMATH DE number 1059330 (Why is no real title available?)
- Model checking
- Modular construction and partial order semantics of Petri nets
- More stubborn set methods for process algebras
- On computing the transitive closure of a relation
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Path-based depth-first search for strong and biconnected components
- Stubborn sets with frozen actions
- The inconsistent labelling problem of stutter-preserving partial-order reduction
Cited in
(4)
This page was built for publication: Stubborn Sets, Frozen Actions, and Fair Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989170)