A reduced maximality labeled transition system generation for recursive Petri nets

Autor:	Jean-Michel Ilié, Messaouda Bouneb, Djamel Eddine Saidouni
Rok vydání:	2015
Předmět:	Discrete mathematics Bisimulation Relation (database) Concurrency Modulo Theory of computation Structure (category theory) Petri net Software Operational semantics Theoretical Computer Science Mathematics
Zdroj:	Formal Aspects of Computing. 27:951-973
ISSN:	1433-299X 0934-5043
DOI:	10.1007/s00165-015-0341-3
Popis:	In Saidouni et al. (Maximality semantic for recursive Petri net. Europeen conference on modelling and simulation (ECMS’13) pp 544–550, 2013 ) a maximality operational semantics has been defined for the recursive Petri net model. This operational semantics generates a true concurrency structure named maximality-based labeled transition systems (MLTS). This paper proposes an approach that generates an on-the-fly reduced MLTS modulo a maximality bisimulation relation. The interest of the approach is shown using an example concerning the woodshop cutting system.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c4ec12c180dd2e01007e91378fc81f28 https://doi.org/10.1007/s00165-015-0341-3 Zobrazit plný text záznamu Full text from SpringerLink