{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:48Z","timestamp":1725558948576},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_28","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:06:05Z","timestamp":1278097565000},"page":"334-344","source":"Crossref","is-referenced-by-count":2,"title":["An NP-Complete Fragment of LTL"],"prefix":"10.1007","author":[{"given":"Anca","family":"Muscholl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0022-0000(93)90005-H","volume":"46","author":"J. Cohen","year":"1993","unstructured":"Cohen, J., Perrin, D., Pin, J.-E.: On the expressive power of temporal logic. Journal of Computer and System Sciences\u00a046(3), 271\u2013294 (1993)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/inco.2001.3094","volume":"174","author":"S. Demri","year":"2002","unstructured":"Demri, S., Schnoebelen, Ph.: The complexity of propositional linear temporal logics in simple cases. Information and Computation\u00a0174(1), 84\u2013103 (2002)","journal-title":"Information and Computation"},{"key":"28_CR3","series-title":"Applied Logic Series","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/978-94-015-9586-5_21","volume-title":"Advances in Temporal Logic","author":"C. Dixon","year":"2000","unstructured":"Dixon, C., Fisher, M., Reynolds, M.: Execution and proof in a horn-clause temporal logic. In: Barringer, H., Fisher, M., Gabbay, D., Gough, G. (eds.) Advances in Temporal Logic. Applied Logic Series, vol.\u00a016, pp. 413\u2013433. Kluwer Academic, Dordrecht (2000)"},{"issue":"3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","volume":"8","author":"E.A. Emerson","year":"1987","unstructured":"Emerson, E.A., Lei, C.: Modalities for model-checking: Branching-time logic strikes back. Science of Computer Programming\u00a08(3), 275\u2013306 (1987)","journal-title":"Science of Computer Programming"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Etessami, K., Vardi, M., Wilke, Th.: First-order logic with two variables and unary temporal logic. In: LICS 1997 - 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, pp. 228\u2013235 (1997)","DOI":"10.1109\/LICS.1997.614950"},{"key":"28_CR6","unstructured":"Kamp, J.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles (1968)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: POPL 1985 - 12th Annual ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, pp. 97\u2013107 (1985)","DOI":"10.1145\/318593.318622"},{"issue":"6-7","key":"28_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00236-003-0136-5","volume":"40","author":"N. Markey","year":"2004","unstructured":"Markey, N.: Past is for free: On the complexity of verifying linear temporal properties with past. Acta Informatica\u00a040(6-7), 431\u2013458 (2004)","journal-title":"Acta Informatica"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-45187-7_17","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N. Markey","year":"2003","unstructured":"Markey, N., Schnoebelen, Ph.: Model checking a path. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 248\u2013262. Springer, Heidelberg (2003)"},{"key":"28_CR10","first-page":"437","volume":"4","author":"P.. Schnoebelen","year":"2003","unstructured":"Schnoebelen, P.: The complexity of temporal logic model checking. Advances in Modal Logic\u00a04, 437\u2013459 (2003)","journal-title":"Advances in Modal Logic"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logic. Journal of the ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"Journal of the ACM"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0055048","volume-title":"Automata, Languages and Programming","author":"I. Walukiewicz","year":"1998","unstructured":"Walukiewicz, I.: Difficult configurations \u2013 on the complexity of LTrL. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 140\u2013151. Springer, Heidelberg (1998)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-49116-3_3","volume-title":"STACS 1999","author":"T. Wilke","year":"1999","unstructured":"Wilke, Th.: Classifying discrete temporal properties. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 32\u201346. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30550-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:29Z","timestamp":1620012569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}