{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T19:36:49Z","timestamp":1665085009407},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"5-6","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2015,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            In Saidouni et\u00a0al. (Maximality semantic for recursive Petri net. Europeen conference on modelling and simulation (ECMS\u201913) pp 544\u2013550,\n            <jats:xref ref-type=\"bibr\">2013<\/jats:xref>\n            ) 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.\n          <\/jats:p>","DOI":"10.1007\/s00165-015-0341-3","type":"journal-article","created":{"date-parts":[[2015,8,5]],"date-time":"2015-08-05T06:08:36Z","timestamp":1438754916000},"page":"951-973","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A reduced maximality labeled transition system generation for recursive Petri nets"],"prefix":"10.1145","volume":"27","author":[{"given":"Messaouda","family":"Bouneb","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Sciences, El Arbi ben Mhidi University, Oum el bouaghi, Algeria"},{"name":"MISC Laboratory, Department of Fundamental Informatics and its Applications, University Constantine 2, Abdelhamid Mehri, Constantine, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamel Eddine","family":"Saidouni","sequence":"additional","affiliation":[{"name":"MISC Laboratory, Department of Fundamental Informatics and its Applications, University Constantine 2, Abdelhamid Mehri, Constantine, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean Michel","family":"Ilie","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences, Pierre and Marie Curie University, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Aceto L Hennessy M (1991) Adding action refinement to finite process algebra. In: Albert JL Monien B Artalejo MR (eds) ICALP91 LNCS vol 510. Springer pp 506\u2013519","DOI":"10.1007\/3-540-54233-7_159"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Andrews D Groote J Middelburg C (eds) (1993) Workshop on Semantics of Specification Languages (SoSL93) Workshops in Computing Springer-Verlag Utrecht pp 289-303","DOI":"10.1007\/978-1-4471-3229-5"},{"key":"e_1_2_1_2_3_2","unstructured":"Arnold A (1992) Systme de transition finis et smantique des processus communicants. Masson Paris"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Benamira A Saidouni DE (2013) Maximality-based labeled transition systems normal form modeling approaches and algorithms for advanced computer applications studies in computational intelligence. 488:337\u2013346","DOI":"10.1007\/978-3-319-00560-7_37"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178506"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90096-5"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211314"},{"key":"e_1_2_1_2_9_2","unstructured":"Courtiat JP Sadouni DE (1994) Action refinement in LOTOS. In: Danthine A Leduc G Wolpe P (eds) Protocol Specification Testing and Verification (PSTV93) North-Holland pp 341\u2013354"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"crossref","unstructured":"Courtiat JP Sadouni DE (1995) Relating maximality-based semantics to action refinement in process algebras","DOI":"10.1007\/978-0-387-34878-0_24"},{"key":"e_1_2_1_2_11_2","unstructured":"Dahmani D (2009) Extensions of recursive Petri nets for temporal analysis of systems with dynamic structure. Doctoral thesis. University of Science and Technology Houari Boumediene algeria"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"crossref","unstructured":"Darondeau P Degano P (1989) Causal trees. In: ICALP\u201989 LNCS vol 372. Springer pp 234-248","DOI":"10.1007\/BFb0035764"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/107744.107747"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90361-V"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"crossref","unstructured":"Degano P Gorrieri R (1991) Atomic refinement in process description languages. In: Tarlecki A (ed) Mathematical Foundations of Computer Science LNCS vol 520. Springer pp 121\u2013130","DOI":"10.1007\/3-540-54345-7_55"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"crossref","unstructured":"Devillers R (1992) Maximality preservation and the ST-idea for action refinement. In: Rozenberg G (ed) Advances in Petri Nets LNCS vol 609. Springer pp 108\u2013151","DOI":"10.1007\/3-540-55610-9_170"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90298-T"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"crossref","unstructured":"Devillers R (1993) Construction of S-invariants and S-components for refined Petri boxes. In: Marsan MA (ed) ATPN93 LNCS vol 691. Springer pp 242\u2013261","DOI":"10.1007\/3-540-56863-8_50"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289519"},{"key":"e_1_2_1_2_20_2","unstructured":"Hogrefe D Leue S (eds) (1994) IFIP TC6\/WG6.1 7th Int. Conf. on Formal Description Techniques (FORTE94) Chapman Hall pp 293\u2013308"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"crossref","unstructured":"Janssen W Poel M Zwiers J (1991) Action systems and action refinement in the development of parallel systems CONCUR91 LNCS vol 527. Springer pp 298\u2013316","DOI":"10.1007\/3-540-54430-5_96"},{"key":"e_1_2_1_2_22_2","unstructured":"Saidouni DE (1996) Maximality semantic: Application to actions refinement in LOTOS Ph.D. thesis. LAAS-CNRS 7 av. du Colonel Roche 31077 Toulouse Cedex France"},{"key":"e_1_2_1_2_23_2","unstructured":"Saidouni DE Belala N Bouneb M (2008) Using maximality- based labeled transitions as model for Petri nets. The International Arab Conference on Information Technology(ACIT)"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"crossref","unstructured":"Saidouni DE Belala N Bouneb M (2008) Aggregation of transitions in marking graph generation based on maximality semantics for Petri nets. Verification and Evalution of Computer and Communication systems (VECOS)","DOI":"10.14236\/ewic\/VECOS2008.1"},{"key":"e_1_2_1_2_25_2","unstructured":"Saidouni DE Belala N Bouneb M (2009) Using maximality- based labeled transitions as model for Petri nets. Int Arab J Inf Technol (IAJIT)"},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"crossref","unstructured":"Saidouni DE Belala N Bouneb M (2009) Maximality-Based Structural Operational Semantics for Petri Nets. In: 2nd Mediterranean Conference on Intelligent Systems and Automation (CISA)","DOI":"10.1063\/1.3106484"},{"key":"e_1_2_1_2_27_2","unstructured":"Saidouni DE Courtiat JP (2003) Prise en compte de dur\u00e9es d\u2019actions dans les alg\u00e9bres de processus par l\u2019utilisation de la s\u00e9mantique de maximalit\u00e9. In ing\u00e9nierie des protocoles (CFIP\u201903). Hermes France"},{"key":"e_1_2_1_2_28_2","doi-asserted-by":"crossref","unstructured":"Saidouni DE Courtiat JP (1994) Syntactic action refinement in presence of multiway synchronization. Semant Specif Lang 289\u2013303","DOI":"10.1007\/978-1-4471-3229-5_16"},{"key":"e_1_2_1_2_29_2","unstructured":"Saidouni DE Bouneb M Ilie JM (2013) Maximality semantic for recursive Petri net. Europeen conference on modelling and simulation(ECMS\u201913). pp 544\u2013550. ISBN 978-0-9564944-7-4"},{"key":"e_1_2_1_2_30_2","unstructured":"Serge H Denis P (1999) Recursive Petri nets: theory and application to discrete event systems. Acta Inf"},{"key":"e_1_2_1_2_31_2","doi-asserted-by":"crossref","unstructured":"Serge H Denis P (1999) Theoretical Aspects of Recursive Petri Nets. Application and Theory of Petri Nets. Lecture Notes in Computer Science volume 1639. Springer pp 228\u2013247","DOI":"10.1007\/3-540-48745-X_14"},{"key":"e_1_2_1_2_32_2","unstructured":"Van Glabbeek RJ (1990) The refinement theorem for ST-bisimulation semantics. In: IFIP Working Conference on Programming Concepts and Methods North-Holland"},{"key":"e_1_2_1_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90157-O"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-015-0341-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-015-0341-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-015-0341-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T16:10:03Z","timestamp":1641485403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-015-0341-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":33,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["10.1007\/s00165-015-0341-3"],"URL":"https:\/\/doi.org\/10.1007\/s00165-015-0341-3","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}