A Tool for the Coverability Problems in Petri Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

A Tool for the Coverability Problems in Petri Nets

Igor Khmeniltsky
  • Fonction : Auteur
  • PersonId : 1062418

Résumé

Goals of CovMin. Petri nets are an infinite-state model for specification and verification of concurrent systems. An important generic problem of this model is coverability, which asks the following question: Given a Petri net N and two markings m 0 , m t ∈ N p , does there exist a firing sequence σ such that m 0 σ − → m ≥ m t. Another related problem, is the coverability set problem which asks: Given a Petri net N and an initial marking m 0 , produce a finite set Clover(N , m 0) of markings such that a marking m is coverable iff there exists an ω-marking m ∈ Clover(N , m 0) such that m ≥ m. The computational complexity of these problems is very high: The coverabilty problem is EXPSPACE-complete while the size of the coverabilty set may be non primitive recursive. The tool CovMin was designed to efficiently solve these problems.
MSR19_paper_27 (1).pdf (297.73 Ko) Télécharger le fichier

Dates et versions

hal-02432710 , version 1 (15-01-2020)

Identifiants

  • HAL Id : hal-02432710 , version 1

Citer

Alain Finkel, Serge Haddad, Igor Khmeniltsky. A Tool for the Coverability Problems in Petri Nets. MSR 2019 - 12ème Colloque sur la Modélisation des Systèmes Réactifs, Nov 2019, Angers, France, Nov 2019, Angers, France. ⟨hal-02432710⟩
36 Consultations
104 Téléchargements

Partager

Gmail Facebook X LinkedIn More