Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Loïg Jezequel <>
Submitted on : Friday, April 13, 2018 - 4:44:28 PM
Last modification on : Saturday, May 1, 2021 - 3:46:23 AM


Files produced by the author(s)


  • HAL Id : hal-01766530, version 1


Loïg Jezequel, Thomas Chatain, Maurice Comlan, David Delfieu, Olivier H. 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⟩



Record views


Files downloads