{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:42:56Z","timestamp":1794336176219,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540283096","type":"print"},{"value":"9783540319344","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_40","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:54:50Z","timestamp":1127814890000},"page":"533-547","source":"Crossref","is-referenced-by-count":2,"title":["Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces"],"prefix":"10.1007","author":[{"given":"Paul","family":"Gastin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dietrich","family":"Kuske","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1007\/3-540-45465-9_79","volume-title":"Automata, Languages and Programming","author":"B. Adsul","year":"2002","unstructured":"Adsul, B., Sohoni, M.: Complete and tractable local linear time temporal logics over traces. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 926\u2013937. Springer, Heidelberg (2002)"},{"key":"40_CR2","first-page":"90","volume-title":"Proc. of LICS 1995","author":"R. Alur","year":"1995","unstructured":"Alur, R., Peled, D., Penczek, W.: Model-checking of causality properties. In: Proc. of LICS 1995, pp. 90\u2013100. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ic.2004.08.001","volume":"195","author":"V. Diekert","year":"2004","unstructured":"Diekert, V., Gastin, P.: Local temporal logic is expressively complete for cograph dependence alphabets. Information and Computation\u00a0195, 30\u201352 (2004)","journal-title":"Information and Computation"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-24698-5_27","volume-title":"LATIN 2004: Theoretical Informatics","author":"V. Diekert","year":"2004","unstructured":"Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 232\u2013241. Springer, Heidelberg (2004)"},{"key":"40_CR5","volume-title":"The Book of Traces","year":"1995","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"40_CR6","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1991","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1991)"},{"key":"40_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic","author":"D. Gabbay","year":"1994","unstructured":"Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic. Oxford University Press, Oxford (1994)"},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-45187-7_15","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, pp. 222\u2013236. Springer, Heidelberg (2003)"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1007\/3-540-45465-9_80","volume-title":"Automata, Languages and Programming","author":"P. Gastin","year":"2002","unstructured":"Gastin, P., Mukund, M.: An elementary expressively complete temporal logic for Mazurkiewicz traces. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 938\u2013949. Springer, Heidelberg (2002)"},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-540-45138-9_37","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P. Gastin","year":"2003","unstructured":"Gastin, P., Mukund, M., Narayan Kumar, K.: Local LTL with past constants is expressively complete for Mazurkiewicz traces. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 429\u2013438. Springer, Heidelberg (2003)"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-61550-4_140","volume-title":"Mathematical Foundations of Computer Science 1996","author":"M. Mukund","year":"1996","unstructured":"Mukund, M., Thiagarajan, P.S.: Linear time temporal logics over Mazurkiewicz traces. In: Penczek, W., Sza\u0142as, A. (eds.) MFCS 1996. LNCS, vol.\u00a01113, pp. 62\u201392. Springer, Heidelberg (1996)"},{"key":"40_CR12","first-page":"109","volume":"3","author":"T.. Schwentick","year":"1999","unstructured":"Schwentick, T., Bartelmann, K.: Local normal forms for first-order logic with applications to games and automata. Discrete Mathematics and Computer Science\u00a03, 109\u2013124 (1999)","journal-title":"Discrete Mathematics and Computer Science"},{"key":"40_CR13","first-page":"438","volume-title":"Proc. of LICS 1994","author":"P.S. Thiagarajan","year":"1994","unstructured":"Thiagarajan, P.S.: A trace based extension of linear time temporal logic. In: Proc. of LICS 1994, pp. 438\u2013447. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-60218-6_33","volume-title":"CONCUR \u201995 Concurrency Theory","author":"P.S. Thiagarajan","year":"1995","unstructured":"Thiagarajan, P.S.: A trace consistent subset of PTL. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 438\u2013452. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:35:02Z","timestamp":1558283702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11539452_40","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11539452","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}