{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T06:02:57Z","timestamp":1740808977242,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252368"},{"type":"electronic","value":"9783540322757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32275-7_13","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T21:14:41Z","timestamp":1292879681000},"page":"184-193","source":"Crossref","is-referenced-by-count":0,"title":["How to Fix It: Using Fixpoints in Different Contexts"],"prefix":"10.1007","author":[{"given":"Igor","family":"Walukiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","unstructured":"Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science\u00a0204 (1997)"},{"key":"13_CR3","series-title":"Studies in Logic","volume-title":"The Rudiments of the Mu-Calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u00f1ski, D.: The Rudiments of the Mu-Calculus. Studies in Logic, vol.\u00a0146. North-Holland, Amsterdam (2001)"},{"key":"13_CR4","first-page":"382","volume-title":"The Book of Traces","author":"W. Ebinger","year":"1995","unstructured":"Ebinger, W.: Logical definability of trace languages. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 382\u2013390. World Scientific, Singapore (1995)"},{"key":"13_CR5","volume-title":"The Book of Traces","author":"P. Gastin","year":"1995","unstructured":"Gastin, P., Petit, A.: Infninite traces. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, World Scientific, Singapore (1995)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 263\u2013277. Springer, Heidelberg (1996)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-31982-5_16","volume-title":"Foundations of Software Science and Computational Structures","author":"S. Lasota","year":"2005","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 250\u2013265. Springer, Heidelberg (2005) (to appear)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski, D.: Fixed points vs. infinite generation. In: LICS 1988, pp. 402\u2013409 (1988)","DOI":"10.1109\/LICS.1988.5137"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic second order theory of order. Annals of Mathematics\u00a0102, 379\u2013419 (1975)","journal-title":"Annals of Mathematics"},{"key":"13_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3550-5","volume-title":"Modal and Temporal Properties of Processes","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, Heidelberg (2001)"},{"issue":"2","key":"13_CR11","first-page":"259","volume":"7","author":"I. Walukiewicz","year":"2002","unstructured":"Walukiewicz, I.: Local logics for traces. Journal of Automata, Languages and Combinatorics\u00a07(2), 259\u2013290 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32275-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:06:20Z","timestamp":1740787580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32275-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252368","9783540322757"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32275-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}