Skip to Main content Skip to Navigation

Des bisimulations de places pour la réduction des réseaux de Petri

Abstract : This thesis concerns a new reduction method for Petri nets, place bisimulation. Formerly, reduction was considered as a technic to shrink the state-space without changing some behavioural properties (such as liveness, boudedness, etc) or as algorithms to state wether or not a net has such properties. We took a different approch since we granted to preserve the whole behavior and to make a structural reduction (as place merging). The first parts of this work presents solution : place bisimulation. For this method, we derive polynomial algorithms. Next, we extend our results to other net types (with inhibitor arcs) or bisimulation types (tau-bisimulations). We conclude our theoretical approch by linking our reduction method to some other theories (such as conflict-free nets). Finally, we conclude with some remarks and examples from the Petris system.
Complete list of metadata

Cited literature [59 references]  Display  Hide  Download
Contributor : Thèses Imag <>
Submitted on : Tuesday, February 24, 2004 - 3:12:53 PM
Last modification on : Friday, November 6, 2020 - 4:36:42 AM
Long-term archiving on: : Friday, April 2, 2010 - 7:28:39 PM


  • HAL Id : tel-00005059, version 1




Wilfried Quivrin-Pfister. Des bisimulations de places pour la réduction des réseaux de Petri. Réseaux et télécommunications [cs.NI]. Institut National Polytechnique de Grenoble - INPG, 1995. Français. ⟨tel-00005059⟩



Record views


Files downloads