{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:55Z","timestamp":1725569995870},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_29","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T10:54:39Z","timestamp":1290164079000},"page":"424-438","source":"Crossref","is-referenced-by-count":1,"title":["Concurrency Can\u2019t Be Observed, Asynchronously"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Bonchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacoma Valentina","family":"Monreale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61604-7_53","volume-title":"CONCUR \u201996: Concurrency Theory","author":"R.M. Amadio","year":"1996","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 147\u2013162. Springer, Heidelberg (1996)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-04081-8_8","volume-title":"CONCUR 2009","author":"P. Baldan","year":"2009","unstructured":"Baldan, P., Bonchi, F., Gadducci, F.: Encoding asynchronous interactions using open Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 99\u2013114. Springer, Heidelberg (2009)"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129504004311","volume":"15","author":"P. Baldan","year":"2005","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Math. Str. in Comp. Sci\u00a015(1), 1\u201335 (2005)","journal-title":"Math. Str. in Comp. Sci"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-68679-8_29","volume-title":"Concurrency, Graphs and Models","author":"R. Beauxis","year":"2008","unstructured":"Beauxis, R., Palamidessi, C., Valencia, F.D.: On the asynchronous nature of the asynchronous \u03c0-calculus. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol.\u00a05065, pp. 473\u2013492. Springer, Heidelberg (2008)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-15670-4_4","volume-title":"Seminar on Concurrency","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W., Tucker, J.V.: Process algebra with asynchronous communication mechanisms. In: Brookes, S., Roscoe, A.W., Winskel, G. (eds.) Seminar on Concurrency. LNCS, vol.\u00a0197, pp. 76\u201395. Springer, Heidelberg (1985)"},{"key":"29_CR6","first-page":"137","volume-title":"LICS 1992","author":"F.S. Boer de","year":"1992","unstructured":"de Boer, F.S., Klop, J.W., Palamidessi, C.: Asynchronous communication in process algebra. In: LICS 1992, pp. 137\u2013147. IEEE Computer Society, Los Alamitos (1992)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: On barbs and labels in reactive systems. In: Klin, B., Soboci\u0144ski, P. (eds.) SOS 2009. EPTCS, vol.\u00a018, pp. 46\u201361 (2010)","DOI":"10.4204\/EPTCS.18.4"},{"issue":"1-2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(97)00125-4","volume":"198","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: Some congruence properties for \u03c0-calculus bisimilarities. Theor. Comp. Sci.\u00a0198(1-2), 159\u2013176 (1998)","journal-title":"Theor. Comp. Sci."},{"key":"29_CR9","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus. Tech. Rep. 1702, INRIA (1992)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-54345-7_52","volume-title":"Mathematical Foundations of Computer Science 1991","author":"G. Boudol","year":"1991","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.\u00a0520, pp. 93\u2013102. Springer, Heidelberg (1991)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Event structure semantics for dynamic graph grammars. ECEASST\u00a02 (2006)","DOI":"10.1007\/11817949_20"},{"key":"29_CR12","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 \u03c0-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 145\u2013159. Springer, Heidelberg (1995)"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0304-3975(99)00227-3","volume":"240","author":"N. Busi","year":"2000","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: Comparing three semantics for linda-like languages. Theor. Comp. Sci.\u00a0240(1), 49\u201390 (2000)","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comp. Sci.\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theor. Comp. Sci."},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-74407-8_22","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"S. Crafa","year":"2007","unstructured":"Crafa, S., Varacca, D., Yoshida, N.: Compositional event structure semantics for the internal \u03c0-calculus. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 317\u2013332. Springer, Heidelberg (2007)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BFb0035764","volume-title":"Automata, Languages and Programming","author":"P. Darondeau","year":"1989","unstructured":"Darondeau, P., Degano, P.: Causal trees. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 234\u2013248. Springer, Heidelberg (1989)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Degano, P., Nicola, R.D., Montanari, U.: Partial orderings descriptions and observations of nondeterministic concurrent processes. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop. LNCS, vol.\u00a0354, pp. 438\u2013466. Springer, Heidelberg (1989)","DOI":"10.1007\/BFb0013030"},{"key":"29_CR18","first-page":"372","volume-title":"POPL 1996","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G.: The reflexive CHAM and the Join-calculus. In: POPL 1996, pp. 372\u2013385. ACM Press, New York (1996)"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. J. Log. Algebr. Program.\u00a063(1), 131\u2013173 (2005)","journal-title":"J. Log. Algebr. Program."},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R.J. Glabbeek van","year":"1989","unstructured":"van Glabbeek, R.J., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 237\u2013248. Springer, Heidelberg (1989)"},{"key":"29_CR22","series-title":"ENTCS","first-page":"77","volume-title":"ICE 2008","author":"R.J. Glabbeek van","year":"2009","unstructured":"van Glabbeek, R.J., Goltz, U., Schicke, J.W.: Symmetric and asymmetric asynchronous interaction. In: Bonchi, F., Grohmann, D., Spoletini, P., Troina, A., Tuosto, E. (eds.) ICE 2008. ENTCS, vol.\u00a0229(3), pp. 77\u201395. Elsevier, Amsterdam (2009)"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-17945-3_13","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"R.J. Glabbeek van","year":"1987","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 224\u2013242. Springer, Heidelberg (1987)"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-85361-9_38","volume-title":"CONCUR 2008 - Concurrency Theory","author":"D. Gorla","year":"2008","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 492\u2013507. Springer, Heidelberg (2008)"},{"key":"29_CR25","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)"},{"issue":"2","key":"29_CR26","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theor. Comp. Sci.\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theor. Comp. Sci."},{"key":"29_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":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-69507-3_33","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"I. Lanese","year":"2007","unstructured":"Lanese, I.: Concurrent and located synchronizations in \u03c0-calculus. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 388\u2013399. Springer, Heidelberg (2007)"},{"key":"29_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J.J. Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/3-540-45061-0_47","volume-title":"Automata, Languages and Programming","author":"M. Merro","year":"2003","unstructured":"Merro, M., Nardelli, F.Z.: Bisimulation proof methods for mobile ambients. In: Baeten, J.C.M., et al. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 584\u2013598. Springer, Heidelberg (2003)"},{"key":"29_CR31","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"29_CR32","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus.","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"29_CR33","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)"},{"key":"29_CR34","series-title":"ENTCS","doi-asserted-by":"crossref","DOI":"10.1515\/9783112421567","volume-title":"MFPS 1995","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Concurrent semantics for the \u03c0-calculus. In: Brookes, S., Main, M., Melton, A., Misolve, M. (eds.) MFPS 1995. ENTCS, vol.\u00a01, Springer, Heidelberg (1995)"},{"issue":"5","key":"29_CR35","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous \u03c0-calculi. Math. Str. in Comp. Sci.\u00a013(5), 685\u2013719 (2003)","journal-title":"Math. Str. in Comp. Sci."},{"key":"29_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-71389-0_22","volume-title":"Foundations of Software Science and Computational Structures","author":"J. Rathke","year":"2007","unstructured":"Rathke, J., Sassone, V., Soboci\u0144ski, P.: Semantic barbs and biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 302\u2013316. Springer, Heidelberg (2007)"},{"key":"29_CR37","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(2), pp. 107\u2013120. Elsevier, Amsterdam (2005)"},{"key":"29_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-63141-0_26","volume-title":"CONCUR\u201997: Concurrency Theory","author":"P. Selinger","year":"1997","unstructured":"Selinger, P.: First-order axioms for asynchrony. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 376\u2013390. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T20:01:05Z","timestamp":1636833665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}