Pomset bisimulation and unfolding for reset Petri nets - Archive ouverte HAL Access content directly
Journal Articles Information and Computation Year : 2022

Pomset bisimulation and unfolding for 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 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.
No file

Dates and versions

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

Identifiers

Cite

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⟩
56 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More