Old and New Algorithms for Minimal Coverability Sets

DOI10.1007/978-3-642-31131-4_12zbMath1357.68144OpenAlexW2137797793MaRDI QIDQ2908208

Henri Hansen, Antti Valmari

Publication date: 4 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-31131-4_12

Mathematics Subject Classification ID

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

Related Items (1)

Unbounded-Thread Program Verification using Thread-State Equations

This page was built for publication: Old and New Algorithms for Minimal Coverability Sets