Pomset bisimulation and unfolding for reset Petri nets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information and Computation Année : 2022

Pomset bisimulation and unfolding for 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 reset Petri 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 for this class of Petri nets.
Fichier non déposé

Dates et versions

hal-03650582 , version 1 (25-04-2022)

Identifiants

Citer

Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier Henri Roux. Pomset bisimulation and unfolding for reset Petri nets. Information and Computation, 2022, 283, pp.104674. ⟨10.1016/j.ic.2020.104674⟩. ⟨hal-03650582⟩
81 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More