{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:29:06Z","timestamp":1736573346058,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055785","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"356-365","source":"Crossref","is-referenced-by-count":4,"title":["A (non-elementary) modular decision procedure for LTrL"],"prefix":"10.1007","author":[{"given":"Paul","family":"Gastin","sequence":"first","affiliation":[]},{"given":"Rapha\u00ebl","family":"Meyer","sequence":"additional","affiliation":[]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"R. Alur, D. Peled, and W. Penczek. Model-checking of causality properties. In Proceedings of LICS'95, pages 90\u2013100, 1995.","DOI":"10.1109\/LICS.1995.523247"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"J.R. B\u00fcchi. Weak second-order arithmetic and finite automata. Z. Math Logik Grundlag. Math., 6:66\u201392, 1960.","journal-title":"Z. Math Logik Grundlag. Math."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF00121128","volume":"1","author":"C. Courcoubetis","year":"1992","unstructured":"C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. formal Methods in System Design, 1:275\u2013288, 1992.","journal-title":"formal Methods in System Design"},{"volume-title":"The Book of Traces","year":"1995","key":"32_CR4","unstructured":"V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995."},{"key":"32_CR5","unstructured":"W. Ebinger. Charakterisierung von Sprachklassen unendlicher Spuren durch Logiken. Dissertation, Institut f\u00fcr Informatik, Universit\u00e4t Stuttgart, 1994."},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/BFb0055785","volume-title":"Mathematical Foundations of Computer Science 1998","author":"Paul Gastin","year":"1998","unstructured":"P. Gastin, R. Meyer, and A. Petit. A (non-elementary) modular decision procedure for LTrL. Technical report, LSV, ENS de Cachan, June 1998."},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BFb0035388","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Peter Kelb","year":"1997","unstructured":"P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: a flexible toolset for monadic second-order logic. In Proceedings of CAV'97, LNCS 1254, 1997."},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0028022","volume-title":"Computer Science Logic","author":"Nils Klarlund","year":"1998","unstructured":"N. Klarlund. Mona & Fido: The logic-automaton connection in practice. In Proceedings of CSL'97, LNCS, 1998."},{"key":"32_CR9","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":"32_CR10","first-page":"533","volume":"number 1373","author":"R. Meyer","year":"1998","unstructured":"R. Meyer and A. Petit. Expressive completeness of LTrL on finite traces: an algebraic proof. In Proceedings of STACS'98, number 1373 in LNCS, pages 533\u2013543, 1998.","journal-title":"LNCS"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"D. Perrin and J. E. Pin. Infinite words. Technical report, LITP, Avril 1997.","DOI":"10.1017\/CBO9780511566097.004"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The temporal logics of programs. In Proceedings of the 18th IEEE FOCS, 1977, pages 46\u201357, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"R. Ramanujam. Locally linear time temporal logic. In Proceedings of LICS'96, pages 118\u2013128, 1996.","DOI":"10.1109\/LICS.1996.561311"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"S. Safra. On the complexity of \u03a9-automata. In Proceedings of the 29th annual IEEE Symp. on Foundations of Computer Science, pages 319\u2013327, 1988.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"32_CR15","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 propositional linear time logic. J. ACM, 32:733\u2013749, 1985.","journal-title":"J. ACM"},{"key":"32_CR16","volume-title":"PhD thesis, TR 133","author":"L. Stockmeyer","year":"1974","unstructured":"L. Stockmeyer. The complexity of decision problems in automata theory and logic. PhD thesis, TR 133, M.I.T., Cambridge, 1974."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan. A trace based extension of linear time temporal logic. In Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS'94), pages 438\u2013447, 1994.","DOI":"10.1109\/LICS.1994.316047"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), 1997.","DOI":"10.7146\/brics.v3i62.18563"},{"key":"32_CR19","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0055048","volume-title":"Automata, Languages and Programming","author":"Igor Walukiewicz","year":"1998","unstructured":"I. Walukiewicz. Difficult configurations \u2014 on the complexity of LTrL. In Proceedings of ICALP'98, 1998."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:52:20Z","timestamp":1736517140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0055785","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}