Coverability Analysis
Coverability Analysis is a formal method in Petri net theory that determines whether a given marking can be reached or exceeded in the state space of a net, thereby enabling the verification of safety and liveness properties through the construction of a coverability tree.
34
Publications
909
Citations
85
Authors
50
Institutions
Publications per year
2017–2026
7
Parents
34
Diagnosability analysis of unbounded Petri nets
Maria Paola Cabasino, Alessandro Giua, Stéphane Lafortune et al. · 2009 · 46 citations
1–5 of 34
85
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 85
50

Uppsala University
Uppsala, Sweden
3 h-index
4 publications
67 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
99 citations
Université Libre de Bruxelles
Brussels, Belgium
3 h-index
7 publications
341 citations

University of Genoa
Genoa, Italy
3 h-index
3 publications
66 citations
University of Michigan
Ann Arbor, United States
2 h-index
2 publications
200 citations
Universidad Complutense de Madrid
Madrid, Spain
2 h-index
4 publications
82 citations

University of Warsaw
Warsaw, Poland
2 h-index
3 publications
34 citations

University of Cagliari
Cagliari, Italy
2 h-index
6 publications
600 citations
1–8 of 50
2 publications · 21 citations
2
h-index
ENTCS · 2 publications · 50 citations
2
h-index
2 publications · 172 citations
2
h-index
Repository · 2 publications · 33 citations
2
h-index
Conference · 1 publications · 12 citations
1
h-index
1–5