Checking Linear Temporal Formulas on Sequential Recursive Petri Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

Checking Linear Temporal Formulas on Sequential Recursive Petri Nets

Serge Haddad
Denis Poitrenaud
  • Fonction : Auteur
  • PersonId : 968343

Résumé

Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. Whereas this model is a strict extension of Petri nets and context-free grammars (w.r.t. the language criterion), reachability in RPNs remains decidable. However the kind of model checking which is decidable for Petri nets becomes undecidable for RPNs. In this paper, we introduce a submodel of RPNs called sequential recursive Petri nets (SRPNs) and we study the model checking of the action-based linear time logic on SRPNs. We prove that it is decidable for all its variants: finite sequences, finite maximal sequences, infinite sequences and divergent sequences. At the end, we analyze language aspects proving that the SRPN languages still strictly include the union of Petri nets and context-free languages and that the family of languages of SRPNs is closed under intersection with regular languages (unlike the one of RPNs).

Dates et versions

hal-01571067 , version 1 (01-08-2017)

Identifiants

Citer

Serge Haddad, Denis Poitrenaud. Checking Linear Temporal Formulas on Sequential Recursive Petri Nets. 8th International Symposium on Temporal Representation and Reasonning (TIME-01), Jun 2001, Cividale del Friuli, Italy. pp.198-205, ⟨10.1109/TIME.2001.930718⟩. ⟨hal-01571067⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More