{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:24:33Z","timestamp":1777519473571,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540647812","type":"print"},{"value":"9783540686811","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055048","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T12:08:05Z","timestamp":1154434085000},"page":"140-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Difficult configurations \u2014 on the complexity of LTrL"],"prefix":"10.1007","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, K. McMillan, and D. Peled. Deciding global parial-order properties. submitted, 1997.","DOI":"10.1007\/BFb0055039"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In LICS '95, pages 90\u2013100, 1995.","DOI":"10.1109\/LICS.1995.523247"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.","DOI":"10.1142\/2563"},{"key":"13_CR4","first-page":"335","volume":"700","author":"W. Ebinger","year":"1993","unstructured":"W. Ebinger and A. Muscholl. Logical definability on infinite traces. In ICALP '93, volume 700, pages 335\u2013346, 1993","journal-title":"ICALP '93"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"P. Godefroid. Partial-order methods for the verification of concurrent systems, volume 1032 of LNCS. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-60761-7"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1995.1078","volume":"119","author":"G. K. Lodaya","year":"1985","unstructured":"G. K. Lodaya, R. Parikh, R. Ramanujam, and P. Thiagarajan. A logical study of distributed transition systems. Information and Computation, 119:91\u2013118, 1985.","journal-title":"Information and Computation"},{"key":"13_CR7","first-page":"93","volume":"1113","author":"D. Peled","year":"1996","unstructured":"D. Peled. Partial order reduction: model checking using representatives. In MFCS'96, volume 1113 of LNCS, pages 93\u2013112, 1996.","journal-title":"LNCS"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(94)90009-4","volume":"126","author":"D. Peled","year":"1994","unstructured":"D. Peled and A. Pnueli. Proving partial order properties. Theoretical Computer Science, 126:143\u2013182, 1994.","journal-title":"Theoretical Computer Science"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(92)90007-I","volume":"43","author":"W. Penczek","year":"1992","unstructured":"W. Penczek. On udecidability of prepositional temporal logics on trace systems. Information Processing Letters, 43:147\u2013153, 1992.","journal-title":"Information Processing Letters"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"R. Ramanujam. Locally linear time temporal logic. In LICS '96, pages 118\u2013128, 1990.","DOI":"10.1109\/LICS.1996.561311"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"A. Sistla and E. Clarke. The complexity of prepositional linear time logic. J. ACM, 32:733\u2013749, 1985.","journal-title":"J. ACM"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan. A trace based extension of linear time temporal logic. In LICS, pages 438\u2013447, 1994.","DOI":"10.1109\/LICS.1994.316047"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for mazurkiewicz traces. In LICS'97, pages 183\u2013194. IEEE, 1997.","DOI":"10.7146\/brics.v3i62.18563"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"A. Valmari. A stubborn attack on state explosion. Formal Methods in System, Design, 1:297\u2013322, 1992.","journal-title":"Formal Methods in System, Design"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T07:59:19Z","timestamp":1736495959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055048"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0055048","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}