{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:24:51Z","timestamp":1648769091327},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"value":"0387973753","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040254","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:01:43Z","timestamp":1155834103000},"page":"53-79","source":"Crossref","is-referenced-by-count":16,"title":["Connections between a concrete and an abstract model of concurrent systems"],"prefix":"10.1007","author":[{"given":"Eugene W.","family":"Stark","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I. J. Aalbersberg","year":"1988","unstructured":"I. J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60(1):1\u201382, 1988.","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","unstructured":"M. Bednarczyk. Categories of Asynchronous Systems. PhD thesis, University of Sussex, October 1987."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/322108.322122","volume":"26","author":"G. Berry","year":"1979","unstructured":"G. Berry and J.-J. L\u00e9vy. Minimal and optimal computations of recursive programs. Journal of the ACM, 26(1):148\u2013175, January 1979.","journal-title":"Journal of the ACM"},{"key":"3_CR4","unstructured":"G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, pages 169\u2013236, Cambridge University Press. 1985."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"XI","author":"G. Boudol","year":"1988","unstructured":"G. Boudol and I. Castellani. A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae, XI:433\u2013452, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"3_CR6","volume-title":"Categorical Combinators, Sequential Algorithms, and Functional Programming. Research Notes in Theoretical Computer Science","author":"P.-L. Curien","year":"1986","unstructured":"P.-L. Curien. Categorical Combinators, Sequential Algorithms, and Functional Programming. Research Notes in Theoretical Computer Science, Pitman, London, 1986."},{"key":"3_CR7","volume-title":"Formal structures for computation and deduction","author":"G. Huet","year":"1986","unstructured":"G. Huet. Formal structures for computation and deduction (first edition). May 1986. Unpublished manuscript. INRIA, France.","edition":"first edition"},{"key":"3_CR8","unstructured":"M. Kwiatkowska. Categories of Asynchronous Systems. PhD thesis, University of Leicester, May 1989."},{"key":"3_CR9","unstructured":"J.-J. L\u00e9vy. R\u00e9ductions Correctes et Optimales dans le Lambda Calcul. PhD thesis, Universit\u00e9 Paris VII, 1978."},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0890-5401(89)90066-7","volume":"82","author":"N. A. Lynch","year":"1989","unstructured":"N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input\/output automata. Information and Computation, 82(1):81\u201392, July 1989.","journal-title":"Information and Computation"},{"key":"3_CR11","unstructured":"A. Mazurkiewicz. Trace theory. In Advanced Course on Petri Nets, GMD, Bad Honnef, September 1986."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"P. Panangaden and E. W. Stark. Computations, residuals, and the power of indeterminacy. In Automata, Languages, and Programming, pages 439\u2013454, Springer-Verlag. Volume 317 of Lecture Notes in Computer Science, 1988.","DOI":"10.1007\/3-540-19488-6_133"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"M. W. Shields. Deterministic asynchronous automata. In Formal Methods in Programming, North-Holland. 1985.","DOI":"10.1007\/3-540-15641-0_26"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"E. W. Stark. Compositional relational semantics for indeterminate dataflow networks. In Category Theory and Computer Science, pages 52\u201374, Springer-Verlag. Volume 389 of Lecture Notes in Computer Science, Manchester, U. K., 1989.","DOI":"10.1007\/BFb0018344"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"E. W. Stark. Concurrent transition system semantics of process networks. In Fourteenth ACM Symposium on Principles of Programming Languages, pages 199\u2013210, January 1987.","DOI":"10.1145\/41625.41643"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","volume":"64","author":"E. W. Stark","year":"1989","unstructured":"E. W. Stark. Concurrent transition systems. Theoretical Computer Science, 64:221\u2013269, 1989.","journal-title":"Theoretical Computer Science"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"E. W. Stark. On the relations computed by a class of concurrent automata. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, January 1990.","DOI":"10.1145\/96709.96743"},{"key":"3_CR18","unstructured":"G. Winskel. Events in Computation. PhD thesis, University of Edinburgh, 1980."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040254.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T13:44:47Z","timestamp":1627739087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387973753"],"references-count":18,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0040254","relation":{}}}