{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:49:46Z","timestamp":1778914186102,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6784,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)00024-6","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T05:14:39Z","timestamp":1075353279000},"page":"411-429","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["Concurrent Semantics for the \u03c0-calculus"],"prefix":"10.1016","volume":"1","author":[{"given":"Ugo","family":"Montanari","sequence":"first","affiliation":[]},{"given":"Marco","family":"Pistore","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB1","doi-asserted-by":"crossref","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. In Proc. POPL, ACM, New York, 1990.","DOI":"10.1145\/96709.96717"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB2","unstructured":"M. Boreale and D. Sangiorgi. A fully abstract semantics of causality in the \u03c0-calculus. Tech. Rep. ECS-LFCS-94-297, University of Edinburgh, 1994. To appear in Proc. STACS'95."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/inco.1994.1088","article-title":"Flow models of distributed computations: three equivalent semantics for CCS","volume":"114","author":"Boudol","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB4","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani, M. Hennessy and A. Kiehn. Observing localities. Tech. Rep. 4\/91, University of Sussex, 1991. An extended abstract appeared in Proc. MFCS'91, LNCS 520 Springer Verlag. Also Theoretical Computer Science, 114:31\u201361, 1993.","DOI":"10.1016\/0304-3975(93)90152-J"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB5","series-title":"Graph Transformations in Computer Science","first-page":"104","article-title":"Abstract graph derivations in the double pushout approach","author":"Corradini","year":"1994"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB6","series-title":"Programming Concepts, Methods and Calculi, IFIP Transactions A-56","first-page":"423","article-title":"An event structure semantics for safe graph grammars","author":"Corradini","year":"1994"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB7","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(92)90087-V","article-title":"An algebraic semantics for structured transition systems and its application to logic programs","volume":"103","author":"Corradini","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0304-3975(94)90206-2","article-title":"An abstract machine for concurrent modular systems: CHARM","volume":"122","author":"Corradini","year":"1994","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB9","unstructured":"A. Corradini, U. Montanari and F. Rossi. Graph processes. Submitted for publication."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Ph. Darondeau and P. Degano. Causal trees. In Proc. ICALP'89, LNCS 372. Springer Verlag, 1989.","DOI":"10.1007\/BFb0035764"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB11","unstructured":"P. Degano, R. De Nicola and U. Montanari. Observational congruences for concurrency models. In Proc. IFIP TC2 Workshop on Formal Description of Programming Concepts IV, pages 105\u2013132. North-Holland, 1987."},{"issue":"1\/2","key":"10.1016\/S1571-0661(04)00024-6_NEWBIB12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02915446","article-title":"A distributed operational semantics for CCS based on condition\/event systems","volume":"26","author":"Degano","year":"1988","journal-title":"Acta Inf"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB13","doi-asserted-by":"crossref","unstructured":"P. Degano, J. Meseguer and U. Montanari. Axiomatizing net computations and processes. In Proc. 4th Symp. on Logics in Computer Science, IEEE 1989, pages 175\u2013185.","DOI":"10.1109\/LICS.1989.39172"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB14","unstructured":"P. Degano and C. Priami. Causality for mobile processes. To appear in Proc. ICALP'95."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB15","doi-asserted-by":"crossref","unstructured":"H. Ehrig. Tutorial introduction to the algebraic approach of graph-grammars. In Proc. 3rd International Workshop on Graph Grammars and their Application to Computer Science, LNCS 291, pages 3\u201314. Springer Verlag, 1987.","DOI":"10.1007\/3-540-18771-5_40"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB16","unstructured":"G. Ferrari, U. Montanari and P. Quaglia. The weak late \u03c0-calculus semantics as observation equivalence. To appear on Proc. CONCUR '95."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB17","first-page":"125","article-title":"The nonsequential behavior of Petri nets","volume":"57","author":"Goltz","year":"1983","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB18","doi-asserted-by":"crossref","unstructured":"R. Gorrieri and U. Montanari. A simple calculus of nets. In J. Baeten and J. Klop, Eds., Proc. CONCUR '90, LNCS 458, pages 2\u201330. Springer Verlag, 1990. Also Theoretical Computer Science, to appear.","DOI":"10.1007\/BFb0039047"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB19","doi-asserted-by":"crossref","unstructured":"C. Laneve and U. Montanari. Axiomatizing permutation equivalence in the \u03bb-calculus. In 3th Int. Conf. on Algebraic and Logic Programming, LNCS 632, pages 350\u2013363. Springer Verlag, 1992","DOI":"10.1007\/BFb0013837"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting systems","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB21","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. Tech. Rep. ECS-LFCS-91-180, University of Edinburgh, 1991. Also in F. L. Bauer, W. Brauer and H. Schwichtenberg, Eds., Logic and Algebra of Specification, NATO ASI Series F, Vol. 94. Springer Verlag, 1993"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB22","doi-asserted-by":"crossref","unstructured":"R. Milner. Pi-nets: a graphical form of \u03c0-calculus. In Proc. ESOP'94, LNCS 788, pages 26\u201342. Springer Verlag, 1994.","DOI":"10.1007\/3-540-57880-3_2"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes (parts I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB24","series-title":"CONCUR'91","first-page":"45","article-title":"Modal logic for mobile processes","author":"Milner","year":"1992"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB25","doi-asserted-by":"crossref","unstructured":"U. Montanari and F. Rossi. Graph grammars as context dependent rewriting systems: a partial ordering semantics. In Proc. CAAP'92, LNCS 582, pages 232\u2013247. Springer Verlag, 1992.","DOI":"10.1007\/3-540-55251-0_13"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB26","article-title":"Contextual Nets","author":"Montanari","year":"1994","journal-title":"Acta, Informatica"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB27","doi-asserted-by":"crossref","unstructured":"U. Montanari and D. Yankelevich. A parametric approach to localities. In Proceedings 19th ICALP, LNCS 623, pages 617\u2013628. Springer Verlag, 1992. Full paper in Theoretical Computer Science, to appear.","DOI":"10.1007\/3-540-55719-9_109"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB28","series-title":"Advances in Petri Nets 1987","first-page":"196","article-title":"Operational Petri net semantics for CCS","author":"Olderog","year":"1987"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB29","unstructured":"J. Parrow. Interaction diagrams. To appear in Proc. REX93."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB30","unstructured":"D. Sangiorgi. Expressing mobility in process algebras: first-order and higher-order paradigms. PhD thesis CST-99-93, University of Edinburgh, 1992."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB31","series-title":"Locality and non-interleaving semantics in calculi for mobile processes. Tech. Rep. ECS-LFCS-94-282","author":"Sangiorgi","year":"1994"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB32","series-title":"Graph Transformations in Computer Science","first-page":"326","article-title":"On relating rewriting systems and graph grammars to event structures","author":"Schied","year":"1994"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB33","doi-asserted-by":"crossref","unstructured":"D. Taubner. Finite representation of CCS and TCSP programs by automata and Petri nets, LNCS 369. Springer Verlag, 1989.","DOI":"10.1007\/3-540-51525-9"},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB34","unstructured":"D. Walker. Objects in the \u03c0-calculus. Information and Computation, 1994. To appear."},{"key":"10.1016\/S1571-0661(04)00024-6_NEWBIB35","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","first-page":"364","article-title":"An Introduction to Event Structures","author":"Winskel","year":"1989"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000246?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000246?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:03:06Z","timestamp":1761609786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":35,"alternative-id":["S1571066104000246"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00024-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Concurrent Semantics for the \u03c0-calculus","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)00024-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}