{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:58Z","timestamp":1725664258803},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583387"},{"type":"electronic","value":"9783540486633"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_103","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:51:34Z","timestamp":1330253494000},"page":"567-576","source":"Crossref","is-referenced-by-count":2,"title":["Read-write causality"],"prefix":"10.1007","author":[{"given":"Corrado","family":"Priami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Yankelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"4","key":"49_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"XI","author":"G. Boudol","year":"1988","unstructured":"G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Foundamenta Informaticae, XI(4):433\u2013452, 1988.","journal-title":"Foundamenta Informaticae"},{"key":"49_CR2","first-page":"108","volume":"630","author":"G. Boudol","year":"1992","unstructured":"G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. In Proceedings of CONCUR'92, LNCS 630, pages 108\u2013122, 1992.","journal-title":"LNCS"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Ph. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP'89, LNCS 372, pages 234\u2013248. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035764"},{"key":"49_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(90)90095-Y","volume":"75","author":"P. Degano","year":"1990","unstructured":"P. Degano, R. De Nicola, and U. Montanari. A partial ordering semantics for CCS. Theoretical Computer Science, 75:223\u2013262, 1990.","journal-title":"Theoretical Computer Science"},{"key":"49_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(93)90153-K","volume":"114","author":"P. Degano","year":"1993","unstructured":"P. Degano, R. De Nicola, and U. Montanari. Universal axioms for bisimulation. Theoretical Computer Science, 114:63\u201391, 1993.","journal-title":"Theoretical Computer Science"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"P. Degano and C. Priami. Proved trees. In Proceedings of ICALP'92, LNCS 623, pages 629\u2013640. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_110"},{"key":"49_CR7","unstructured":"P. Degano and C. Priami. Relating models of concurrency. Submitted to Formal Aspects of Computing., 1993."},{"key":"49_CR8","doi-asserted-by":"crossref","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 concurrency. Journal of ACM, 32:137\u2013161, 1985.","journal-title":"Journal of ACM"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"P. Inverardi, C. Priami, and D. Yankelevich. Automatizing parametric reasoning on distributed concurrent systems. Formal Aspects of Computing, 1993. To appear.","DOI":"10.1007\/BF03259392"},{"key":"49_CR11","unstructured":"A. Kiehn. Local and global causes. Technical report, TUM 342\/23\/91, 1991."},{"key":"49_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"issue":"1","key":"49_CR13","doi-asserted-by":"crossref","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 (I and II). Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"U. Montanari and D. Yankelevich. A parametric approach to localities. In Proceedings of ICALP'92, LNCS 623, pages 617\u2013628. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_109"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proceedings of GI, LNCS 104, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"49_CR16","volume-title":"Formal Description of Programming Concepts II","author":"G. Plotkin","year":"1983","unstructured":"G. Plotkin. An operational semantics for CSP. In Formal Description of Programming Concepts II, IFIP. North-Holland, 1983."},{"key":"49_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"V. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15:33\u201371, 1986.","journal-title":"International Journal of Parallel Programming"},{"issue":"4","key":"49_CR18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"XI","author":"A. Rabinovich","year":"1988","unstructured":"A. Rabinovich and B. Trakhtenbrot. Nets of processes. Fundamenta Informaticae, XI(4):357\u2013404, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"49_CR19","unstructured":"B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Imperial College \u2014 University of London, 1990."},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"G. Winskel. Event structures for CCS and related languages. In Proceedings of ICALP'82, LNCS 140, pages 561\u2013576. Springer-Verlag, 1982.","DOI":"10.1007\/BFb0012800"},{"key":"49_CR21","unstructured":"D. Yankelevich. Parametric Views of Process Description Languages. PhD thesis, Universit\u00e0 di Pisa, TD 23\/93, 1993."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:55:25Z","timestamp":1640915725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_103","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}