{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:45:23Z","timestamp":1726029923877},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a well-defined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets.<\/jats:p>","DOI":"10.1007\/s00165-011-0204-5","type":"journal-article","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T07:53:44Z","timestamp":1316764424000},"page":"659-681","source":"Crossref","is-referenced-by-count":4,"title":["Statechartable Petri nets"],"prefix":"10.1145","volume":"25","author":[{"given":"Rik","family":"Eshuis","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, P.O. Box 513, 5600\u00a0MB, Eindhoven, The Netherlands"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Ameedeen MA Bordbar B (2008) A model driven approach to represent sequence diagrams as free choice Petri nets. In: Proc. EDOC 2008. IEEE Computer Society pp 213\u2013221","DOI":"10.1109\/EDOC.2008.42"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-55610-9_177","volume-title":"Advances in Petri nets 1992. Lecture notes in computer science, vol 609","author":"Bernardinello L","year":"1992"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/176584.176587"},{"key":"e_1_2_1_2_4_2","first-page":"1","volume-title":"Unifying Petri nets. Lecture notes in computer science, vol 2128","author":"Desel J","year":"2001"},{"key":"e_1_2_1_2_5_2","unstructured":"Eshuis R (2005) On nets with structured concurrency. Beta Working Paper Series WP 155 Eindhoven University of Technology"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2008.09.001"},{"key":"e_1_2_1_2_7_2","first-page":"239","volume-title":"FM 2009. Lecture notes in computer science, vol 5850","author":"Eshuis R","year":"2009"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-006-0003-0"},{"key":"e_1_2_1_2_9_2","first-page":"440","volume-title":"Proc","author":"Grahlmann B","year":"1997"},{"key":"e_1_2_1_2_10_2","first-page":"38","volume-title":"Proc. FORTE 2005. Lecture notes in computer science, vol 3731","author":"Hammal Y","year":"2005"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90035-9"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/42411.42414"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/136586.136589"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054102000935"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/45.3.260"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/235321.235322"},{"key":"e_1_2_1_2_17_2","unstructured":"Harel D Pnueli A Schmidt JP Sherman S (1987) On the formal semantics of statecharts. In: Proceedings of the second IEEE symposium on logic in computation. IEEE pp 54\u201364"},{"key":"e_1_2_1_2_18_2","unstructured":"Jensen K (1992) Coloured Petri nets. Basic concepts analysis methods and practical use. In: EATCS monographs on theoretical computer Science. Springer Berlin"},{"key":"e_1_2_1_2_19_2","first-page":"328","volume-title":"Proc ICATPN 1997. Lecture notes in computer science, vol 1248","author":"Kishinevsky M","year":"1997"},{"key":"e_1_2_1_2_20_2","first-page":"197","volume-title":"Petri Net technology for communication-based systems. Lecture notes in computer science, vol 2472","author":"Kluge O","year":"2003"},{"key":"e_1_2_1_2_21_2","unstructured":"The Mathworks. Stateflow user\u2019s guide. http:\/\/www.mathworks.com"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"e_1_2_1_2_23_2","unstructured":"Petri CA (1962) Kommunikation mit Automaten. PhD thesis Institut f\u00fcr instrumentelle Mathematik Bonn"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/3-540-54415-1_49","volume-title":"Theoretical aspects of computer software Lecture notes in computer science, vol 526","author":"Pnueli A","year":"1991"},{"key":"e_1_2_1_2_25_2","unstructured":"Reisig W (1985) Petri Nets: an introduction. In: EATCS monographs on theoretical computer science vol 4. Springer Berlin"},{"key":"e_1_2_1_2_26_2","unstructured":"Rausch M Krogh B (1997) Transformations between different model forms in discrete event systems. In: Proc IEEE SMC 1997 vol 3 pp 2841\u20132846"},{"key":"e_1_2_1_2_27_2","doi-asserted-by":"crossref","unstructured":"Reisig W Rozenberg G (eds) (1998) Lectures on Petri nets I: advances in Petri nets. In: Lecture notes in computer science vol 1492. Springer Berlin","DOI":"10.1007\/3-540-65307-4"},{"issue":"12","key":"e_1_2_1_2_28_2","first-page":"571","article-title":"Konvertierung sicherer Petri-netze in statecharts (in German)","volume":"47","author":"Schnabel M","year":"1999","journal-title":"Automatisierungstechnik"},{"key":"e_1_2_1_2_29_2","doi-asserted-by":"publisher","DOI":"10.1142\/S021819400100075X"},{"key":"e_1_2_1_2_30_2","unstructured":"UML Revision Taskforce. OMG UML specification v. 1.5. Object Management Group 2003. OMG Document Number formal\/2003-03-01"},{"key":"e_1_2_1_2_31_2","unstructured":"UML Revision Taskforce. UML 2.0 superstructure specification. Object Management Group 2003. OMG Document Number ptc\/03-07-06"},{"key":"e_1_2_1_2_32_2","first-page":"258","volume-title":"Proc MoDELS 2010 Lecture notes in computer science, vol 6395","author":"Van Gorp P","year":"2010"},{"key":"e_1_2_1_2_33_2","doi-asserted-by":"crossref","unstructured":"Whittle J Schumann J (2000) Generating statechart designs from scenarios. In: Proc ICSE pp 314\u2013323","DOI":"10.1145\/337180.337217"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-011-0204-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:56:51Z","timestamp":1641484611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-011-0204-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1007\/s00165-011-0204-5"],"URL":"https:\/\/doi.org\/10.1007\/s00165-011-0204-5","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}