{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:45:44Z","timestamp":1778298344064,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613770","type":"print"},{"value":"9783540685074","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:35:54Z","timestamp":1330274154000},"page":"233-251","source":"Crossref","is-referenced-by-count":9,"title":["Languages and logical definability in concurrency monoids"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietrich","family":"Kuske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_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":"Aalbersberg, I.J. and G. Rozenberg: Theory of traces. Theor. Comp. Science 60 (1988), 1\u201382.","journal-title":"Theor. Comp. Science"},{"key":"14_CR2","unstructured":"Bednarczyk, M.: Categories of asynchronous systems. Ph.D. thesis, University of Sussex, 1987."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-08860-1_7","volume":"62","author":"G. Berry","year":"1978","unstructured":"Berry, G.: Stable models of typed \u03bb-calculi. In: 5th ICALP, Lect. Notes in Comp. Science vol. 62, Springer, 72\u201389, 1978.","journal-title":"5th ICALP, Lect. Notes in Comp. Science"},{"key":"14_CR4","first-page":"89","volume-title":"Semantics of Programming Languages and Model Theory","author":"P. Boldi","year":"1993","unstructured":"Boldi, P., F. Cardone 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 Science Publ., OPA Amsterdam, 1993, pp. 89\u2013108."},{"key":"14_CR5","unstructured":"B\u00f6rger, E. and D. Rosenzweig: Occam: Specification and compiler correctness. Part I: Simple mathematical interpreters. To appear."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/3-540-56939-1_111","volume":"700","author":"F. Bracho","year":"1993","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.","journal-title":"20th ICALP, Lecture Notes in Computer Science"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(94)00030-1","volume":"135","author":"F. Bracho","year":"1994","unstructured":"Bracho, F. and M. Droste: Labelled domains and automata with concurrency. Theor. Comp. Science 135 (1994), 289\u2013318.","journal-title":"Theor. Comp. Science"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bracho, F., M. Droste and D. Kuske: Dependence orders for computations of concurrent automata. In: STACS'95, Lecture Notes in Computer Science vol. 900, Springer 1995, 467\u2013678.","DOI":"10.1007\/3-540-59042-0_97"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Bracho, F., M. Droste and D. Kuske: Representation of computations in concurrent automata by dependence orders. Theor. Comp. Science, 1996, to appear.","DOI":"10.1007\/3-540-59042-0_97"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6 (1960), 66\u201392.","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"14_CR11","volume-title":"Progress in Theoretical Computer Science","author":"P.L. Curien","year":"1993","unstructured":"Curien, P.L.: Categorical Combinators, Sequential Algorithms and Functional Programming. Progress in Theoretical Computer Science, Birkh\u00e4user, Boston, 1993."},{"key":"14_CR12","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_CR13","unstructured":"V. Diekert and Y. M\u00e9tivier: Partial commutation and traces. In: G. Rozenberg and A. Salomaa: Handbook on Formal Languages vol. 3, Springer, to appear, 1996."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Diekert, V. and G. Rozenberg: The Book of Traces. World Scientific Publ. Co., 1995.","DOI":"10.1142\/2563"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BFb0032032","volume":"443","author":"M. Droste","year":"1990","unstructured":"Droste, M.: Concurrency, automata and domains. In: 17th ICALP, Lecture Notes in Computer Science vol. 443, Springer, 1990, pp. 195\u2013208.","journal-title":"17th ICALP, Lecture Notes in Computer Science"},{"key":"14_CR16","doi-asserted-by":"crossref","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_CR17","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58201-0_84","volume":"820","author":"M. Droste","year":"1994","unstructured":"Droste, M.: A Kleene theorem for recognizable languages over concurrency monoids. In: 21st ICALP, Lecture Notes in Computer Science vol. 820, Springer 1994, pp. 388\u2013399. Full version: Recognizable languages in concurrency monoids, Theor. Comp. Science 150 (1996), pp. 77\u2013109.","journal-title":"21st ICALP, Lecture Notes in Computer Science"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Droste, M.: Aperiodic languages over concurrency monoids. Information and Computation, 1996, to appear.","DOI":"10.1006\/inco.1996.0039"},{"key":"14_CR19","volume-title":"Technical report","author":"M. Droste","year":"1995","unstructured":"Droste, M. and D. Kuske: Recognizable and logically definable languages of infinite computations in concurrency monoids. Technical report, Inst, f\u00fcr Algebra, TU Dresden, 1995, submitted."},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-56939-1_84","volume":"700","author":"W. Ebinger","year":"1993","unstructured":"Ebinger, W. and A. Muscholl: Logical definability on infinite traces. In: 20th ICALP, Lecture Notes in Computer Science vol. 700, Springer, 1993, pp. 335\u2013346.","journal-title":"20th ICALP, Lecture Notes in Computer Science"},{"key":"14_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(92)90080-Y","volume":"97","author":"G. Guaiana","year":"1992","unstructured":"Guaiana, G., A. Restivo and S. Salemi: Star-free trace languages. Theor. Comp. Science 97 (1992), 301\u2013311.","journal-title":"Theor. Comp. Science"},{"key":"14_CR22","unstructured":"Kuske, D.: Modelle nebenl\u00e4ufiger Prozesse \u2014 Monoide, Residuensysteme und Automaten. Dissertation, Universit\u00e4t GH Essen, 1994."},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BFb0017483","volume":"787","author":"D. Kuske","year":"1994","unstructured":"Kuske, D.: Nondeterministic automata with concurrency relations. Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science vol. 787, Springer, 1994, 202\u2013217.","journal-title":"Colloquium on Trees in Algebra and Programming, Lecture Notes in Computer Science"},{"key":"14_CR24","volume-title":"DAIMI Report PB-78","author":"A. Mazurkiewicz","year":"1977","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. DAIMI Report PB-78, Aarhus University, Aarhus, 1977."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Trace theory. In: Advanced Course on Petri Nets, Lecture Notes in Computer Science, Springer, 1986, pp. 279\u2013324.","DOI":"10.1007\/3-540-17906-2_30"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Basic notions of trace theory. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J.W. de Bakker, W.-P. de Roever, G. Rozenberg), Lecture Notes in Computer Science vol. 354, Springer, 1988, pp. 285\u2013363.","DOI":"10.1007\/BFb0013025"},{"key":"14_CR27","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"McNaughton, R. and S. Papert: Counter-free Automata. MIT-Press, Cambridge, USA, 1971."},{"key":"14_CR28","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"Ochmanski, E.: 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":"14_CR29","unstructured":"Panangaden, P., V. Shanbhogue and E.W. Stark: Stability and sequentiability in dataflow networks. In: 17th ICALP, Lecture Notes in Computer Science vol. 443, Springer, 1990, pp. 308\u2013321."},{"key":"14_CR30","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"M.W. Shields","year":"1985","unstructured":"Shields, M.W.: Concurrent machines. Computer Journal 28 (1985), 449\u2013465.","journal-title":"Computer Journal"},{"key":"14_CR31","first-page":"52","volume":"389","author":"B.W. Stark","year":"1989","unstructured":"Stark, B.W.: Connections between a concrete and an abstract model of concurrent systems. In: Proceedings of the 5th Conf. on the Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science vol. 389, Springer, 1989, pp. 52\u201374.","journal-title":"Proceedings of the 5th Conf. on the Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science"},{"key":"14_CR32","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0018344","volume":"389","author":"E.W. Stark","year":"1989","unstructured":"Stark, E.W.: 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":"Proc. Category Theory and Computer Science, Lecture Notes in Computer Science"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Eisevier Science Publ. B.V., 1990, pp. 133\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"14_CR34","first-page":"172","volume-title":"Report TUM-I9002","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: On logical definability of trace languages. In: Proc. of the workshop Algebraic Methods in Computer Science, Kochel am See, FRG (1989) (V. Diekert, ed.). Report TUM-I9002, TU Munich, 1990, pp. 172\u2013182."},{"key":"14_CR35","unstructured":"Winskel, G. and M. Nielsen: Models for concurrency. In: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:05:50Z","timestamp":1605629150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}