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

Authors

85

  1. JR
    Jean-François Raskin

    Université Libre de Bruxelles, Belgium

    3 publications · 133 citations

    3

    h-index

  2. PA
    Parosh Aziz Abdulla

    Uppsala University, Sweden

    3 publications · 52 citations

    3

    h-index

  3. LV
    Laurent Van Begin

    Université Libre de Bruxelles, Belgium

    3 publications · 133 citations

    3

    h-index

  4. GD
    Giorgio Delzanno

    University of Genoa, Italy

    3 publications · 66 citations

    3

    h-index

  5. MP
    Maria Paola Cabasino

    University of Cagliari, Italy

    2 publications · 200 citations

    2

    h-index

1–5 of 85

Venues

  1. Theoretical Computer Science

    2 publications · 21 citations

    2

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 50 citations

    2

    h-index

  3. IEEE Transactions on Automatic Control

    2 publications · 172 citations

    2

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 33 citations

    2

    h-index

  5. Performance Metrics for Intelligent Systems

    Conference · 1 publications · 12 citations

    1

    h-index

1–5