JOURNAL ARTICLE
Minimal Coverability Set for Petri Nets
ReynierPierre-AlainServaisFrédéric
Year: 2013 Journal: Fundamenta Informaticae Publisher: IOS Press
Abstract
This paper presents the Monotone-Pruning algorithm MP for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm K&M unfolds the reachability graph of a Petri ...
Keywords:
Petri net Reachability Computer science Set (abstract data type) Process architecture Stochastic Petri net Theoretical computer science Monotone polygon Graph Programming language Discrete mathematics Algorithm Mathematics
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.30
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Petri Nets in System Modeling
Physical Sciences → Computer Science → Computational Theory and Mathematics
Access Control and Trust
Social Sciences → Social Sciences → Sociology and Political Science
Business Process Modeling and Analysis
Social Sciences → Business, Management and Accounting → Management Information Systems
Related Documents
BOOK-CHAPTER
The minimal coverability graph for Petri nets
Lecture notes in computer science Year: 1993 Pages: 210-243
BOOK-CHAPTER
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Parosh Aziz AbdullaRichard Mayr
Lecture notes in computer science Year: 2009 Pages: 348-363
BOOK-CHAPTER
On the Computation of the Minimal Coverability Set of Petri Nets
Pierre-Alain ReynierFrédéric Servais
Lecture notes in computer science Year: 2019 Pages: 164-177
JOURNAL ARTICLE
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
Pierre-Alain ReynierFrédéric Servais
Journal: Fundamenta Informaticae Year: 2013 Vol: 122 (1-2)Pages: 1-30