Pomsets and Unfolding of Reset Petri Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Pomsets and Unfolding of Reset Petri Nets

Résumé

Reset Petri nets are a particular class of Petri nets where transition firings can remove all tokens from a place without checking if this place actually holds tokens or not. In this paper we look at partial order semantics of such nets. In particular, we propose a pomset bisimulation for comparing their concurrent behaviours. Building on this pomset bisimulation we then propose a generalization of the standard finite complete prefixes of unfolding to the class of safe reset Petri nets.
Fichier principal
Vignette du fichier
main.pdf (273.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01766530 , version 1 (13-04-2018)

Identifiants

  • HAL Id : hal-01766530 , version 1

Citer

Loïg Jezequel, Thomas Chatain, Maurice Comlan, David Delfieu, Olivier Henri Roux. Pomsets and Unfolding of Reset Petri Nets. LATA 2018 - 12th International Conference on Language and Automata Theory and Applications, Apr 2018, Ramat Gan, Israel. ⟨hal-01766530⟩
444 Consultations
331 Téléchargements

Partager

Gmail Facebook X LinkedIn More