A reduced maximality labeled transition system generation for recursive Petri nets
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605516219 | ||
| 003 | CHVBK | ||
| 005 | 20210128100713.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151101xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00165-015-0341-3 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00165-015-0341-3 | ||
| 245 | 0 | 2 | |a A reduced maximality labeled transition system generation for recursive Petri nets |h [Elektronische Daten] |c [Messaouda Bouneb, Djamel Saidouni, Jean Ilie] |
| 520 | 3 | |a In Saidouni etal. (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. | |
| 540 | |a British Computer Society, 2015 | ||
| 690 | 7 | |a Maximality labeled transition systems |2 nationallicence | |
| 690 | 7 | |a Maximality bisimulation |2 nationallicence | |
| 690 | 7 | |a Recursive Petri nets |2 nationallicence | |
| 700 | 1 | |a Bouneb |D Messaouda |u Department of Mathematics and Computer Sciences, El Arbi ben Mhidi University, Oum el bouaghi, Algeria |4 aut | |
| 700 | 1 | |a Saidouni |D Djamel |u MISC Laboratory, Department of Fundamental Informatics and its Applications, University Constantine 2, Abdelhamid Mehri, Constantine, Algeria |4 aut | |
| 700 | 1 | |a Ilie |D Jean |u Department of Computer Sciences, Pierre and Marie Curie University, Paris, France |4 aut | |
| 773 | 0 | |t Formal Aspects of Computing |d Springer London |g 27/5-6(2015-11-01), 951-973 |x 0934-5043 |q 27:5-6<951 |1 2015 |2 27 |o 165 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00165-015-0341-3 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00165-015-0341-3 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Bouneb |D Messaouda |u Department of Mathematics and Computer Sciences, El Arbi ben Mhidi University, Oum el bouaghi, Algeria |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Saidouni |D Djamel |u MISC Laboratory, Department of Fundamental Informatics and its Applications, University Constantine 2, Abdelhamid Mehri, Constantine, Algeria |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Ilie |D Jean |u Department of Computer Sciences, Pierre and Marie Curie University, Paris, France |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Formal Aspects of Computing |d Springer London |g 27/5-6(2015-11-01), 951-973 |x 0934-5043 |q 27:5-6<951 |1 2015 |2 27 |o 165 | ||