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.
Domaines
Théorie et langage formel [cs.FL]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...