{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:09:33Z","timestamp":1769976573676,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540514862","type":"print"},{"value":"9783540481768","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_71","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:57:49Z","timestamp":1330203469000},"page":"237-248","source":"Crossref","is-referenced-by-count":96,"title":["Equivalence notions for concurrent systems and refinement of actions"],"prefix":"10.1007","author":[{"given":"Rob","family":"Glabbeek","sequence":"first","affiliation":[]},{"given":"Ursula","family":"Goltz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","volume":"30","author":"D. Austry","year":"1984","unstructured":"D. Austry, G. Boudol: Alg\u00e8bre de processus et synchronisations, Theoretical Computer Science, Vol. 30, pp. 91\u2013131, 1984","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","volume-title":"Towards Action-Refinement in Process Algebras, Report 3\/88","author":"L. Aceto","year":"1988","unstructured":"L. Aceto, M. Hennessy: Towards Action-Refinement in Process Algebras, Report 3\/88, Computer Science, University of Sussex, Brighton, 1988"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani: On the Semantics of Concurrency: Partial Orders and Transition Systems, Proc. TAPSOFT 87, Vol. I, LNCS 249, Springer-Verlag, pp 123\u2013137, 1987","DOI":"10.1007\/3-540-17660-8_52"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani: Permutation of Transitions: An Event Structure Semantics for CCS and SCCS, handout at the REX School\/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands, May 30\u2013June 3, 1988","DOI":"10.1007\/BFb0013028"},{"issue":"3","key":"19_CR5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, A.W. Roscoe: A Theory of Communicating Sequential Processes, Journal of the ACM, Vol. 31, No. 3, pp 560\u2013599, 1984","journal-title":"Journal of the ACM"},{"key":"19_CR6","first-page":"12","volume":"31","author":"L. Castellano","year":"1987","unstructured":"L. Castellano, G. De Michelis, L. Pomello: Concurrency vs Interleaving: An Instructive Example, Bulletin of the EATCS 31, pp 12\u201315, 1987","journal-title":"Bulletin of the EATCS"},{"key":"19_CR7","unstructured":"P. Degano, R. De Nicola, U. Montanari: Observational Equivalences for Concurrency Models, in: Formal Description of Programming Concepts \u2014 III, Proc. of the third IFIP WG 2.2 working conference, ed. M. Wirsing, Elsevier Science Publishers B.V. (North Holland), pp 105\u2013129, 1987"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02915446","volume":"26","author":"P. Degano","year":"1988","unstructured":"P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on Condition\/Event Systems, Acta Informatica Vol. 26, pp. 59\u201391, 1988","journal-title":"Acta Informatica"},{"key":"19_CR9","first-page":"16","volume":"29","author":"R. Devillers","year":"1988","unstructured":"R. Devillers: On the Definition of a Bisimulation Notion Based on Partial Words, Petri Net Newsletter 29, pp 16\u201319, April 1988","journal-title":"Petri Net Newsletter"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola, M. Hennessy: Testing Equivalences for Processes, Theoretical Computer Science, Vol. 34, pp. 83\u2013133, 1984","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, U. Goltz: Equivalence Notions for Concurrent Systems and Refinement of Actions, Arbeitspapiere der GMD 366, February 1989","DOI":"10.1007\/3-540-51486-4_71"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.3233\/FI-1981-4210","volume":"IV.2","author":"J. Grabowski","year":"1981","unstructured":"J. Grabowski: On Partial Languages, Fundamenta Informatica IV.2, pp 427\u2013498, 1981","journal-title":"Fundamenta Informatica"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, F.W. Vaandrager: Petri Net Models for Algebraic Theories of Concurrency, Proc. PARLE, Vol. II, LNCS 259, Springer-Verlag, pp 224\u2013242, 1987","DOI":"10.1007\/3-540-17945-3_13"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"M. Hennessy, R. Milner: Algebraic Laws for Nondeterminism and Cocurrency, Journal of the ACM, pp 137\u2013161, 1985","DOI":"10.1145\/2455.2460"},{"issue":"2","key":"19_CR15","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/3318.3322","volume":"7","author":"G. J. Milne","year":"1985","unstructured":"G.J. Milne: CIRCAL and the Representation of Communication, Concurrency and Time, Transactions on Programming Languages and Systems (ACM), Vol. 7, No. 2, pp 270\u2013298, 1985","journal-title":"Transactions on Programming Languages and Systems"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"R. Milner: A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980","DOI":"10.1007\/3-540-10235-3"},{"issue":"3","key":"19_CR17","doi-asserted-by":"crossref","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, Vol. 25, No. 3, pp 267\u2013310, 1983","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"M. Nielsen, G.D. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science, Vol. 13, No. 1, pp 85\u2013108, 1981","journal-title":"Theoretical Computer Science"},{"key":"19_CR19","first-page":"167","volume":"104","author":"D. Park","year":"1981","unstructured":"D. Park: Concurrency and Automata on Infinite Sequences, Theoretical Computer Science (5th GI-Conference), LNCS 104, Springer-Verlag, pp 167\u2013183, 1981","journal-title":"LNCS"},{"key":"19_CR20","first-page":"381","volume":"222","author":"L. Pomello","year":"1986","unstructured":"L. Pomello: Some Equivalence Notions for Concurrent Systems. An Overview, in: Advances in Petri Nets 1985, LNCS 222, Springer-Verlag, pp 381\u2013400, 1986","journal-title":"LNCS"},{"issue":"1","key":"19_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. R. Pratt","year":"1986","unstructured":"V.R. Pratt: Modelling Concurrency with Partial Orders, International Journal of Parallel Programming, Vol. 15, No. 1, pp 33\u201371, 1986","journal-title":"International Journal of Parallel Programming"},{"key":"19_CR22","unstructured":"B.A. Trakktenbrot, A. Rabinovich, J. Hirschfeld: Nets of Processes, Technical Report 97\/88, Tel Aviv Univ., 1988"},{"key":"19_CR23","first-page":"348","volume":"247","author":"D. Taubner","year":"1987","unstructured":"D. Taubner, W. Vogler: The Step Failure Semantics, Proc. STACS 87, LNCS 247, Springer-Verlag, pp 348\u2013359, 1987","journal-title":"LNCS"},{"key":"19_CR24","first-page":"325","volume":"255","author":"G. Winskel","year":"1987","unstructured":"G. Winskel: Event Structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255, Springer-Verlag, pp 325\u2013392, 1987","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:53:57Z","timestamp":1640919237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}