{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T05:17:53Z","timestamp":1738300673091,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":126,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_47","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T06:58:16Z","timestamp":1213081096000},"page":"757-777","source":"Crossref","is-referenced-by-count":5,"title":["Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"Boudol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Castellani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mogens","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","volume-title":"Distinguished Dissertations in Computer Science","author":"L. Aceto","year":"1992","unstructured":"Aceto, L.: Action-refinement in process algebras. In: Distinguished Dissertations in Computer Science. Cambridge University Press, Cambridge (1992)"},{"issue":"4","key":"47_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.3233\/FI-1992-17403","volume":"17","author":"L. Aceto","year":"1992","unstructured":"Aceto, L.: History preserving, causal and mixed-ordering equivalence over stable event structures (Note). Fundamenta Informaticae\u00a017(4), 319\u2013331 (1992)","journal-title":"Fundamenta Informaticae"},{"issue":"4","key":"47_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.3233\/FI-1992-17406","volume":"17","author":"L. Aceto","year":"1992","unstructured":"Aceto, L.: Relating distributed, temporal and causal observations of simple processes. Fundamenta Informaticae\u00a017(4), 369\u2013397 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01221099","volume":"6","author":"L. Aceto","year":"1994","unstructured":"Aceto, L.: A static view of localities. Formal Aspects of Computing\u00a06, 201\u2013222 (1994); Previously appeared as INRIA Research Report n. 1483 (1991)","journal-title":"Formal Aspects of Computing"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-54967-6_63","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"L. Aceto","year":"1991","unstructured":"Aceto, L., Engberg, U.: Failure semantics for a simple process language with refinement. In: Biswas, S., Nori, K.V. (eds.) FSTTCS 1991. LNCS, vol.\u00a0560, pp. 89\u2013108. Springer, Heidelberg (1991)"},{"issue":"2","key":"47_CR6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/inco.1993.1019","volume":"103","author":"L. Aceto","year":"1993","unstructured":"Aceto, L., Hennessy, M.: Towards action-refinement in process algebras. Information and Computation\u00a0103(2), 204\u2013269 (1993); Extended abstract. In: Proceedings LICS 1989, IEEE Computer Society Press (1989)","journal-title":"Information and Computation"},{"key":"#cr-split#-47_CR7.1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Hennessy, M.: Adding action refinement to a finite process algebra. Information and Computation??115(2), 179???247 (1994);","DOI":"10.1006\/inco.1994.1096"},{"key":"#cr-split#-47_CR7.2","unstructured":"Extended abstract. In: Leach Albert, J., Monien, B., Rodr??guez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.??510, Springer, Heidelberg (1991)"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0084799","volume-title":"CONCUR 1992","author":"E. Badouel","year":"1992","unstructured":"Badouel, E., Darondeau, P.: Structural operational specifications and trace automata. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630. Springer, Heidelberg (1992)"},{"key":"47_CR9","unstructured":"Bednarczyk, M.: Categories of Asynchronous Systems. PhD thesis, University of Sussex (1988)"},{"key":"47_CR10","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. Theoretical Computer Science\u00a096, 217\u2013248 (1992); Extended abstract. In: Proceedings POPL 1990, pp. 81\u201394 (1990)","journal-title":"Theoretical Computer Science"},{"key":"47_CR11","first-page":"136","volume":"38","author":"G. Boudol","year":"1989","unstructured":"Boudol, G.: Atomic actions (Note). Bulletin of the European Association for Theoretical Computer Science\u00a038, 136\u2013144 (1989)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-53479-2_4","volume-title":"Semantics of Systems of Concurrent Processes","author":"G. Boudol","year":"1990","unstructured":"Boudol, G.: Flow event structures and flow nets. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol.\u00a0469, pp. 62\u201395. Springer, Heidelberg (1990)"},{"key":"47_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-17660-8_52","volume-title":"TAPSOFT 1987 Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"G. Boudol","year":"1987","unstructured":"Boudol, G., Castellani, I.: On the semantics of concurrency: partial orders and transition systems. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol.\u00a0249, pp. 123\u2013137. Springer, Heidelberg (1987)"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(88)90096-5","volume":"59","author":"G. Boudol","year":"1988","unstructured":"Boudol, G., Castellani, I.: Concurrency and atomicity. Theoretical Computer Science\u00a059, 25\u201384 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"47_CR15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"11","author":"G. Boudol","year":"1988","unstructured":"Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae\u00a011(4), 433\u2013452 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013028","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Boudol","year":"1989","unstructured":"Boudol, G., Castellani, I.: Permutation of transitions: an event structure semantics for CCS and SCCS. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, Springer, Heidelberg (1989)"},{"key":"#cr-split#-47_CR17.1","unstructured":"Boudol, G., Castellani, I.: Flow models of distributed computations: event structures and nets. Research Report 1482, INRIA (1991);"},{"key":"#cr-split#-47_CR17.2","unstructured":"Previous version by G. Boudol. In: Guessarian, I.(ed.) LITP School 1990. LNCS, vol.??469, Springer, Heidelberg (1990)"},{"key":"#cr-split#-47_CR18.1","doi-asserted-by":"crossref","unstructured":"Boudol, G., Castellani, I.: Flow models of distributed computations: three equivalent semantics for CCS. Information and Computation??114(2), 247???314 (1994);","DOI":"10.1006\/inco.1994.1088"},{"key":"#cr-split#-47_CR18.2","unstructured":"Extended abstract. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol.??469, Springer, Heidelberg (1990)"},{"key":"#cr-split#-47_CR19.1","doi-asserted-by":"crossref","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science??114, 31???61 (1993);","DOI":"10.1016\/0304-3975(93)90152-J"},{"key":"#cr-split#-47_CR19.2","unstructured":"Extended abstract. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol.??520. Springer, Heidelberg (1991)"},{"key":"#cr-split#-47_CR20.1","doi-asserted-by":"crossref","unstructured":"Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A theory of processes with localities. Formal Aspects of Computing??6, 165???200 (1994);","DOI":"10.1007\/BF01221098"},{"key":"#cr-split#-47_CR20.2","unstructured":"Extended abstract. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.??630, pp. 165???200. Springer, Heidelberg (1992)"},{"issue":"3","key":"47_CR21","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"Brookes, S., Hoare, C.A.R., Roscoe, A.: A theory of communicating sequential processes. Journal of ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of ACM"},{"key":"47_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol.\u00a01378. Springer, Heidelberg (1998)"},{"key":"47_CR23","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/0022-0000(87)90025-0","volume":"34","author":"I. Castellani","year":"1987","unstructured":"Castellani, I.: Bisimulations and abstraction homomorphisms. Journal of Computer and System Sciences\u00a034, 210\u2013235 (1987)","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR24","unstructured":"Castellani, I.: Bisimulations for Concurrency. PhD thesis, University of Edinburgh (1988)"},{"issue":"6","key":"47_CR25","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1142\/S0129054195000196","volume":"4","author":"I. Castellani","year":"1995","unstructured":"Castellani, I.: Observing distribution in processes: static and dynamic localities. Int.\u00a0Journal of Foundations of Computer Science\u00a04(6), 353\u2013393 (1995); Extended abstract. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711. Springer, Heidelberg (1993)","journal-title":"Int. Journal of Foundations of Computer Science"},{"key":"47_CR26","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/B978-044482830-9\/50033-3","volume-title":"Handbook of Process Algebra","author":"I. Castellani","year":"2001","unstructured":"Castellani, I.: Process algebras with localities. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 945\u20131045. North-Holland, Amsterdam (2001)"},{"issue":"4","key":"47_CR27","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1145\/76359.76369","volume":"36","author":"I. Castellani","year":"1989","unstructured":"Castellani, I., Hennessy, M.: Distributed bisimulations. JACM\u00a036(4), 887\u2013911 (1989)","journal-title":"JACM"},{"issue":"1-2","key":"47_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0304-3975(96)00104-1","volume":"179","author":"I. Castellani","year":"1997","unstructured":"Castellani, I., Zhang, G.Q.: Parallel product of event structures. Theoretical Computer Science\u00a0179(1-2), 203\u2013215 (1997); Previously appeared as DAIMI Research Report PB-301, 1989, and as INRIA Research Report 1078 (1989)","journal-title":"Theoretical Computer Science"},{"key":"47_CR29","first-page":"12","volume":"31","author":"L. Castellano","year":"1987","unstructured":"Castellano, L., De Michelis, G., Pomello, L.: Concurrency vs interleaving: an instructive example. Bulletin of the EATCS\u00a031, 12\u201315 (1987)","journal-title":"Bulletin of the EATCS"},{"issue":"3","key":"47_CR30","first-page":"553","volume":"15","author":"G. Cattani","year":"2005","unstructured":"Cattani, G., Winskel, G.: Profunctors, open maps and bisimulation. MSCS\u00a015(3), 553\u2013614 (2005)","journal-title":"MSCS"},{"key":"47_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 1992","author":"S. Christensen","year":"1992","unstructured":"Christensen, S.: Distributed bisimilarity is decidable for a class of infinite state-space systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630. Springer, Heidelberg (1992)"},{"key":"47_CR32","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s002360050086","volume":"34","author":"F. Corradini","year":"1997","unstructured":"Corradini, F., De Nicola, R.: Locality based semantics for process algebras. Acta Informatica\u00a034, 291\u2013324 (1997)","journal-title":"Acta Informatica"},{"key":"47_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V. Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"47_CR34","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings ICALP 1989","author":"P. Darondeau","year":"1989","unstructured":"Darondeau, P., Degano, P.: Causal trees. In: ICALP 1989. LNCS, vol.\u00a0372. Springer, Heidelberg (1989)"},{"key":"47_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Semantics of Systems of Concurrent Processes","author":"P. Darondeau","year":"1990","unstructured":"Darondeau, P., Degano, P.: Causal trees: interleaving + causality. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol.\u00a0469. Springer, Heidelberg (1990)"},{"key":"#cr-split#-47_CR36.1","doi-asserted-by":"crossref","unstructured":"Darondeau, P., Degano, P.: Refinement of actions in event structures and causal trees. Theoretical Computer Science??118(1), 21???48 (1993);","DOI":"10.1016\/0304-3975(93)90361-V"},{"key":"#cr-split#-47_CR36.2","unstructured":"Extended abstract. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol.??452. Springer, Heidelberg (1990)"},{"key":"47_CR37","unstructured":"De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: A Petri net model for CSP. In: Proceedings CIL 1981, Barcelona (1981)"},{"key":"47_CR38","doi-asserted-by":"crossref","unstructured":"De Cindio, F., De Michelis, G., Pomello, L., Simone, C.: Milner\u2019s Communicating Systems and Petri Nets. In: European Workshop on Applications and Theory of Petri Nets, pp. 40\u201359 (1982)","DOI":"10.1007\/978-3-642-69028-0_4"},{"key":"47_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030636","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"R. Nicola De","year":"1997","unstructured":"De Nicola, R., Ferrari, G., Pugliese, R.: Locality based LINDA: programming with explicit localities. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, Springer, Heidelberg (1997)"},{"issue":"5","key":"47_CR40","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. on Software Engineering\u00a024(5), 315\u2013330 (1998)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"47_CR41","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"43","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a043, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"47_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/BFb0028836","volume-title":"Fundamentals of Computation Theory","author":"P. Degano","year":"1985","unstructured":"Degano, P., De Nicola, R., Montanari, U.: Partial ordering derivations for CCS. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 520\u2013533. Springer, Heidelberg (1985)"},{"key":"47_CR43","volume-title":"Proceedings 3rd IFIP WG 2.2 Working Conference, Ebberup 1986","author":"P. Degano","year":"1987","unstructured":"Degano, P., De Nicola, R., Montanari, U.: Observational equivalences for concurrency models. In: Proceedings 3rd IFIP WG 2.2 Working Conference, Ebberup 1986, North-Holland, Amsterdam (1987)"},{"issue":"1\/2","key":"47_CR44","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02915446","volume":"26","author":"P. Degano","year":"1988","unstructured":"Degano, P., De Nicola, R., Montanari, U.: A distributed operational semantics for CCS based on condition\/event systems. Acta Informatica\u00a026(1\/2), 59\u201391 (1988)","journal-title":"Acta Informatica"},{"key":"47_CR45","volume-title":"Proceedings LICS 1988","author":"P. Degano","year":"1988","unstructured":"Degano, P., De Nicola, R., Montanari, U.: On the consistency of truly concurrent operational and denotational semantics. In: Proceedings LICS 1988, IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"47_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013030","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"P. Degano","year":"1989","unstructured":"Degano, P., De Nicola, R., 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. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, Springer, Heidelberg (1989)"},{"issue":"3","key":"47_CR47","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90095-Y","volume":"75","author":"P. Degano","year":"1990","unstructured":"Degano, P., De Nicola, R., Montanari, U.: A partial ordering semantics for CCS. Theoretical Computer Science\u00a075(3), 223\u2013262 (1990)","journal-title":"Theoretical Computer Science"},{"key":"47_CR48","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(93)90153-K","volume":"114","author":"P. Degano","year":"1993","unstructured":"Degano, P., De Nicola, R., Montanari, U.: Universal axioms for bisimulations. Theoretical Computer Science\u00a0114, 63\u201391 (1993); Extended abstract. In: Proceedings 3rd Workshop on Concurrency and Compositionality, GMD-Studien Nr. 191 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"2\/3","key":"47_CR49","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0022-0000(87)90032-8","volume":"34","author":"P. Degano","year":"1987","unstructured":"Degano, P., Montanari, U.: Concurrent histories: A basis for observing distributed systems. Journal of Computer and System Sciences\u00a034(2\/3), 422\u2013461 (1987)","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR50","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"P. Degano","year":"1992","unstructured":"Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, Springer, Heidelberg (1992)"},{"key":"47_CR51","unstructured":"Ferrari, G.: Unifying Models of Concurrency. PhD thesis, University of Pisa (1990)"},{"key":"47_CR52","series-title":"Lecture Notes in Computer Science","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"G. Ferrari","year":"1991","unstructured":"Ferrari, G., Gorrieri, R., Montanari, U.: An extended expansion theorem. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol.\u00a0494, Springer, Heidelberg (1991)"},{"key":"47_CR53","series-title":"Lecture Notes in Computer Science","volume-title":"CAAP \u201990","author":"G. Ferrari","year":"1990","unstructured":"Ferrari, G., Montanari, U.: Towards the unification of models of concurrency. In: Arnold, A. (ed.) CAAP 1990. LNCS, vol.\u00a0431, Springer, Heidelberg (1990)"},{"key":"47_CR54","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Proceedings POPL 1996, pp. 372\u2013385 (1996)","DOI":"10.1145\/237721.237805"},{"key":"47_CR55","unstructured":"Gischer, J.L.: Partial orders and the axiomatic theory of shuffle. PhD thesis, Stanford University (1984)"},{"key":"47_CR56","first-page":"27","volume-title":"Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The refinement theorem for ST-bisimulation semantics. In: Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, pp. 27\u201352. North-Holland, Amsterdam (1990)"},{"key":"47_CR57","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (1989)"},{"key":"47_CR58","series-title":"Lecture Notes in Computer Science","volume-title":"Semantics of Systems of Concurrent Processes","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J., Goltz, U.: Equivalences and refinement. In: Guessarian, I. (ed.) LITP School 1990. LNCS, vol.\u00a0469. Springer, Heidelberg (1990)"},{"key":"47_CR59","series-title":"Lecture Notes in Computer Science","volume-title":"Stepwise Refinement of Distributed Systems","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J., Goltz, U.: Refinement of actions in causality based models. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX Workshop 1989. LNCS, vol.\u00a0430. Springer, Heidelberg (1990)"},{"issue":"4\/5","key":"47_CR60","first-page":"229","volume":"37","author":"R.J. Glabbeek van","year":"1998","unstructured":"van Glabbeek, R.J., Goltz, U.: Refinement of actions and equivalence notions for concurrent systems. Acta Informatica\u00a037(4\/5), 229\u2013327 (2001); Previously appeared as Research Report 6\/98, University of Hildesheim (1998)","journal-title":"Acta Informatica"},{"issue":"1-3","key":"47_CR61","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.tcs.2003.10.031","volume":"311","author":"R.J. Glabbeek van","year":"2004","unstructured":"van Glabbeek, R.J., Goltz, U.: Well-behaved flow event structures for parallel composition and action refinement. Theoretical Computer Science\u00a0311(1-3), 463\u2013478 (2004)","journal-title":"Theoretical Computer Science"},{"key":"47_CR62","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (1987)"},{"key":"47_CR63","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages, and Programming","author":"U. Goltz","year":"1984","unstructured":"Goltz, U., Mycroft, A.: On the relationship of CCS and Petri nets. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172. Springer, Heidelberg (1984)"},{"key":"47_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-15204-0_11","volume-title":"Advances in Petri Nets 1984","author":"U. Goltz","year":"1985","unstructured":"Goltz, U., Reisig, W.: CSP programs as nets with individual tokens. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol.\u00a0188. pp. 169\u2013196. Springer, Heidelberg (1985)"},{"key":"47_CR65","unstructured":"Gorrieri, R.: Refinement, Atomicity and Transactions for Process Description Languages. PhD thesis, University of Pisa (1991)"},{"key":"#cr-split#-47_CR66.1","doi-asserted-by":"crossref","unstructured":"Gorrieri, R., Marchetti, S., Montanari, U.: A 2CCS: Atomic actions for CCS. Theoretical Computer Science??72, 203???223 (1990);","DOI":"10.1016\/0304-3975(90)90035-G"},{"key":"#cr-split#-47_CR66.2","unstructured":"Extended abstract. In: Dauchet, M., Nivat, M. (eds.) CAAP 1988. LNCS, vol.??299. Springer, Heidelberg (1988)"},{"key":"47_CR67","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (1990)"},{"issue":"3","key":"47_CR68","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S0129054190000205","volume":"1","author":"R. Gorrieri","year":"1990","unstructured":"Gorrieri, R., Montanari, U.: Towards hierarchical description of systems: a proof system for strong prefixing. Int.\u00a0Journal of Foundations of Computer Science\u00a01(3), 277\u2013293 (1990)","journal-title":"Int.\u00a0Journal of Foundations of Computer Science"},{"key":"47_CR69","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/B978-044482830-9\/50034-5","volume-title":"Handbook of Process Algebra","author":"R. Gorrieri","year":"2001","unstructured":"Gorrieri, R., Rensink, A.: Action refinement. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 1047\u20131147. North-Holland, Amsterdam (2001)"},{"issue":"1","key":"47_CR70","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"4","author":"J. Grabowski","year":"1981","unstructured":"Grabowski, J.: On partial languages. Fundamenta Informaticae\u00a04(1), 427\u2013498 (1981)","journal-title":"Fundamenta Informaticae"},{"key":"47_CR71","unstructured":"Hennessy, M.: On the relationship between time and interleaving. Sophia-Antipolis (1980) (unpublished draft)"},{"issue":"5","key":"47_CR72","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/0217063","volume":"17","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Axiomatising finite concurrent processes. SIAM Journal of Computing\u00a017(5), 997\u20131017 (1988)","journal-title":"SIAM Journal of Computing"},{"key":"47_CR73","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511611063","volume-title":"A Distributed Pi-calculus","author":"M. Hennessy","year":"2007","unstructured":"Hennessy, M.: A Distributed Pi-calculus. Cambridge University Press, Cambridge (2007)"},{"key":"47_CR74","doi-asserted-by":"crossref","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. JACM\u00a032 (1985)","DOI":"10.1145\/2455.2460"},{"key":"47_CR75","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"47_CR76","first-page":"418","volume-title":"Proceedings LICS 1993","author":"A. Joyal","year":"1993","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation and open maps. In: Proceedings LICS 1993, pp. 418\u2013427. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"47_CR77","unstructured":"Kiehn, A.: Concurrency in process algebras. Habilitation Thesis, Technische Universit\u00e4t M\u00fcnchen (1999)"},{"key":"47_CR78","unstructured":"Kiehn, A.: Distributed bisimulations for finite CCS. Report 7\/89, University of Sussex (1989)"},{"key":"47_CR79","unstructured":"Kiehn, A.: Local and global causes. Technical Report 342\/23\/91, Technische Universit\u00e4t M\u00fcnchen (1991)"},{"key":"47_CR80","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF01178730","volume":"31","author":"A. Kiehn","year":"1994","unstructured":"Kiehn, A.: Comparing locality and causality based equivalences. Acta Informatica\u00a031, 697\u2013718 (1994)","journal-title":"Acta Informatica"},{"key":"#cr-split#-47_CR81.1","unstructured":"Langerak, R.: Bundle event structures: a non-interleaving semantics for LOTOS. In: Proceedings IFIP TC6\/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (1992);"},{"key":"#cr-split#-47_CR81.2","unstructured":"Previously appeared as University of Twente Research Report (1991)"},{"issue":"1","key":"47_CR82","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3233\/FI-1991-14103","volume":"XIV","author":"R. Loogen","year":"1991","unstructured":"Loogen, R., Goltz, U.: Modelling nondeterministic concurrent processes with event structures. Fundamenta Informaticae\u00a0XIV(1), 39\u201374 (1991)","journal-title":"Fundamenta Informaticae"},{"key":"47_CR83","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Report DAIMI PB-78, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"47_CR84","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255. Springer, Heidelberg (1987)"},{"key":"47_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"47_CR86","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"47_CR87","unstructured":"Montanari, U., Boudol, G., Castellani, I., Ferrari, G., Hennessy, M., Nielsen, M., Winskel, G.: ESPRIT Basic Research Action n. 3011 CEDISYS - Final Report (1992), http:\/\/www-sop.inria.fr\/mimosa\/personnel\/Ilaria.Castellani\/CEDISYS-final-report.pdf"},{"key":"47_CR88","first-page":"292","volume-title":"Proceedings Colloquium on the Resolution of Equations in Algebraic Structures","author":"U. Montanari","year":"1989","unstructured":"Montanari, U., Sgamma, M.: Canonical representatives for observational equivalence. In: Proceedings Colloquium on the Resolution of Equations in Algebraic Structures, pp. 292\u2013319. Academic Press, London (1989)"},{"key":"47_CR89","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"U. Montanari","year":"1992","unstructured":"Montanari, U., Yankelevich, D.: A parametric approach to localities. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623. Springer, Heidelberg (1992)"},{"key":"47_CR90","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(94)00219-9","volume":"149","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Yankelevich, D.: Location equivalence in a parametric setting. Theoretical Computer Science\u00a0149. 299\u2013332 (1995)","journal-title":"Theoretical Computer Science"},{"key":"47_CR91","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Mukund","year":"1992","unstructured":"Mukund, M., Nielsen, M.: CCS, locations and asynchronous transition systems. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol.\u00a0652, Springer, Heidelberg (1992)"},{"key":"47_CR92","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"M. Nielsen","year":"1987","unstructured":"Nielsen, M.: CCS and its relationship to net theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, Springer, Heidelberg (1987)"},{"key":"47_CR93","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013034","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"M. Nielsen","year":"1989","unstructured":"Nielsen, M., Engberg, U.H., Larsen, K.S.: Fully abstract models for a process language with refinement. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354. Springer, Heidelberg (1989)"},{"issue":"1","key":"47_CR94","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains, Part I. Theoretical Computer Science\u00a013(1), 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"47_CR95","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01783665","volume":"4","author":"M. Nielsen","year":"1990","unstructured":"Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Behavioural notions for elementary net systems. Distributed Computing\u00a04, 45\u201357 (1990)","journal-title":"Distributed Computing"},{"issue":"1","key":"47_CR96","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90180-N","volume":"96","author":"M. Nielsen","year":"1992","unstructured":"Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Elementary transition systems. Theoretical Computer Science\u00a096(1), 3\u201333 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"47_CR97","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/inco.1995.1062","volume":"118","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Transition systems, event structures and unfoldings. Information and Computation\u00a0118(2), 191\u2013207 (1995)","journal-title":"Information and Computation"},{"key":"47_CR98","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1987","author":"E.-R. Olderog","year":"1987","unstructured":"Olderog, E.-R.: Operational Petri net semantics for CCSP. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol.\u00a0266. Springer, Heidelberg (1987)"},{"key":"47_CR99","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104. Springer, Heidelberg (1981)"},{"key":"47_CR100","unstructured":"Petri, C.A.: Nonsequential processes. Research Report 77-05, GMD, Sankt Augustin (1977)"},{"issue":"1","key":"47_CR101","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.entcs.2007.08.018","volume":"192","author":"I. Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electron. Notes Theor. Comput. Sci.\u00a0192(1), 93\u2013108 (2007)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"47_CR102","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)"},{"key":"47_CR103","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: On the composition of processes. In: Proceedings POPL 1982 (1982)","DOI":"10.1145\/582153.582177"},{"key":"47_CR104","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Modelling concurrency with partial orders. Journal of Parallel Programming\u00a015(1) (1986)","DOI":"10.1007\/BF01379149"},{"key":"47_CR105","unstructured":"Priami, C.: Enhanced Operational Semantics for Concurrency. PhD thesis, University of Pisa (1996)"},{"key":"47_CR106","series-title":"Lecture Notes in Computer Science","volume-title":"Transactions on Computational Systems Biology VI","year":"2006","unstructured":"Priami, C., Plotkin, G. (eds.): Transactions on Computational Systems Biology VI. LNCS, vol.\u00a04220. Springer, Heidelberg (2006)"},{"issue":"4","key":"47_CR107","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"XI","author":"A. Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets. Fundamenta Informaticae\u00a0XI(4), 357\u2013404 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"47_CR108","doi-asserted-by":"crossref","unstructured":"Reisig, W.: Petri Nets. EATCS Monographs on Theoretical Computer Science (1985)","DOI":"10.1007\/978-3-642-69968-9"},{"key":"47_CR109","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0040254","volume-title":"Mathematical Foundations of Programming Semantics","author":"E.W. Stark","year":"1990","unstructured":"Stark, E.W.: Connections between a concrete and an abstract model of concurrent systems. In: Schmidt, D.A., Main, M.G., Melton, A.C., Mislove, M.W. (eds.) MFPS 1989. LNCS, vol.\u00a0442, pp. 53\u201379. Springer, Heidelberg (1990)"},{"key":"47_CR110","unstructured":"Winskel, G.: Events in Computation. PhD thesis, University of Edinburgh (1980)"},{"key":"47_CR111","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0012800","volume-title":"Automata, Languages, and Programming","author":"G. Winskel","year":"1982","unstructured":"Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140. Springer, Heidelberg (1982)"},{"key":"47_CR112","series-title":"Lecture Notes in Computer Science","volume-title":"Seminar on Concurrency","author":"G. Winskel","year":"1985","unstructured":"Winskel, G.: Categories of models for concurrency. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol.\u00a0197, Springer, Heidelberg (1985)"},{"key":"47_CR113","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-12920-0_13","volume-title":"STACS 84","author":"G. Winskel","year":"1984","unstructured":"Winskel, G.: A new definition of morphism on Petri nets. In: Fontet, M., Mehlhorn, K. (eds.) STACS 1984. LNCS, vol.\u00a0166, pp. 140\u2013150. Springer, Heidelberg (1984)"},{"key":"47_CR114","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)"},{"key":"47_CR115","first-page":"197","volume":"72","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Petri nets, algebras, morphisms and compositionality. Information and Control\u00a072, 197\u2013238 (1987)","journal-title":"Information and Control"},{"key":"47_CR116","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-73859-6_4","volume-title":"Algebra and Coalgebra in Computer Science","author":"G. Winskel","year":"2007","unstructured":"Winskel, G.: Symmetry and concurrency. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 40\u201364. Springer, Heidelberg (2007)"},{"key":"47_CR117","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of Logic in Computer Science, Oxford, vol.\u00a04, pp. 1\u2013148 (1995)","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"key":"47_CR118","unstructured":"Yankelevich, D.: Parametric Views of Process Description Languages. PhD thesis, University of Pisa (1993)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:16:32Z","timestamp":1738257392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":126,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}