{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:52:04Z","timestamp":1725537124066},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_8","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T12:27:08Z","timestamp":1251721628000},"page":"99-114","source":"Crossref","is-referenced-by-count":10,"title":["Encoding Asynchronous Interactions Using Open Petri Nets"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[]},{"given":"Filippo","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP \u201991 European Conference on Object-Oriented Programming","author":"K. Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.\u00a0512, pp. 133\u2013147. Springer, Heidelberg (1991)"},{"key":"8_CR2","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus. Technical Report 1702, INRIA, Sophia Antipolis (1992)"},{"issue":"5","key":"8_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/32.685256","volume":"24","author":"R. Nicola De","year":"1998","unstructured":"De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Trans. Software Eng.\u00a024(5), 315\u2013330 (1998)","journal-title":"IEEE Trans. Software Eng."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-49382-2_9","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"I. Castellani","year":"1998","unstructured":"Castellani, I., Hennessy, M.: Testing theories for asynchronous languages. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 90\u2013102. Springer, Heidelberg (1998)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/11948148_39","volume-title":"Service-Oriented Computing \u2013 ICSOC 2006","author":"G. Ferrari","year":"2006","unstructured":"Ferrari, G., Guanciale, R., Strollo, D.: Event based service coordination over dynamic and heterogeneous networks. In: Dan, A., Lamersdorf, W. (eds.) ICSOC 2006. LNCS, vol.\u00a04294, pp. 453\u2013458. Springer, Heidelberg (2006)"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R. Amadio","year":"1998","unstructured":"Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. TCS\u00a0195(2), 291\u2013324 (1998)","journal-title":"TCS"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BFb0053544","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Asynchronous observations of processes. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, pp. 95\u2013109. Springer, Heidelberg (1998)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-49019-1_12","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Boreale","year":"1999","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: A theory of \u201cmay\u201d testing for asynchronous languages. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 165\u2013179. Springer, Heidelberg (1999)"},{"key":"8_CR9","series-title":"ENTCS","volume-title":"ICE 2008","author":"J. Rathke","year":"2009","unstructured":"Rathke, J., Sobocinski, P.: Making the unobservable, unobservable. In: ICE 2008. ENTCS. Elsevier, Amsterdam (2009) (to appear)"},{"key":"8_CR10","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)"},{"issue":"5","key":"8_CR11","first-page":"1","volume":"3","author":"W. Aalst van der","year":"2005","unstructured":"van der Aalst, W.: Pi calculus versus Petri nets: Let us eat \u201chumble pie\u201d rather than further inflate the \u201cPi hype\u201d. BPTrends\u00a03(5), 1\u201311 (2005)","journal-title":"BPTrends"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-53479-2_14","volume-title":"Semantics of Systems of Concurrent Processes","author":"U. Goltz","year":"1990","unstructured":"Goltz, U.: CCS and Petri nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.\u00a0469, pp. 334\u2013357. Springer, Heidelberg (1990)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BFb0039047","volume-title":"CONCUR \u201990","author":"R. Gorrieri","year":"1990","unstructured":"Gorrieri, R., Montanari, U.: SCONE: A simple calculus of nets. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 2\u201331. Springer, Heidelberg (1990)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-60218-6_11","volume-title":"CONCUR \u201995 Concurrency Theory","author":"N. Busi","year":"1995","unstructured":"Busi, N., Gorrieri, R.: A Petri net semantics for pi-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 145\u2013159. Springer, Heidelberg (1995)"},{"issue":"4-5","key":"8_CR15","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00165-008-0079-2","volume":"20","author":"R. Devillers","year":"2008","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general pi-calculus terms. Formal Asp. Comput.\u00a020(4-5), 429\u2013450 (2008)","journal-title":"Formal Asp. Comput."},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-642-00596-1_18","volume-title":"FOSSACS 2009","author":"J. Aranda","year":"2009","unstructured":"Aranda, J., Valencia, F., Versari, C.: On the expressive power of restriction and priorities in CCS with replication. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 242\u2013256. Springer, Heidelberg (2009)"},{"key":"8_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526589","volume-title":"Nets, terms and formulas","author":"E. Olderog","year":"1991","unstructured":"Olderog, E.: Nets, terms and formulas. Cambridge University Press, Cambridge (1991)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jlap.2008.08.002","volume":"78","author":"N. Busi","year":"2009","unstructured":"Busi, N., Gorrieri, R.: Distributed semantics for the \u03c0-calculus based on Petri nets with inhibitor arcs. Journal of Logic and Algebraic Programming\u00a078, 138\u2013162 (2009)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. TCS\u00a096, 217\u2013248 (1992)","journal-title":"TCS"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129504004311","volume":"15","author":"P. Baldan","year":"2004","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Mathematical Structures in Computer Science\u00a015(1), 1\u201335 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-27755-2_19","volume-title":"Lectures on Concurrency and Petri Nets","author":"R. Milner","year":"2004","unstructured":"Milner, R.: Bigraphs for Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 686\u2013701. Springer, Heidelberg (2004)"},{"key":"8_CR23","series-title":"ENTCS","first-page":"107","volume-title":"PNGT 2004","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: A congruence for Petri nets. In: Ehrig, H., Padberg, J., Rozenberg, G. (eds.) PNGT 2004. ENTCS, vol.\u00a0127, pp. 107\u2013120. Elsevier, Amsterdam (2005)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55767-9","volume-title":"Modular Construction and Partial Order Semantics of Petri Nets","author":"W. Vogler","year":"1992","unstructured":"Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol.\u00a0625. Springer, Heidelberg (1992)"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-60218-6_13","volume-title":"CONCUR \u201995 Concurrency Theory","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 175\u2013189. Springer, Heidelberg (1995)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-48654-1_19","volume-title":"CONCUR \u201994: Concurrency Theory","author":"M. Koutny","year":"1994","unstructured":"Koutny, M., Esparza, J., Best, E.: Operational semantics for the Petri box calculus. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 210\u2013225. Springer, Heidelberg (1994)"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-63139-9_39","volume-title":"Application and Theory of Petri Nets 1997","author":"E. Kindler","year":"1997","unstructured":"Kindler, E.: A compositional partial order semantics for Petri net components. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 235\u2013252. Springer, Heidelberg (1997)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-27836-8_28","volume-title":"Automata, Languages and Programming","author":"N. Busi","year":"2004","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 307\u2013319. Springer, Heidelberg (2004)"},{"issue":"2","key":"8_CR29","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jancar","year":"1995","unstructured":"Jancar, P.: Undecidability of bisimilarity for Petri nets and some related problems. TCS\u00a0148(2), 281\u2013301 (1995)","journal-title":"TCS"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45315-6_7","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Buscemi","year":"2001","unstructured":"Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the join calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 104\u2013120. Springer, Heidelberg (2001)"},{"issue":"1","key":"8_CR31","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.jlap.2007.06.003","volume":"75","author":"N. Busi","year":"2008","unstructured":"Busi, N., Zavattaro, G.: A process algebraic view of shared dataspace coordination. J. Log. Algebr. Program.\u00a075(1), 52\u201385 (2008)","journal-title":"J. Log. Algebr. Program."},{"key":"8_CR32","series-title":"ENTCS","first-page":"71","volume-title":"EXPRESS 2005","author":"R. Devillers","year":"2006","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: A Petri net semantics of a simple process algebra for mobility. In: Baeten, J., Phillips, I. (eds.) EXPRESS 2005. ENTCS, vol.\u00a0154, pp. 71\u201394. Elsevier, Amsterdam (2006)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-540-68746-7_22","volume-title":"Applications and Theory of Petri Nets","author":"R. Meyer","year":"2008","unstructured":"Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol.\u00a05062, pp. 327\u2013347. Springer, Heidelberg (2008)"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"issue":"5","key":"8_CR35","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Mathematical Structures in Computer Science\u00a08(5), 447\u2013479 (1998)","journal-title":"Mathematical Structures in Computer Science"},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S096012950700610X","volume":"17","author":"F. Gadducci","year":"2007","unstructured":"Gadducci, F.: Graph rewriting and the \u03c0-calculus. Mathematical Structures in Computer Science\u00a017, 1\u201331 (2007)","journal-title":"Mathematical Structures in Computer Science"},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ic.2005.07.003","volume":"204","author":"R. Milner","year":"2006","unstructured":"Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation\u00a0204, 60\u2013122 (2006)","journal-title":"Information and Computation"},{"issue":"3","key":"8_CR38","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal Inform. Process. Cybernet. EIK\u00a030(3), 143\u2013160 (1994)","journal-title":"Journal Inform. Process. Cybernet. EIK"},{"issue":"2","key":"8_CR39","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/633642.803973","volume":"4","author":"T. Agerwala","year":"1973","unstructured":"Agerwala, T., Flynn, M.: Comments on capabilities, limitations and \u201ccorrectness\u201d of Petri nets. Computer Architecture News\u00a04(2), 81\u201386 (1973)","journal-title":"Computer Architecture News"},{"issue":"298","key":"8_CR40","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0304-3975(02)00867-8","volume":"3","author":"N. Busi","year":"2003","unstructured":"Busi, N., Zavattaro, G.: Expired data collection in shared dataspaces. TCS\u00a03(298), 529\u2013556 (2003)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:18:48Z","timestamp":1552130328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}