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
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01766530
Contributor : Loïg Jezequel <>
Submitted on : Friday, April 13, 2018 - 4:44:28 PM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • 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. 12th International Conference on Language and Automata Theory and Applications (LATA 2018), Apr 2018, Ramat Gan, Israel. ⟨hal-01766530⟩

Share

Metrics

Record views

413

Files downloads

107