{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:44:16Z","timestamp":1767339856596},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235059"},{"type":"electronic","value":"9783319235066"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23506-6_9","type":"book-chapter","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T07:50:40Z","timestamp":1441266640000},"page":"99-130","source":"Crossref","is-referenced-by-count":7,"title":["Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP"],"prefix":"10.1007","author":[{"given":"Rob J.","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,10]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-54152-7_71","volume-title":"PARLE 1991 Parallel Architectures and Languages Europe","author":"C Autant","year":"1991","unstructured":"Autant, C., Belmesk, Z., Schnoebelen, P.: Strong bisimilarity on nets revisited. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) Proc. PARLE 1991. LNCS, vol. 506, pp. 295\u2013312. Springer, Heidelberg (1991)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01178506","volume":"28","author":"E Best","year":"1991","unstructured":"Best, E., Devillers, R., Kiehn, A., Pomello, L.: Concurrent Bisimulations in Petri nets. Acta Informatica 28, 231\u2013264 (1991). doi: 10.1007\/BF01178506","journal-title":"Acta Informatica"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31(3), 560\u2013599 (1984). doi: 10.1145\/828.833","journal-title":"Journal of the ACM"},{"key":"9_CR4","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 31, 12\u201315 (1987)","journal-title":"Bulletin of the EATCS"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-18419-8_13","volume-title":"Mathematical Models for the Semantics of Parallelism","author":"P Degano","year":"1987","unstructured":"Degano, P., De Nicola, R., Montanari, U.: CCS is an (augmented) contact free C\/E system. In: Zilli, M.V. (ed.) MMSP 1987. LNCS, vol. 280, pp. 144\u2013165. Springer, Heidelberg (1987)"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"EA Emerson","year":"1982","unstructured":"Emerson, E.A., Clarke, E.M.: Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming 2(3), 241\u2013266 (1982). doi: 10.1016\/0167-6423(83)90017-5","journal-title":"Science of Computer Programming"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF01463946","volume":"28","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: Branching Processes of Petri Nets. Acta Informatica 28(6), 575\u2013591 (1991). doi: 10.1007\/BF01463946","journal-title":"Acta Informatica"},{"key":"9_CR8","unstructured":"Fehnker, A., van Glabbeek, R.J., H\u00f6fner, P., McIver, A.K., Portmann, M., Tan, W.L.: A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV. Technical Report 5513, NICTA, Sydney, Australia (2013). http:\/\/arxiv.org\/abs\/1312.7645"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/3-540-10001-6_39","volume-title":"Net Theory and Applications","author":"H Genrich","year":"1980","unstructured":"Genrich, H., Stankiewicz-Wiechno, E.: A dictionary of some basic notions of net theory. In: Brauer, W. (ed.) Advanced Course: Net Theory and Applications. LNCS, vol. 84, pp. 519\u2013531. Springer, Heidelberg (1980)"},{"key":"9_CR10","series-title":"International Federation for Information Processing","first-page":"27","volume-title":"Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods","author":"RJ Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The refinement theorem for ST-bisimulation semantics. In: Broy, M., Jones, C.B. (eds.) Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods. IFIP, pp. 27\u201352. Springer, Heidelberg (1990)"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum I; the semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, vol. 1, pp. 3\u201399. Elsevier (2001). doi: 10.1016\/B978-044482830-9\/50019-9","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/11539452_26","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"RJ Glabbeek van","year":"2005","unstructured":"van Glabbeek, R.J.: The individual and collective token interpretations of petri nets. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 323\u2013337. Springer, Heidelberg (2005)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s002360000041","volume":"37","author":"RJ Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.J., Goltz, U.: Refinement of Actions and Equivalence Notions for Concurrent Systems. Acta Informatica 37, 229\u2013327 (2001). doi: 10.1007\/s002360000041","journal-title":"Acta Informatica"},{"issue":"2\u20133","key":"9_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00236-015-0221-6","volume":"52","author":"RJ Glabbeek van","year":"2015","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: CCS: It\u2019s not fair!. Acta Informatica 52(2\u20133), 175\u2013205 (2015). doi: 10.1007\/s00236-015-0221-6","journal-title":"Acta Informatica"},{"key":"9_CR15","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: Progress, Fairness and Justness in Process Algebra (2015). http:\/\/arxiv.org\/abs\/1501.03268"},{"key":"9_CR16","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":"RJ 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.) Proc. PARLE. LNCS, vol. 259, pp. 224\u2013242. Springer, Heidelberg (1987)"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1997.2634","volume":"136","author":"RJ Glabbeek van","year":"1997","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: The Difference Between Splitting in $$n$$ and $$n\\mathord +1$$ . Information and Comput. 136(2), 109\u2013142 (1997). doi: 10.1006\/inco.1997.2634","journal-title":"Information and Comput."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-13345-3_18","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.) Proceedings $$ 11^{th}$$ ICALP. LNCS, vol. 172, pp. 196\u2013208. Springer, Heidelberg (1984)"},{"issue":"2\u20133","key":"9_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(83)80040-0","volume":"57","author":"U Goltz","year":"1983","unstructured":"Goltz, U., Reisig, W.: The Non-Sequential Behaviour of Petri Nets. Information and Control 57(2\u20133), 125\u2013147 (1983). doi: 10.1016\/S0019-9958(83)80040-0","journal-title":"Information and Control"},{"key":"9_CR20","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"issue":"1","key":"9_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3233\/FI-1991-14103","volume":"14","author":"R Loogen","year":"1991","unstructured":"Loogen, R., Goltz, U.: Modelling nondeterministic concurrent processes with event structures. Fundamenta Informaticae 14(1), 39\u201374 (1991)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(89)90052-2","volume":"64","author":"AW Mazurkiewicz","year":"1989","unstructured":"Mazurkiewicz, A.W., Ochmanski, E., Penczek, W.: Concurrent Systems and Inevitability. TCS 64(3), 281\u2013304 (1989). doi: 10.1016\/0304-3975(89)90052-2","journal-title":"TCS"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1017\/S0960129597002314","volume":"7","author":"J Meseguer","year":"1997","unstructured":"Meseguer, J., Montanari, U., Sassone, V.: On the semantics of place\/transition Petri nets. Mathematical Structures in Computer Science 7(4), 359\u2013397 (1997). doi: 10.1017\/S0960129597002314","journal-title":"Mathematical Structures in Computer Science"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, chap. 19. Elsevier Science Publishers B.V. (North-Holland), pp. 1201\u20131242 (1990). Alternatively see Communication and Concurrency, Prentice-Hall, Englewood Cliffs, of which an earlier version appeared as A Calculus of Communicating Systems. LNCS, vol. 92. Springer (1980). doi: 10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"issue":"1","key":"9_CR25","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.D., Winskel, G.: Petri nets, event structures and domains, part I. TCS 13(1), 85\u2013108 (1981). doi: 10.1016\/0304-3975(81)90112-2","journal-title":"TCS"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-18086-9_27","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.) Advances in Petri Nets 1987. LNCS, vol. 266, pp. 196\u2013223. Springer, Heidelberg (1987)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Olderog, E.-R.: Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationship. Cambridge Tracts in Theor. Comp. Sc. 23. Cambridge University Press (1991)","DOI":"10.1017\/CBO9780511526589"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E-R Olderog","year":"1986","unstructured":"Olderog, E.-R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Informatica 23, 9\u201366 (1986). doi: 10.1007\/BF00268075","journal-title":"Acta Informatica"},{"key":"9_CR29","unstructured":"Petri, C.A.: Non-sequential processes. Internal Report GMD-ISF-77.05, GMD, St. Augustin (1977)"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60\u201361","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A Structural Approach to Operational Semantics. The Journal of Logic and Algebraic Programming 60\u201361, 17\u2013139 (2004). doi: 10.1016\/j.jlap.2004.05.001 . Originally appeared in 1981","journal-title":"The Journal of Logic and Algebraic Programming"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: Foundations of Computer Science (FOCS 1977), pp. 46\u201357. IEEE (1977). doi: 10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"issue":"4","key":"9_CR32","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A Rabinovich","year":"1988","unstructured":"Rabinovich, A., Trakhtenbrot, B.A.: Behavior Structures and Nets. Fundamenta Informaticae 11(4), 357\u2013404 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Reisig, W.: Petri nets \u2013 an introduction. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer (1985). doi: 10.1007\/978-3-642-69968-9","DOI":"10.1007\/978-3-642-69968-9"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Reisig, W.: Understanding Petri Nets - Modeling Techniques, Analysis Methods, Case Studies. Springer (2013). doi: 10.1007\/978-3-642-33278-4","DOI":"10.1007\/978-3-642-33278-4"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 84. LNCS, vol. 166, pp. 140\u2013150. Springer, Heidelberg (1984)"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1986","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Applications and Relationships to Other Models of Concurrency. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","Correct System Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23506-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T05:58:27Z","timestamp":1653112707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23506-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235059","9783319235066"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23506-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}