ETD

• net
• petri
• semantics

This thesis is devoted to the analysis and the study of semantics equivalence
for interleaving and concurrent systems over some class of Open Petri Nets.
We build a firing and step semantics for a class of Petri net in order to define their behaviours. To do that we need some properties that allow
us to assert that a concurrent step can always be rewritten in a firing sequence. Finally we show the coincidence between the two semantics using the notion of bisimulation and bisimilarity.