{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:18Z","timestamp":1761611298631},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540525592"},{"type":"electronic","value":"9783540470359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52559-9_68","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:36:29Z","timestamp":1330205789000},"page":"267-300","source":"Crossref","is-referenced-by-count":47,"title":["Refinement of actions in causality based models"],"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,6,4]]},"reference":[{"key":"10_CR1","first-page":"138","volume-title":"Towards Action-Refinement in Process Algebras","author":"L. Aceto","year":"1989","unstructured":"L. Aceto, M. Hennessy: Towards Action-Refinement in Process Algebras, in: Proc. LICS'89, Asilomar, California, IEEE Computer Society Press, Washington, pp 138\u2013145, 1989"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6423(85)90010-3","volume":"5","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra, J.V. Tucker: Top-down Design and the Algebra of Communicating Processes, Science of Computer Programming 5, pp 171\u2013199, 1985","journal-title":"Science of Computer Programming"},{"key":"10_CR3","unstructured":"E. Best, R. Devillers, A. Kiehn, L. Pomello: Fully Concurrent Bisimulation, unpublished, 1989"},{"key":"10_CR4","first-page":"136","volume":"38","author":"G. Boudol","year":"1989","unstructured":"G. Boudol: Atomic Actions (Note), Bulletin of the EATCS 38, pp 136\u2013144, 1989","journal-title":"Bulletin of the EATCS"},{"key":"10_CR5","unstructured":"G. Boudol: Computations of Distributed Systems, Part 1: Flow Event structures and Flow Nets, report INRIA Sophia Antipolis, to appear"},{"key":"10_CR6","first-page":"411","volume":"354","author":"G. Boudol","year":"1989","unstructured":"G. Boudol, I. Castellani: Permutation of Transitions: An Event Structure Semantics for CCS and SCCS, in: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, pp 411\u2013427, 1989","journal-title":"LNCS"},{"key":"10_CR7","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"J. Desel, A. Merceron: Vicinity Respecting Net Morphisms, in: Advances in Petri Nets 89, LNCS, Springer-Verlag, to appear","DOI":"10.1007\/3-540-53863-1_25"},{"key":"10_CR9","first-page":"519","volume":"84","author":"H.J. Genrich","year":"1979","unstructured":"H.J. Genrich, E. Stankiewicy-Wiechno: A Dictionary of some Basic Notions of Net Theory, in: Net Theory and Applications, LNCS 84, Springer-Verlag, pp 519\u2013535, 1979","journal-title":"LNCS"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"J.L. Gischer","year":"1988","unstructured":"J.L. Gischer: The Equational Theory of Pomsets, Theoretical Computer Science 61, pp 199\u2013224, 1988","journal-title":"Theoretical Computer Science"},{"key":"10_CR11","unstructured":"R.J. van Glabbeek: The Refinement Theorem for ST-Bisimulation Semantics, Report, Centrum voor Wiskunde en Informatica, Amsterdam 1990; to appear in: Proceedings IFIP Working Conference Programming Concepts and Methodes, Israel at sea Gallilee 1990"},{"key":"10_CR12","first-page":"237","volume":"379","author":"R.J. Glabbeek van","year":"1989","unstructured":"R.J. van Glabbeek, U. Goltz: Equivalence Notions for Concurrent Systems and Refinement of Actions, Arbeitspapiere der GMD 366, February 1989, Extended Abstract in Proc. MFCS 89, LNCS 379, Springer-Verlag, pp 237\u2013248, 1989","journal-title":"LNCS"},{"key":"10_CR13","first-page":"224","volume":"259","author":"R.J. Glabbeek van","year":"1987","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","journal-title":"LNCS"},{"key":"10_CR14","unstructured":"R.J. van Glabbeek, W.P. Weijland: Refinement in Branching Time Semantics, Report CSR8922, Centrum voor Wiskunde en Informatica, Amsterdam 1989; in: J.W. de Bakker, 25 jaar semantiek, liber amicorum, Centrum voor Wiskunde en Informatica, Amsterdam 1989, pp 247\u2013252; and in: Proceedings AMAST Conference, Iowa City, USA, 1989, pp 197\u2013201"},{"key":"10_CR15","unstructured":"R. Gorrieri, S. Marchetti, U. Montanari: A 2 CCS: A Simple Extension of CCS for Handling Atomic Actions in: Proc. CAAP'88, LNCS 299, Springer-Verlag, 1988"},{"key":"10_CR16","first-page":"219","volume":"375","author":"E.P. Gribomont","year":"1989","unstructured":"E.P. Gribomont: Stepwise Refinement and Concurrency: A Small Exercise, in: Mathematics of Program Construction, LNCS 375, Springer-Verlag, pp 219\u2013238, 1989","journal-title":"LNCS"},{"issue":"2","key":"10_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1988-11204","volume":"11","author":"W. Korczy\u0144ski","year":"1988","unstructured":"W. Korczy\u0144ski: An Algebraic Characterization of Concurrent Systems, Fundamenta Informaticae, Vol.11, No. 2, pp 171\u2013194, 1988","journal-title":"Fundamenta Informaticae"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"R. Milner: A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980","DOI":"10.1007\/3-540-10235-3"},{"key":"10_CR19","unstructured":"J. Meseger, U. Montanari: Petri Nets are Monoids, in: Proc. LICS '88, Edinburgh, 1988"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"M. Nielsen, U. Engberg, K.S. Larsen: Fully Abstract Models for a Process Language with Refinement, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer-Verlag, pp 523\u2013548, 1989","DOI":"10.1007\/BFb0013034"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","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":"10_CR22","unstructured":"C.A. Petri: Non-Sequential Processes, Interner Bericht 77-05, GMD, Institut f\u00fcr Informationssystemforschung, 1977"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","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":"10_CR24","unstructured":"W. Reisig: Petri Nets, EATCS Monographs on Theoretical Computer Science 4, Springer-Verlag, 1985"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"W. Reisig: Petri Nets in Software Engineering, in: Petri Nets: Applications and Relationships to other Models of Concurrency, LNCS 255, Springer-Verlag, pp 63\u201396, 1987","DOI":"10.1007\/3-540-17906-2_22"},{"issue":"1","key":"10_CR26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0022-0000(83)90029-6","volume":"27","author":"I. Suzuki","year":"1983","unstructured":"I. Suzuki, T. Murata: A Method for Stepwise Refinement and Abstraction of Petri Nets, Journal of Computer and System Sciences, Vol. 27, No. 1, pp 51\u201376, 1983","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0022-0000(79)90050-3","volume":"18","author":"R. Valette","year":"1979","unstructured":"R. Valette: Analysis of Petri Nets by Stepwise Refinements, Journal of Computer and System Sciences, Vol. 18, pp 35\u201346, 1979","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"W. Vogler: Behaviour Preserving Refinements of Petri Nets, in: Proc. 12th Int. Workshop on Graph Theoretic Concepts in Computer Science, LNCS 246, Springer-Verlag, pp 82\u201393, 1987","DOI":"10.1007\/3-540-17218-1_51"},{"key":"10_CR29","unstructured":"W. Vogler: Failure Semantics Based on Interval Semiwords is a Congruence for Refinement, in Proc. STACS'90, LNCS, Springer-Verlag, to appear"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"G. Winskel: Event Structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255, Springer-Verlag, pp 325\u2013392, 1987","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["Lecture Notes in Computer Science","Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52559-9_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:13:00Z","timestamp":1640920380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52559-9_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525592","9783540470359"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-52559-9_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}