Minimal coverability tree construction made complete and efficient

DOI10.1007/978-3-030-45231-5_13OpenAlexW3016887138MaRDI QIDQ2200824

Igor Khmelnitsky, Alain Finkel, Serge Haddad

Publication date: 23 September 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-45231-5_13

zbMATH Keywords

Petri netsclovercoverabilityKarp-Miller tree algorithmminimal coverability setminimal coverability tree

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (3)

Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Commodification of accelerations for the Karp and Miller construction ⋮ Computing parameterized invariants of parameterized Petri nets

Cites Work

• Verifying OpenJDK's sort method for generic collections
• Proof pearl: The KeY to correct and stable sorting
• Unnamed Item

This page was built for publication: Minimal coverability tree construction made complete and efficient