{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:00:35Z","timestamp":1725642035727},"publisher-location":"London","reference-count":20,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199823"},{"type":"electronic","value":"9781447130789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3078-9_15","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T02:47:45Z","timestamp":1323658065000},"page":"220-235","source":"Crossref","is-referenced-by-count":0,"title":["Possible and Guaranteed Concurrency in CSP"],"prefix":"10.1007","author":[{"given":"Marta","family":"Kwiatkowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iain","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Foundations of Software Technology and Theoretical Computer Science, pages 89\u2013108. Springer-Verlag","author":"L Aceto","year":"1991","unstructured":"Luca Aceto and Uffe Engberg. Failure semantics for a simple process language with refinement. In Foundations of Software Technology and Theoretical Computer Science, pages 89\u2013108. Springer-Verlag, 1991."},{"key":"15_CR2","volume-title":"CONCUR 93, volume 715 of Lecture Notes in Computer Science, pages 308\u2013323. Springer- Verlag","author":"JCM Baeten","year":"1993","unstructured":"J.C.M. Baeten and J.A. Bergstra. Non interleaving process algebra. In CONCUR 93, volume 715 of Lecture Notes in Computer Science, pages 308\u2013323. Springer- Verlag, 1993."},{"key":"15_CR3","volume-title":"S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, volume 598 of Lecture Notes in Computer Science. Springer-Verlag","author":"B Bloom","year":"1992","unstructured":"Bard Bloom and Marta Z. Kwiatkowska. Trade-offs in true concurrency: Pom-sets and Mazurkiewicz traces. In S. Brookes, M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, volume 598 of Lecture Notes in Computer Science. Springer-Verlag, 1992."},{"key":"15_CR4","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 411\u2013427. Springer-Verlag","author":"G Boudol","year":"1989","unstructured":"Gerard Boudol and Ilaria 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, volume 354 of Lecture Notes in Computer Science, pages 411\u2013427. Springer-Verlag, 1989."},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31 (3): 560\u2013599, 1984.","journal-title":"Journal of the ACM"},{"key":"15_CR6","volume-title":"Seminar on Concurrency, volume 197 of Lecture Notes in Computer Science, pages 281\u2013305. Springer-Verlag","author":"SD Brookes","year":"1985","unstructured":"S. D. Brookes and A. W. Roscoe. An improved failures model for communicating processes. In Seminar on Concurrency, volume 197 of Lecture Notes in Computer Science, pages 281\u2013305. Springer-Verlag, 1985."},{"key":"15_CR7","volume-title":"Oxford University","author":"S Brookes","year":"1983","unstructured":"Stephen Brookes. A Model for Communicating Sequential Processes. PhD thesis, Oxford University, 1983."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0022-0000(87)90032-8","volume":"34","author":"P Degano","year":"1987","unstructured":"P. Degano and U. Montanari. Concurrent histories: A basis for observing distributed systems. Journal of Computer and System Sciences, 34: 422\u2013461, 1987.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR9","volume-title":"University of Sussex","author":"M Hennessy","year":"1991","unstructured":"M. Hennessy. Concurrent testing of processes. Technical Report 11\/91, University of Sussex, 1991."},{"key":"15_CR10","volume-title":"Prentice-Hall International","author":"CAR Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985."},{"key":"15_CR11","volume-title":"ICA LP92, volume 623 of Lecture Notes in Computer Science. Springer-Verlag","author":"PW Hoogers","year":"1992","unstructured":"P.W. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for petri nets. In ICA LP\u201992, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992."},{"key":"15_CR12","volume-title":"G.L. Burn, S.J. Gay, and M.D. Ryan, editors, Theory and Formal Methods 1993: Proceedings of the First Imperial College, Department of Computing, Workshop on Theory and Formal Methods, Workshops in Computer Science, pages 209\u2013225. Springer-Verlag","author":"MZ Kwiatkowska","year":"1993","unstructured":"Marta Z. Kwiatkowska and Iain C.C. Phillips. Concurrency and conflict in CSP. In G.L. Burn, S.J. Gay, and M.D. Ryan, editors, Theory and Formal Methods 1993: Proceedings of the First Imperial College, Department of Computing, Workshop on Theory and Formal Methods, Workshops in Computer Science, pages 209\u2013225. Springer-Verlag, 1993."},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3233\/FI-1991-14103","volume":"XIV","author":"R Loogen","year":"1991","unstructured":"R. Loogen and U. Goltz. Modelling nondeterministic concurrent processes with event structures. Fundamenta Informaticae, XIV: 39\u201374, 1991.","journal-title":"Fundamenta Informaticae"},{"key":"15_CR14","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 25\u201334. Springer-Verlag","author":"Antoni Mazurkiewicz","year":"1989","unstructured":"Antoni Mazurkiewicz. Basic notions of trace theory. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 25\u201334. Springer-Verlag, 1989."},{"key":"15_CR15","volume-title":"R. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science. Springer- Verlag","author":"M Mukund","year":"1992","unstructured":"M. Mukund and M. Nielsen. CCS, locations and asynchronous transition systems. In R. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science. Springer- Verlag, 1992."},{"key":"15_CR16","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. Winskel, and G. Plotkin. Petri nets, event structures and domains. Theoretical Computer Science, 13: 85\u2013108, 1981.","journal-title":"Theoretical Computer Science"},{"key":"15_CR17","volume-title":"Formal Methods in Programming. North Holland","author":"MW Shields","year":"1985","unstructured":"M.W. Shields. Deterministic asynchronous automata. In Formal Methods in Programming. North Holland, 1985."},{"key":"15_CR18","volume-title":"STACS87, volume 247 of Lecture Notes in Computer Science, pages 348\u2013359. Springer-Verlag","author":"D Taubner","year":"1987","unstructured":"D. Taubner and W. Vogler. The step failures semantics. In STACS\u201987, volume 247 of Lecture Notes in Computer Science, pages 348\u2013359. Springer-Verlag, 1987."},{"key":"15_CR19","volume-title":"Technical Report","author":"F Vaandrager","year":"1989","unstructured":"F. Vaandrager. A simple definition for parallel composition of prime event structures. Technical Report CS-R8903, CWI, 1989."},{"key":"15_CR20","volume-title":"Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 561\u2013567. Springer-Verlag","author":"Glynn Winskel","year":"1982","unstructured":"Glynn Winskel. Event structure semantics for CCS and related languages. In Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 561\u2013567. Springer-Verlag, 1982."}],"container-title":["Workshops in Computing","Structures in Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3078-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,19]],"date-time":"2021-12-19T18:21:53Z","timestamp":1639938113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3078-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199823","9781447130789"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3078-9_15","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}