{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:22Z","timestamp":1725485542238},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654629"},{"type":"electronic","value":"9783540492535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49253-4_26","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:56:45Z","timestamp":1181185005000},"page":"358-372","source":"Crossref","is-referenced-by-count":0,"title":["Pi-Congruences as CCS Equivalences"],"prefix":"10.1007","author":[{"given":"Paola","family":"Quaglia","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. A Domain Equation for Bisimulation. Information and Computation, 92(2)161\u20132181991.","journal-title":"Information and Computation"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"L. Aceto, B. Bloom, and F. Vaandrager. Turning SOS Rules into Equations. Information and Computation111(1):1\u2013521994.","journal-title":"Information and Computation"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent SystemsACM Trans. on Programming Languages and Systems15(1):36\u2013721993.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone De","year":"1985","unstructured":"R. De Simone. Higher level synchronizing devices in MEIJE-SCCS. Theoretical Computer Science, 37(3):245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-60218-6_5","volume-title":"Proc. 6th International Conference on Concurrency Theory, CONCUR\u201995","author":"G.-L. Ferrari","year":"1995","unstructured":"G.-L. Ferrari, U. Montanari, and P. Quaglia. The Weak Late \u03c0-calculus Semantics as Observation Equivalence. In I. Lee and S.A. Smolkaeditors, Proc. 6th International Conference on Concurrency Theory, CONCUR\u201995, volume 962 of LNCS, pages 57\u201371. Springer-Verlag, 1995."},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(96)00063-1","volume":"168","author":"G.-L. Ferrari","year":"1996","unstructured":"G.-L. Ferrari, U. Montanari, and P. Quaglia. A \u03c0-calculus with Explicit SubstitutionsTheoretical Computer Science168(1):53\u20131031996.","journal-title":"Theoretical Computer Science"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and H. Lin. Symbolic Bisimulations. Theoretical Computer Science138:353\u20133891995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and ConcurrencyJournal of the ACM32(1):137\u20131611985.","journal-title":"Journal of the ACM"},{"key":"26_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 6th International Joint Conference CAAP\/FASE, TAPSOFT\u2019 95","author":"H. Lin","year":"1995","unstructured":"H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the \u03c0-Calculus. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, Proc. 6th International Joint Conference CAAP\/FASE, TAPSOFT\u2019 95, volume 915 of LNCS Springer-Verlag, 1995."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u20133101983.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Part I and II. Information and Computation100(1)1\u2013771992.","journal-title":"Information and Computation"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(93)90156-N","volume":"114","author":"R. Milner","year":"1993","unstructured":"R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science114(1)149\u20131711993.","journal-title":"Theoretical Computer Science"},{"key":"26_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 5th GI-Conference","author":"D. Park","year":"1981","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI-Conference, volume 104 of LNCS. Springer-Verlag, 1981."},{"key":"26_CR14","unstructured":"G. D. Plotkin. A Structural Approach to Operational SemanticsTechnical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"26_CR15","unstructured":"P. Quaglia. The \u03c0-calculus with explicit substitutions. PhD thesis, Universit\u00e1 degli Studi di Pisa, Dipartimento di Informatica1996Report TD-09\/96."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"P. Quaglia On the finitary characterization of \u03c0-congruencesBRICS Report RS-97-52 Computer Science Department, Aarhus University 1997.","DOI":"10.7146\/brics.v4i52.19273"},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"D. Sangiorgi. A Theory of Bisimulation for the \/gp-calculus. Acta Informatica, 33(1)69\u2013971996.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49253-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:45:40Z","timestamp":1556480740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49253-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654629","9783540492535"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49253-4_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}