Stubborn set intuition explained

DOI10.1007/978-3-662-55862-1_7zbMATH Open1464.68265OpenAlexW2574621618MaRDI QIDQ4994076FDOQ4994076

Authors: Antti Valmari, Henri Hansen 

Publication date: 14 June 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-55862-1_7

Recommendations

• Can stubborn sets be optimal?
• scientific article; zbMATH DE number 6017853
• Stubborn sets with frozen actions
• Stubborn Sets, Frozen Actions, and Fair Testing
• scientific article; zbMATH DE number 1278351

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (12)

• Partial order reduction for reachability games
• Can stubborn sets be optimal?
• Stubborn versus structural reductions for Petri nets
• Taking Some Burden Off an Explicit CTL Model Checker
• Title not available (Why is that?)
• Stubborn set reduction for two-player reachability games
• Partial-order reduction for parity games with an application on parameterised Boolean equation systems
• Stubborn sets with frozen actions
• Exponential automatic amortized resource analysis
• Fair testing and stubborn sets
• Title not available (Why is that?)
• The inconsistent labelling problem of stutter-preserving partial-order reduction

This page was built for publication: Stubborn set intuition explained

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994076)