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.
Content
Author and article information
Contributors
Djamel Eddine Saïdouni
Nabil Belala
Messaouda Bouneb
Conference
Publication date:
July
2008
Publication date
(Print):
July
2008
Pages: 1-11
Affiliations
[0001]Computer Science Dept., University of Mentouri, 25000 Constantine, Algeria