{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:41Z","timestamp":1725663881932},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539827"},{"type":"electronic","value":"9783540465638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:19:42Z","timestamp":1330190382000},"page":"1-25","source":"Crossref","is-referenced-by-count":9,"title":["Full abstraction for series-parallel pomsets"],"prefix":"10.1007","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"S. Abramsky, Observation Equivalence as a Testing Equivalence, TCS 53, pp. 225\u2013241, 1987","journal-title":"TCS"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"L. Aceto, Full Abstraction for Series-Parallel Pomsets, Computer Science Report 1\/90, University of Sussex, March 1990","DOI":"10.1007\/3-540-53982-4_1"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"L. Aceto and M. Hennessy, Towards Action-refinement in Process Algebras, Proc. 4th LICS, pp. 138\u2013145, IEEE Computer Society Press, 1989 (Full version to appear in Information and Computation)","DOI":"10.1109\/LICS.1989.39168"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"G. Boudol and I. Castellani, Concurrency and Atomicity, TCS 59, pp. 25\u201384, 1988","DOI":"10.1016\/0304-3975(88)90096-5"},{"issue":"3","key":"1_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 and A. W. Roscoe, A Theory of Communicating Sequential Processes, JACM 31,3, pp. 560\u2013599, 1984","journal-title":"JACM"},{"issue":"1","key":"1_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop, Algebra of Communicating Processes with Abstraction, TCS 37, 1, pp. 77\u2013121, 1985","journal-title":"TCS"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"P. Darondeau and P. Degano, Causal Trees, Proc. ICALP 89, LNCS 372, pp. 234\u2013248, Springer-Verlag, 1989","DOI":"10.1007\/BFb0035764"},{"key":"1_CR8","unstructured":"P. Degano, R. De Nicola and U. Montanari, Partial Ordering Semantics for CCS, Technical Report TR-3\/88, Universit\u00e0 di Pisa, 1988"},{"issue":"1","key":"1_CR9","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 and M. Hennessy, Testing Equivalences for Processes, TCS 34,1, pp. 83\u2013134, 1984","journal-title":"TCS"},{"key":"1_CR10","unstructured":"J. L. Gischer, Partial Orders and the Axiomatic Theory of Shuffle, Ph. D. Thesis, Stanford University, 1984"},{"key":"1_CR11","first-page":"237","volume":"379","author":"R. Glabbeek van","year":"1988","unstructured":"R. van Glabbeek and U. Goltz, Equivalence Notions for Concurrent Systems and Refinement of Actions, Proc. 14th MFCS, LNCS 379, pp. 237\u2013248, Springer-Verlag, 1988","journal-title":"LNCS"},{"key":"1_CR12","unstructured":"R. van Glabbeek, The Refinement Theorem for ST-bisimulation, to appear in Proc. IFIP Working Group, Sea of Galilee, 1990."},{"key":"1_CR13","unstructured":"U. Goltz, On Representing CCS Programs by Finite Petri Nets, Arbeitspapiere der GMD 290, February 1988"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"J. Grabowski, On Partial Languages, Fundamenta Informaticae IV.2, pp. 427\u2013498, 1981","DOI":"10.3233\/FI-1981-4210"},{"key":"1_CR15","first-page":"314","volume":"458","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote, A New Strategy for Proving \u03c9-Completeness applied to Process Algebra, Proceedings CONCUR '90, LNCS 458, pp. 314\u2013331, Springer-Verlag, 1990","journal-title":"LNCS"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek and F. Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, Proc. PARLE Conference 1987, LNCS 259, Springer-Verlag, 1987","DOI":"10.1007\/3-540-17945-3_13"},{"issue":"4","key":"1_CR17","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy, Acceptance Trees, JACM 32,4, pp. 896\u2013928, 1985","journal-title":"JACM"},{"key":"1_CR18","unstructured":"M. Hennessy, Algebraic Theory of Processes, MIT Press, 1988"},{"key":"1_CR19","first-page":"173","volume":"354","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy, Observing Processes, Proc. REX Workshop 88, LNCS 354, pp. 173\u2013200, Springer-Verlag, 1988","journal-title":"LNCS"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"M. Hennessy, Axiomatising Finite Concurrent Processes, SIAM Journal on Computing, October 1988","DOI":"10.1137\/0217063"},{"issue":"1","key":"1_CR21","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, JACM 32,1, pp. 137\u2013161, 1985","journal-title":"JACM"},{"key":"1_CR22","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":"1_CR23","doi-asserted-by":"crossref","unstructured":"M. Hennessy and G. Plotkin, Full Abstraction for a Simple Parallel Programming Language, Proc. MFCS, Lecture Notes in Computer Science vol. 74, Springer-Verlag, 1979","DOI":"10.1007\/3-540-09526-8_8"},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01407903","volume":"16","author":"M. Main","year":"1988","unstructured":"M. Main, Trace, Failure and Testing Equivalences for Communicating Systems, International Journal of Parallel Programming 16, pp. 383\u2013401, 1988","journal-title":"International Journal of Parallel Programming"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner, Fully Abstract Models of Typed Lambda-Calculi, TCS 4, pp. 1\u201322, 1977","journal-title":"TCS"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science Vol. 92, Springer-Verlag, 1980","DOI":"10.1007\/3-540-10235-3"},{"key":"1_CR27","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, TCS 25, pp. 267\u2013310, 1983","journal-title":"TCS"},{"key":"1_CR28","unstructured":"R. Milner, Communication and Concurrency, Prentice-Hall, 1989"},{"key":"1_CR29","unstructured":"F. Moller, Axioms for Concurrency, Ph. D. Thesis, University of Edinburgh, 1989"},{"key":"1_CR30","first-page":"523","volume":"354","author":"M. Nielsen","year":"1988","unstructured":"M. Nielsen, U. Engberg and K. S. Larsen, Fully Abstract Models for a Process Language with Refinement, Proc. REX Workshop 88, LNCS 354, pp. 523\u2013548, Springer-Verlag, 1988","journal-title":"LNCS"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science vol. 104, Springer-Verlag, 1981","DOI":"10.1007\/BFb0017309"},{"key":"1_CR32","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"G. Plotkin, LCF Considered as a Programming Language, TCS 5, pp. 223\u2013255, 1977","journal-title":"TCS"},{"key":"1_CR33","unstructured":"G. Plotkin, A Structural Approach to Operational Semantics, Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981"},{"key":"1_CR34","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, pp. 33\u201371, 1986","journal-title":"International Journal of Parallel Programming"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"W. Reisig, Petri Nets, EATCS Monographs on TCS, Springer-Verlag, 1985","DOI":"10.1007\/978-3-642-69968-9"},{"key":"1_CR36","unstructured":"A. Stoughton, Fully Abstract Models of Programming Languages, Research Notes in TCS, Pitman-Wiley, 1988"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"D. Taubner, The Finite Representation of Abstract Programs by Automata and Petri Nets, LNCS 369, Springer-Verlag, 1989","DOI":"10.1007\/3-540-51525-9"},{"key":"1_CR38","unstructured":"S. Tschantz, Languages Under Concatenation and Shuffling, Vanderbilt University Report, 1988"},{"key":"1_CR39","unstructured":"F. Vaandrager, Determinism \u2192 (Event Structure Isomorphism = Step Sequence Equivalence), Report CS-R8839, CWI Amsterdam, October 1988"},{"key":"1_CR40","unstructured":"G. Winskel, Events in Computation, Ph. D. Thesis, University of Edinburgh, 1980"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"G. Winskel, Event Structure Semantics for CCS and Related Languages, Proc. ICALP 82, LNCS, Springer-Verlag, 1982","DOI":"10.1007\/BFb0012800"},{"key":"1_CR42","first-page":"325","volume":"255","author":"G. Winskel","year":"1987","unstructured":"G. Winskel, Event Structures, Advances in Petri Nets 1986, LNCS 255, pp. 325\u2013392, Springer-Verlag, 1987","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T22:33:57Z","timestamp":1640903637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}