Constructing minimal coverability sets

DOI10.1007/978-3-642-41036-9_17MaRDI QIDQ5168524zbMATH OpenOpenAlexFDO

Authors Artturi Piipponen, Antti Valmari

Publication date 7 July 2014

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-41036-9_17

zbMATH Keywords

antichain data structurecoverability setTarjan's algorithm

Mathematics Subject Classification ID

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

Recommendations

• Constructing Minimal Coverability Sets
• Old and new algorithms for minimal coverability sets
• Old and new algorithms for minimal coverability sets
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• On the efficient computation of the minimal coverability set of Petri nets

Cited in

(4)

• Constructing Minimal Coverability Sets
• On the Efficient Computation of the Minimal Coverability Set for Petri Nets
• On the efficient computation of the minimal coverability set of Petri nets
• Defining extremes and trimming by minimum covering sets

This page was built for publication: Constructing minimal coverability sets

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