Can Stubborn Sets Be Optimal?

DOI10.1007/978-3-642-13675-7_5zbMath1233.68173OpenAlexW2122762495MaRDI QIDQ3569861

Henri Hansen, Antti Valmari

Publication date: 22 June 2010

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13675-7_5

zbMATH Keywords

stubborn setspartial order verification

Mathematics Subject Classification ID

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

Related Items (2)

Delay-dependent partial order reduction technique for real time systems ⋮ Partial order reduction for checking soundness of time workflow nets

This page was built for publication: Can Stubborn Sets Be Optimal?