Aggregation of Transitions in Marking Graph Generation Based on Maximality Semantics for Petri Nets
Djamel Eddine Saïdouni, Nabil Belala, Messaouda Bouneb · Electronic workshops in computing · 2008
In this paper, we propose an operational semantics to build maximality-based labeled transition systems (MLTS) from Place/Transition Petri nets while performing aggregation of equivalent derivations of transitions according to maximality bisimulation relation. We show that generated MLTS are equivalent to MLTS generated without aggregation. As illustration, we apply results on a ticket reservation system.