{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:54:35Z","timestamp":1794336875765,"version":"4.9.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"value":"354057879X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017483","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:47:11Z","timestamp":1132627631000},"page":"202-217","source":"Crossref","is-referenced-by-count":9,"title":["Nondeterministic automata with concurrency relations and domains"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"89","volume-title":"Semantics of Programming Languages and Model Theory","author":"P. Boldi","year":"1993","unstructured":"Boldi, P., F. Carbone and N. Sabadini: Concurrent automata, prime event structures and universal domains, In: Semantics of Programming Languages and Model Theory, (M. Droste, Y. Gurevich, eds.), Gordon and Breach Publ., OPA Amsterdam, 1993, pp. 89\u2013108."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bracho, F. and M. Droste: From domains to automata with concurrency. In: 20th ICALP, Lecture Notes in Computer Science vol. 700, Springer, 1993, pp. 669\u2013681.","DOI":"10.1007\/3-540-56939-1_111"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bracho, F. and M. Droste: Labelled domains and automata with concurrency. To appear in Theoretical Computer Science, 1994.","DOI":"10.1016\/0304-3975(94)00030-1"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Berry, G.: Stable models of typed \u03bb-calculi. In: 5th ICALP, Lecture Notes in Computer Science vol. 62, Springer, 1978, pp. 72\u201389.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Coquand, T.: Categories of embeddings. In: 3rd Annual Symposium on Logic in Computer Science (Y. Gurevich, ed.), IEEE Computer Society, 1988.","DOI":"10.1109\/LICS.1988.5124"},{"key":"14_CR6","volume-title":"Research Notes in Theoretical Computer Science","author":"P.L. Curien","year":"1986","unstructured":"Curien, P.L.: Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science, Pitman, London, 1986."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Diekert, V.: Combinatorics on Traces. Lecture Notes in Computer Science vol. 454, Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Droste, M.: Concurrency, Automata and Domains. In: 17th ICALP, Lecture Notes in Computer Science vol. 443, Springer, 1990, pp. 195\u2013208.","DOI":"10.1007\/BFb0032032"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1142\/S0129054192000218","volume":"3","author":"M. Droste","year":"1992","unstructured":"Droste, M.: Concurrent Automata and Domains. Intern. J. of Found. of Comp. Science 3 (1992), 389\u2013418.","journal-title":"Intern. J. of Found. of Comp. Science"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Droste, M.: A Kleene theorem for recognizable languages over concurrency monoids. 1993.","DOI":"10.1007\/3-540-58201-0_84"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Birkh\u00e4user, 1978.","DOI":"10.1007\/978-3-0348-7633-9"},{"key":"14_CR12","volume-title":"PhD-Thesis","author":"C. Gunter","year":"1985","unstructured":"Gunter, C.: Profinite Solutions for Recursive Domain Equations. PhD-Thesis, Univ. of Wisconsin, Madison, 1985."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Gunter, C. and A. Jung: Coherence and consistency in domains. In: 3rd Annual Symposium on Logic in Computer Science (Y. Gurevich, ed.), IEEE Computer Society, 1988, pp. 309\u2013317.","DOI":"10.1109\/LICS.1988.5129"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"Hoare, C.A.R.: Communicating sequential Processes. Commun. ACM 21 (1978), 666\u2013676.","journal-title":"Commun. ACM"},{"key":"14_CR15","unstructured":"Jung, A.: Cartesian Closed Categories of Domains. Dissertation, TH Darmstadt, 1988."},{"key":"14_CR16","unstructured":"Kuske, D.: Modelle nebenl\u00e4ufiger Prozesse \u2014 Monoide, Residuensysteme und Automaten. Dissertation, Universit\u00e4t GHS Essen, 1994."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Milner, R.: Calculus of Communicating Processes. Lecture Notes in Computer Science vol. 92, Springer, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Nielsen, M. and G. Winskel: Models for concurrency. In: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), preliminary version, October 1991.","DOI":"10.1007\/3-540-54345-7_47"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Panangaden, P. and E.W. Stark: Computations, residuals and the power of indeterminacy. In: Automata, Languages and Programming, Lecture Notes in Computer Science vol. 317, Springer 1988, pp. 439\u2013454.","DOI":"10.1007\/3-540-19488-6_133"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Perrin, D.: Finite automata. In: Handbook of Theoretical Computer Science: Formal Models and Semantics, vol. B (J. van Leeuwen, ed.), Elsevier, 1990, pp. 1\u201357.","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"14_CR21","unstructured":"Stark, E.W.: Connections between a concrete and an abstract model of concurrent systems. In: Proceedings of the 5th Conf. on the Mathematical Foundations of Programming Sematics, Lecture Notes in Computer Science vol. 389, Springer, 1989, pp. 52\u201374."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Winskel, G.: 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, 1987, pp. 325\u2013392.","DOI":"10.1007\/3-540-17906-2_31"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, G.Q.: DI-domains as information systems. In: 16th ICALP, Lecture Notes in Computer Science vol. 372, Springer, 1989, pp. 773\u2013788.","DOI":"10.1007\/BFb0035798"}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0017483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:56:00Z","timestamp":1586559360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057879X"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0017483","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0017469","asserted-by":"object"}]},"subject":[]}}