{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:38Z","timestamp":1725663878147},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:10:32Z","timestamp":1330258232000},"page":"68-82","source":"Crossref","is-referenced-by-count":3,"title":["Complex and complex-like traces"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"4_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 and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1\u201382, 1988.","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","unstructured":"P. Bonizzoni, G. Mauri, and G. Pighizzini. About infinite traces. In V. Diekert, editor, Proceedings of the ASMICS workshop Free Partially Commutative Monoids, Kochel am See, Oktober 1989, Report TUM-I9002, Technical University of Munich, pages 1\u201310, 1990."},{"key":"4_CR3","volume-title":"Number 454 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990."},{"key":"4_CR4","first-page":"105","volume-title":"number 480 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1991","unstructured":"V. Diekert. On the concatenation of infinite traces. In Choffrut C. et al., editors, Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991, number 480 in Lecture Notes in Computer Science, pages 105\u2013117, Berlin-Heidelberg-New York, 1991. Springer. To appear 1993 in Theoret. Comput. Sci."},{"key":"4_CR5","first-page":"131","volume-title":"number 520 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1991","unstructured":"V. Diekert, P. Gastin, and A. Petit. Recognizable complex trace languages. In A. Tarlecki, editor, Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science (MFCS'91), Kazimierz Dolny (Poland) 1991, number 520 in Lecture Notes in Computer Science, pages 131\u2013140, Berlin-Heidelberg-New York, 1991. Springer. Full version: Rapport de Recherche 640 (1991), Universit\u00e9 de Paris Sud."},{"key":"4_CR6","first-page":"617","volume-title":"number 665 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1993","unstructured":"V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS'93), W\u00fcrzburg 1993, number 665 in Lecture Notes in Computer Science, pages 617\u2013628, Berlin-Heidelberg-New York, 1993. Springer."},{"key":"4_CR7","unstructured":"V. Diekert and G. Rozenberg, editors. Trace Book (preliminary title). 1993. To appear."},{"key":"4_CR8","series-title":"number TUM-I9002","volume-title":"Free Partially Commutative Monoids","year":"1990","unstructured":"V. Diekert, editor, editor. Free Partially Commutative Monoids. Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See, Bavaria, FRG (1989), number TUM-I9002. Technical University Munich, 1990."},{"key":"4_CR9","volume-title":"Lecture Notes in Computer Science","author":"W. Ebinger","year":"1993","unstructured":"Werner Ebinger and Anca Muscholl. On logical definability of \u03c9-trace languages. In Proceedings of the 20th International Colloquium on Automata Languages and Programming (ICALP'93), Lund (Sweden) 1993, Lecture Notes in Computer Science, Berlin-Heidelberg-New York, 1993. Springer. To appear."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","volume":"38","author":"M. P. Fl\u00e9","year":"1985","unstructured":"M.P. Fl\u00e9 and G. Roucairol. Maximal serializability of iterated transactions. Theoretical Computer Science, 38:1\u201316, 1985.","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","first-page":"277","volume-title":"number 469 in Lecture Notes in Computer Science","author":"P. Gastin","year":"1990","unstructured":"P. Gastin. Infinite traces. In I. Guessarian, editor, Proceedings of the Spring School of Theoretical Computer Science on Semantics of Systems of Concurrent Processes, number 469 in Lecture Notes in Computer Science, pages 277\u2013308, Berlin-Heidelberg-New York, 1990. Springer."},{"key":"4_CR12","first-page":"254","volume-title":"number 510 in Lecture Notes in Computer Science","author":"P. Gastin","year":"1991","unstructured":"P. Gastin, A. Petit, and W. Zielonka. A Kleene theorem for infinite trace languages. In J. Leach Albert et al., editors, Proceedings of the 18th International Colloquium on Automata Languages and Programming (ICALP'91), Madrid (Spain) 1991, number 510 in Lecture Notes in Computer Science, pages 254\u2013266, Berlin-Heidelberg-New York, 1991. Springer."},{"key":"4_CR13","volume-title":"Tech. Rep. LITP 91.07","author":"P. Gastin","year":"1991","unstructured":"P. Gastin and B. Rozoy. The poset of infinitary traces. Tech. Rep. LITP 91.07, Universit\u00e9 Paris 6 (France), 1991. To appear in Theoret. Comp. Sci."},{"key":"4_CR14","first-page":"583","volume-title":"number 623 in Lecture Notes in Computer Science","author":"P. Gastin","year":"1992","unstructured":"Paul Gastin and Antoine Petit. Asynchronous automata for infinite traces. In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata Languages and Programming (ICALP'92), Vienna (Austria) 1992, number 623 in Lecture Notes in Computer Science, pages 583\u2013594, Berlin-Heidelberg-New York, 1992. Springer."},{"key":"4_CR15","first-page":"255","volume-title":"number 629 in Lecture Notes in Computer Science","author":"P. Gastin","year":"1992","unstructured":"Paul Gastin and Antoine Petit. Poset properties of complex traces. In I. M. Havel and V. Koubek, editors, Proceedings of the 17th Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, (Czechoslovakia), 1992, number 629 in Lecture Notes in Computer Science, pages 255\u2013263, Berlin-Heidelberg-New York, 1992. Springer."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(90)90061-2","volume":"35","author":"M. Kwiatkowska","year":"1990","unstructured":"M. Kwiatkowska. A metric for traces. Information Processing Letters, 35:129\u2013135, 1990.","journal-title":"Information Processing Letters"},{"key":"4_CR17","volume-title":"DAIMI Rep. PB 78","author":"A. Mazurkiewicz","year":"1977","unstructured":"A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977."},{"key":"4_CR18","series-title":"number 255 in Lecture Notes in Computer Science","first-page":"279","volume-title":"Petri Nets, Applications and Relationship to other Models of Concurrency","author":"A. Mazurkiewicz","year":"1987","unstructured":"A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, number 255 in Lecture Notes in Computer Science, pages 279\u2013324, Berlin-Heidelberg-New York, 1987. Springer."},{"key":"4_CR19","first-page":"254","volume-title":"number 226 in Lecture Notes in Computer Science","author":"Y. M\u00e9tivier","year":"1986","unstructured":"Y. M\u00e9tivier. On recognizable subsets of free partially commutative monoids. In L. Kott, editor, Proceedings of the 13th International Colloquium on Automata Languages and Programming (ICALP'86), Rennes (France) 1986, number 226 in Lecture Notes in Computer Science, pages 254\u2013264, Berlin-Heidelberg-New York, 1986. Springer."},{"key":"4_CR20","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"E. Ochmanski. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56\u201367, Oct 1985.","journal-title":"Bulletin of the European Association for Theoretical Computer Science (EATCS)"},{"key":"4_CR21","first-page":"637","volume-title":"number 372 in Lecture Notes in Computer Science","author":"D. Perrin","year":"1989","unstructured":"D. Perrin. Partial commutations. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), Stresa (Italy) 1989, number 372 in Lecture Notes in Computer Science, pages 637\u2013651, Berlin-Heidelberg-New York, 1989. Springer."},{"key":"4_CR22","volume-title":"Tech. Rep. LITP 91.06","author":"D. Perrin","year":"1991","unstructured":"D. Perrin and J.E. Pin. Mots Infinis. Tech. Rep. LITP 91.06, Universit\u00e9 Paris 6 (France), 1991. Book to appear."},{"key":"4_CR23","unstructured":"Dan Teodosiu. Bereichseigenschaften komplexer Spuren. Diplomarbeit, Universit\u00e4t Stuttgart, 1993."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133\u2013191. Elsevier Science Publishers B. V., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"4_CR25","first-page":"172","volume-title":"Report TUM-I9002","author":"W. Thomas","year":"1990","unstructured":"Wolfgang Thomas. On logical definability of trace languages. In V. Diekert, editor, Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See, Bavaria, FRG (1989), Report TUM-I9002, Technical University of Munich, pages 172\u2013182, 1990."},{"key":"4_CR26","first-page":"321","volume-title":"number 1234 in Lecture Notes in Mathematics","author":"X. G. Viennot","year":"1986","unstructured":"X.G. Viennot. Heaps of pieces I: Basic definitions and combinatorial lemmas. In G. Labelle et al., editors, Proceedings Combinatoire \u00e9numerative, Montreal, Quebec (Canada) 1985, number 1234 in Lecture Notes in Mathematics, pages 321\u2013350, Berlin-Heidelberg-New York, 1986. Springer."},{"key":"4_CR27","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications, 21:99\u2013135, 1987.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:41Z","timestamp":1605647321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}