Minimal coverability tree construction made complete and efficient

DOI10.1007/978-3-030-45231-5_13MaRDI QIDQ2200824zbMATH OpenOpenAlexFDO

Authors Alain Finkel, Igor Khmelnitsky, Serge Haddad

Publication date 23 September 2020

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Petri netscoverabilitycloverKarp-Miller tree algorithmminimal coverability setminimal coverability tree

Mathematics Subject Classification ID

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

Recommendations

• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• On the efficient computation of the minimal coverability set of Petri nets
• Old and new algorithms for minimal coverability sets
• Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
• On the computation of the minimal coverability set of Petri nets

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• Proof pearl: The KeY to correct and stable sorting
• Verifying OpenJDK's sort method for generic collections

Cited in

(4)

• Computing parameterized invariants of parameterized Petri nets
• Construction of the developing connecting tree
• Commodification of accelerations for the Karp and Miller construction
• Computing Parameterized Invariants of Parameterized Petri Nets

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

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