Petri Net Reachability Graphs: Decidability Status of FO Properties - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Petri Net Reachability Graphs: Decidability Status of FO Properties

Résumé

We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order, modal and pattern-based languages without labels on transitions or atomic propositions on markings. We consider several parameters to separate decidable problems from undecidable ones. Not only are we able to provide precise borders and a systematic analysis, but we also demonstrate the robustness of our proof techniques.
Fichier principal
Vignette du fichier
DDMM-fsttcs11.pdf (512.59 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

inria-00627657 , version 1 (25-05-2021)

Identifiants

  • HAL Id : inria-00627657 , version 1

Citer

Philippe Darondeau, Stephane Demri, Roland Meyer, Christophe Morvan. Petri Net Reachability Graphs: Decidability Status of FO Properties. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, IARCS, Dec 2011, Bombay, India. ⟨inria-00627657⟩
228 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More