On The Decidability Of MELL: Reachability In Petri Nets With Split/Join Transitions

Paulin Jacobé de Naurois (1)

1 LIPN - Laboratoire d'Informatique de Paris-Nord

We define Petri nets with split and join transitions, a new model that extends Petri nets. We prove that reachability in this model without join transitions is equivalent to the decidability of \MELL. We define a suitable notion of covering graph for the model, and prove its finiteness and effective constructibility.

Domaines: Complexité [cs.CC]; Logique en informatique [cs.LO]

Paulin Jacobé de Naurois. On The Decidability Of MELL: Reachability In Petri Nets With Split/Join Transitions. 2010. ⟨hal-00484625v2⟩