{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:35Z","timestamp":1725456995060},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032032","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"195-208","source":"Crossref","is-referenced-by-count":10,"title":["Concurrency, automata and domains"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I.J. Aalbersberg","year":"1988","unstructured":"I.J. Aalbersberg, G. Rozenberg: Theory of traces, Theoret. Comp. Science 60 (1988), 1\u201382.","journal-title":"Theoret. Comp. Science"},{"key":"16_CR2","unstructured":"M. Bednarczyk: Categories of asynchronous systems, PhD Thesis, University of Sussex, 1987."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-08860-1_7","volume":"62","author":"G. Berry","year":"1978","unstructured":"G. Berry: Stable models of typed \u03bb-calculi, in: 5TH ICALP, Lecture Notes in Computer Science, vol. 62, Springer, 1978, pp. 72\u201389.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","volume":"26","author":"G. Berry","year":"1979","unstructured":"G. Berry, J.-J. L\u00e9vy: Minimal and optimal computations of recursive programs, J. ACM 26 (1979), 148\u2013175.","journal-title":"J. ACM"},{"key":"16_CR5","unstructured":"G. Boudol: Computational semantics of term rewriting, in: Algebraic Methods in Semantics (M. Nivat, J.C. Reynolds, eds.), Cambridge University Press, 1985, pp. 169\u2013236."},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"11","author":"G. Boudol","year":"1988","unstructured":"G. Boudol, I. Castellani: A non-interleaving semantics for CCS based on proved transitions, Fundam. Inform. 11 (1988), 433\u2013452.","journal-title":"Fundam. Inform."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-19020-1_18","volume":"298","author":"T. Coquand","year":"1988","unstructured":"T. Coquand, C. Gunter, G. Winskel: DI-domains as a model of polymorphism, in: Mathematical Foundations of Programming Language Semantics (M. Main, A. Melton, M. Mislove, D. Schmidt, eds), Lecture Notes in Computer Science, vol 298, Springer, 1988, pp. 344\u2013363.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR8","series-title":"Research Notes in Theoretical Computer Science","volume-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","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":"16_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(89)90117-5","volume":"68","author":"M. Droste","year":"1989","unstructured":"M. Droste: Event structures and domains, Theoret. Comp. Science 68 (1989), 37\u201347.","journal-title":"Theoret. Comp. Science"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0890-5401(89)90065-5","volume":"82","author":"M. Droste","year":"1989","unstructured":"M. Droste: Recursive domain equations for concrete data structures, Information and computation 82 (1989), 65\u201380.","journal-title":"Information and computation"},{"key":"16_CR11","unstructured":"M. Droste: Concurrent automata and dI-domains, to appear."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"M. Droste, R. G\u00f6bel: Universal domains in the theory of denotational semantics of programming languages, Proc. IEEE Symposium on\u2019 Logic in Computer Science', Philadelphia, 1990, to appear.","DOI":"10.1109\/LICS.1990.113730"},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"C.A.R. Hoare: Communicating sequential processes, Comm. ACM 21 (1978), 666\u2013676.","journal-title":"Comm. ACM"},{"key":"16_CR14","unstructured":"G. Huet, J.-J. L\u00e9vy: Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979)."},{"key":"16_CR15","unstructured":"G. Kahn, G. Plotkin: Domaines concretes, IRIA-LABORIA Report 336, Paris (1978)."},{"key":"16_CR16","unstructured":"J.-J. L\u00e9vy: Optimal reductions in the lambda calculus, in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin, J.R. Hindley, eds.), Academic Press, 1980, pp. 159\u2013191."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"R. Milner: A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/3-540-19488-6_133","volume":"317","author":"P. Panangaden","year":"1988","unstructured":"P. Panangaden, E.W. Stark: Computations, residuals and the power of indeterminacy, in: 15th ICALP, 1988, Lecture Notes in Computer Science, vol 317, Springer, 1988, pp. 439\u2013454.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BFb0012801","volume":"140","author":"D. Scott","year":"1982","unstructured":"D. Scott: Domains for denotational domains, in: 9th ICALP, Lecture Notes in Computer Science, vol. 140, Springer, 1982, pp. 577\u2013613.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR20","doi-asserted-by":"crossref","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, Theoret. Comp. Science 64 (1989), 221\u2013269.","journal-title":"Theoret. Comp. Science"},{"key":"16_CR21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0018344","volume":"389","author":"E.W. Stark","year":"1989","unstructured":"E.W. Stark: Compositional relational semantics for indeterminate dataflow networks, in: Proc., Category Theory and Computer Science, Lecture Notes in Computer Science, vol. 389, Springer, 1989, pp. 52\u201374.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR22","unstructured":"E.W. Stark: Connections between a concrete and an abstract model of concurrent systems, in: 5th Conf. on the Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Springer, 1989, to appear."},{"key":"16_CR23","volume-title":"Denotational Semantics: The Scott-Strachy Approach to Programming Languages","author":"J. Stoy","year":"1977","unstructured":"J. Stoy: Denotational Semantics: The Scott-Strachy Approach to Programming Languages, MIT Press, Cambridge, Mass., 1977."},{"key":"16_CR24","unstructured":"G. Winskel: Events in Computation, PhD Thesis, Edinburgh, 1981."},{"key":"16_CR25","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume":"255","author":"G. Winskel","year":"1987","unstructured":"G. Winskel: Event structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency (W. Brauer, W. Reisig, G. Rozenberg, eds.), Lecture Notes in Computer Science, vol. 255, Springer, 1987, pp. 325\u2013392.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"G. Zhang: DI-domains as information systems, in: 16th ICALP, Springer, 1989, to app.","DOI":"10.1007\/BFb0035798"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032032.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T07:29:18Z","timestamp":1626852558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0032032","relation":{},"subject":[]}}