Pomsets and Unfolding of Reset Petri Nets

Abstract : 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.
Type de document :
Communication dans un congrès
Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira. 12th International Conference on Language and Automata Theory and Applications (LATA 2018), Apr 2018, Ramat Gan, Israel. Springer, Language and Automata Theory and Applications. 〈http://grammars.grlmc.com/LATA2018/〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01766530
Contributeur : Loïg Jezequel <>
Soumis le : vendredi 13 avril 2018 - 16:44:28
Dernière modification le : mercredi 16 mai 2018 - 11:48:04

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01766530, version 1

Citation

Loïg Jezequel, Thomas Chatain, Maurice Comlan, David Delfieu, Olivier H. Roux. Pomsets and Unfolding of Reset Petri Nets. Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira. 12th International Conference on Language and Automata Theory and Applications (LATA 2018), Apr 2018, Ramat Gan, Israel. Springer, Language and Automata Theory and Applications. 〈http://grammars.grlmc.com/LATA2018/〉. 〈hal-01766530〉

Partager

Métriques

Consultations de la notice

156

Téléchargements de fichiers

17