{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:25Z","timestamp":1725664045260},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582014"},{"type":"electronic","value":"9783540485667"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_84","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:32:31Z","timestamp":1330270351000},"page":"388-399","source":"Crossref","is-referenced-by-count":4,"title":["A kleene theorem for recognizable languages over concurrency monoids"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"32_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":"32_CR2","first-page":"243","volume":"22","author":"P. Bachmann","year":"1986","unstructured":"P. Bachmann, Phan Minh Dung: Nondeterministic computations \u2014 structure and axioms, Elektron. Inf.verarb. Kybern. EIK 22 (1986), 243\u2013261.","journal-title":"Elektron. Inf.verarb. Kybern. EIK"},{"key":"32_CR3","unstructured":"M. Bednarczyk: Categories of asynchronous systems, PhD Thesis, University of Sussex, 1987."},{"key":"32_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. Levy: Minimal and optimal computations of recursive programs, J. ACM 26 (1979), 148\u2013175.","journal-title":"J. ACM"},{"key":"32_CR5","unstructured":"E. B\u00f6rger, D. Rosenzweig: Occam: Specification and compiler correctness. Part I: Simple mathematical interpreters, to appear."},{"key":"32_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":"32_CR7","doi-asserted-by":"crossref","unstructured":"F. Bracho, 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":"32_CR8","doi-asserted-by":"crossref","unstructured":"F. Bracho, M. Droste: Labelled domains and automata with concurrency, Theoret. Comp. Science, to appear.","DOI":"10.1016\/0304-3975(94)00030-1"},{"key":"32_CR9","first-page":"1","volume-title":"Proc. Intern. Congress on Logic, Methodology and Philosophy of Science","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J.R. B\u00fcchi: On a decision method in restricted second order arithmetics, in: Proc. Intern. Congress on Logic, Methodology and Philosophy of Science (E. Nagel et al., eds.), Stanford University Press, Stanford, 1960, pp. 1\u201311."},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(85)90013-1","volume":"35","author":"R. Cori","year":"1985","unstructured":"R. Cori, Y. M\u00e9tivier: Recognizable subsets of some partially abelian monoids, Theoret. Comp. Science 35 (1985), 241\u2013254.","journal-title":"Theoret. Comp. Science"},{"key":"32_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. Cori, D. Perrin: Automates et commutations partielles, R.A.I.R.O. Informatique Th\u00e9orique et Applications 19 (1985), 21\u201332.","journal-title":"R.A.I.R.O. Informatique Th\u00e9orique et Applications"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"V. Diekert: \u201dCombinatorics on Traces\u201d, Lecture Notes in Computer Science, vol. 454, Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"M. Droste: Concurrency, automata and domains, in: 17th ICALP, Lecture Notes in Computer Science, vol. 443, Springer, 1990, pp. 195\u2013208.","DOI":"10.1007\/BFb0032032"},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1142\/S0129054192000218","volume":"3","author":"M. Droste","year":"1992","unstructured":"M. Droste: Concurrent automata and domains, Intern. J. of Foundations of Comp. Science 3 (1992), 389\u2013418.","journal-title":"Intern. J. of Foundations of Comp. Science"},{"key":"32_CR15","unstructured":"M. Droste: Recognizable languages over concurrency monoids, to appear."},{"key":"32_CR16","first-page":"69","volume-title":"Semantics of Programming Languages and Model Theory","author":"M. Droste","year":"1993","unstructured":"M. Droste, R.M. Shortt: Petri nets and automata with concurrency relations \u2014 an adjunction, in: \u201dSemantics of Programming Languages and Model Theory\u201d (M. Droste, Y. Gurevich, eds.), Gondon and Breach Science Publ., Reading, 1993, pp. 69\u201387."},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(92)90080-Y","volume":"97","author":"G. Guaiana","year":"1992","unstructured":"G. Guaiana, A. Restivo, S. Salemi: Star-free trace languages, Theoret. Comp. Science 97 (1992), 301\u2013311.","journal-title":"Theoret. Comp. Science"},{"key":"32_CR18","unstructured":"G. Huet, J.-J. Levy: Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979)."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"S. Katz, D. Peled: Defining conditional independence using collapses, in: \u201dSemantics for Concurrency\u201d (M.Z. Kwiatkowska, M.W. Shields, R.M. Thomas, eds.), Proc. of the Int. BCS-FACS Workshop at Leicester, 1990, Springer, pp. 262\u2013280.","DOI":"10.1007\/978-1-4471-3860-0_16"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"D. Kuske: Nondeterministic automata with concurrency relations, in: Colloquium on Trees in Algebra and Programming 1994, Lecture Notes in Computer Science, Springer, 1994, to appear.","DOI":"10.1007\/BFb0017483"},{"key":"32_CR21","first-page":"159","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J.-J. Levy","year":"1980","unstructured":"J.-J. Levy: Optimal reductions in the lambda calculus, in: \u201dTo H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism\u201d (J.P. Seldin, J.R. Hindley, eds.), Academic Press, New York, 1980, pp. 159\u2013191."},{"key":"32_CR22","volume-title":"DAIMI Report PB-78","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz: Concurrent program schemes and their interpretations, DAIMI Report PB-78, Aarhus University, Aarhus, 1977."},{"key":"32_CR23","first-page":"121","volume":"20","author":"Y. M\u00e9tivier","year":"1986","unstructured":"Y. M\u00e9tivier: Une condition suffisante de reconnaissabilit\u00e9 dans un monoide partiellement commutatif, R.A.I.R.O.-Informatique Th\u00e9orique et Applications 20 (1986), 121\u2013127.","journal-title":"R.A.I.R.O.-Informatique Th\u00e9orique et Applications"},{"key":"32_CR24","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"E. Ochmanski: Regular behaviour of concurrent systems, Bull. Europ. Assoc. for Theoret. Comp. Science 27 (1985), 56\u201367.","journal-title":"Bull. Europ. Assoc. for Theoret. Comp. Science"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"P. Panangaden, E.W. Stark: Computations, residuals and the power of indeterminacy, in: 15th ICALP, Lecture Notes in Computer Science, vol. 317, Springer, 1988, pp. 439\u2013454.","DOI":"10.1007\/3-540-19488-6_133"},{"key":"32_CR26","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"M.O. Rabin: Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1\u201335.","journal-title":"Trans. Amer. Math. Soc."},{"key":"32_CR27","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. P. Sch\u00fctzenberger","year":"1961","unstructured":"M.P. Sch\u00fctzenberger: On the definition of a family of automata, Inf. Control 4 (1961), 245\u2013270.","journal-title":"Inf. Control"},{"key":"32_CR28","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"M. W. Shields","year":"1985","unstructured":"M.W. Shields: Concurrent machines, Comp. J. 28 (1985), 449\u2013465.","journal-title":"Comp. J."},{"key":"32_CR29","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":"32_CR30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BFb0040254","volume":"442","author":"E. W. Stark","year":"1989","unstructured":"E.W. Stark: Connections between a concrete and an abstract model of concurrent systems, in: 5th Conference on the Mathem. Foundations of Programming Semantics, Lecture Notes in Computer Science, vol. 442, 1989, pp. 53\u201379.","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR31","doi-asserted-by":"crossref","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.","DOI":"10.1007\/BFb0018344"},{"key":"32_CR32","unstructured":"G. Winskel, M. Nielsen: \u201dModels for Concurrency\u201d, draft copy of Oct. 1991, in: \u201dHandbook of Logic in Computer Science\u201d (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear."},{"key":"32_CR33","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka: Notes on finite asynchronous automata, R.A.I.R.O.Informatique Th\u00e9orique et Applications 21 (1987), 99\u2013135.","journal-title":"R.A.I.R.O.Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:30:43Z","timestamp":1640932243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}