{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:46Z","timestamp":1725491446592},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_1","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"1-19","source":"Crossref","is-referenced-by-count":3,"title":["On First-Order Fragments for Words and Mazurkiewicz Traces"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Kufleitner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Mathematics","volume-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements.","year":"1969","unstructured":"Cartier, P., Foata, D. (eds.): Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Lecture Notes in Mathematics, vol.\u00a085. Springer, Heidelberg (1969)"},{"issue":"1-3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0304-3975(03)00344-X","volume":"310","author":"J. Chalopin","year":"2004","unstructured":"Chalopin, J., Leung, H.: On factorization forests of finite height. Theoretical Computer Science\u00a0310(1-3), 489\u2013499 (2004)","journal-title":"Theoretical Computer Science"},{"key":"1_CR3","unstructured":"Colcombet, T.: On Factorization Forests. Technical report, number hal-00125047, Irisa, Rennes (2007)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1006\/jcss.2001.1817","volume":"64","author":"V. Diekert","year":"2002","unstructured":"Diekert, V., Gastin, P.: LTL is expressively complete for Mazurkiewicz traces. Journal of Computer and System Sciences\u00a064, 396\u2013418 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1016\/j.ic.2006.07.002","volume":"204","author":"V. Diekert","year":"2006","unstructured":"Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz trace. Information and Computation\u00a0204, 1597\u20131619 (2006)","journal-title":"Information and Computation"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Diekert, V., Horsch, M., Kufleitner, M.: On first-order fragments for Mazurkiewicz traces. In: Fundamenta Informaticae (to appear)","DOI":"10.1007\/978-3-540-73208-2_1"},{"volume-title":"The Book of Traces","year":"1995","key":"1_CR7","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(95)00130-1","volume":"154","author":"W. Ebinger","year":"1996","unstructured":"Ebinger, W., Muscholl, A.: Logical definability on infinite traces. Theoretical Computer Science\u00a0154, 67\u201384 (1996)","journal-title":"Theoretical Computer Science"},{"key":"1_CR9","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0B. Academic Press, New York and London (1976)"},{"key":"1_CR10","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, ch. 16, pp. 995\u20131072. Elsevier Science Publisher B.V, Amsterdam (1990)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K. Etessami","year":"2002","unstructured":"Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Information and Computation\u00a0179(2), 279\u2013295 (2002)","journal-title":"Information and Computation"},{"key":"1_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic: Mathematical Foundations and Computational Aspects","author":"D. Gabbay","year":"1994","unstructured":"Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects. Clarendon Press, Oxford (1994)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Gastin","year":"2003","unstructured":"Gastin, P., Kuske, D.: Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, Springer, Heidelberg (2003)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Beyond Words, vol.\u00a03, Springer, Berlin Heidelberg (1997)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(92)90080-Y","volume":"97","author":"G. Guaiana","year":"1992","unstructured":"Guaiana, G., Restivo, A., Salemi, S.: Star-free trace languages. Theoretical Computer Science\u00a097, 301\u2013311 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"1_CR16","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","volume":"20","author":"R.M. Keller","year":"1973","unstructured":"Keller, R.M.: Parallel program schemata and maximal parallelism I. Fundamental results. Journal of the Association for Computing Machinery\u00a020(3), 514\u2013537 (1973)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1_CR17","unstructured":"Kufleitner, M.: Logical Fragments for Mazurkiewicz Traces: Expressive Power and Algebraic Characterizations. Universit\u00e4t Stuttgart, Dissertation (2006)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11779148_5","volume-title":"Developments in Language Theory","author":"M. Kufleitner","year":"2006","unstructured":"Kufleitner, M.: Polynomials, fragments of temporal logic and the variety DA over traces. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, Springer, Heidelberg (2006)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB\u00a078, Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"1_CR20","series-title":"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":"Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets, Applications and Relationship to other Models of Concurrency. LNCS, vol.\u00a0255, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"1_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.\u00c9. Pin","year":"1986","unstructured":"Pin, J.\u00c9.: Varieties of Formal Languages. North Oxford Academic, London (1986)"},{"key":"1_CR22","unstructured":"Pin, J.-\u00c9.: A variety theorem without complementation. In: Russian Mathematics (Izvestija vuzov.Matematika), vol. 39, pp. 80\u201390 (1995)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0022-4049(88)90097-7","volume":"52","author":"J.\u00c9. Pin","year":"1988","unstructured":"Pin, J.\u00c9., Straubing, H., Th\u00e9rien, D.: Locally trivial categories and unambiguous concatenation. Journal of Pure. and Applied Algebra\u00a052, 297\u2013311 (1988)","journal-title":"Journal of Pure. and Applied Algebra"},{"issue":"4","key":"1_CR24","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF02679467","volume":"30","author":"J.\u00c9. Pin","year":"1997","unstructured":"Pin, J.\u00c9., Weil, P.: Polynominal closure and unambiguous product. Theory Comput. Syst.\u00a030(4), 383\u2013422 (1997)","journal-title":"Theory Comput. Syst."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02194921","volume":"13","author":"M.P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.P.: Sur le produit de concatenation non ambigu. Semigroup Forum\u00a013, 47\u201375 (1976)","journal-title":"Semigroup Forum"},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(90)90047-L","volume":"72","author":"I. Simon","year":"1990","unstructured":"Simon, I.: Factorization forests of finite height. Theoretical Computer Science\u00a072(1), 65\u201394 (1990)","journal-title":"Theoretical Computer Science"},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.: The complexity of propositional linear time logic. Journal of the Association for Computing Machinery\u00a032, 733\u2013749 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"1_CR28","unstructured":"Stockmeyer, L.: The complexity of decision problems in automata theory and logic. PhD thesis, TR 133, MIT, Cambridge (1974)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkh\u00e4user, Boston, Basel and Berlin (1994)","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"1_CR30","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1142\/9789812776884_0021","volume-title":"Semigroups, Algorithms, Automata and Languages","author":"P. Tesson","year":"2002","unstructured":"Tesson, P., Th\u00e9rien, D.: Diamonds are Forever: The Variety DA. In: dos Gomes Moreira da Cunha, G.M., da Silva, P.V.A., Pin, J.\u00c9. (eds.) Semigroups, Algorithms, Automata and Languages, Coimbra (Portugal), pp. 475\u2013500. World Scientific, Singapore (2002)"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P.S., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. In: Proc. of LICS 1997, pp. 183\u2013194 (1997)","DOI":"10.1109\/LICS.1997.614946"},{"key":"1_CR32","volume-title":"Handbook of Formal Languages. Beyond Words","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Beyond Words, vol.\u00a03, Springer, Heidelberg (1997)"},{"key":"1_CR33","unstructured":"Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO 2 on words. Technical report, Department of Computer Science University of Massachusetts, Amherst (2006)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:30Z","timestamp":1619517930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}