Constructing Minimal Coverability Sets

DOI10.3233/FI-2016-1319MaRDI QIDQ2968530zbMATH OpenFDO

Authors Artturi Piipponen, Antti Valmari

Publication date 16 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2016-1319

zbMATH Keywords

coverability setTarjan's algorithmantichain data structure

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
• Computing the minimal covering set
• Minimal covering set solutions
• scientific article; zbMATH DE number 5583574
• Sets defining minimal vertex covers
• Some applications of the minimal coverability structures
• Minimal covering sets for infinite set systems
• scientific article; zbMATH DE number 1463390
• Covering points with convex sets of minimum size
• Covering Points with Convex Sets of Minimum Size

Cited in

(5)

• Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning
• Commodification of accelerations for the Karp and Miller construction
• Stop-transitions of Petri nets
• Defining extremes and trimming by minimum covering sets
• Constructing minimal coverability 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 Q2968530)