{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T04:00:49Z","timestamp":1769918449177,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540499947","type":"print"},{"value":"9783540499954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_26","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T23:48:02Z","timestamp":1164671282000},"page":"273-284","source":"Crossref","is-referenced-by-count":38,"title":["A Proof System for the Linear Time \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Christian","family":"Dax","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hofmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"173","volume-title":"Conf. Record of the 13th Annual ACM Symp. on Principles of Programming Languages, POPL 1986","author":"H. Barringer","year":"1986","unstructured":"Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: Conf. Record of the 13th Annual ACM Symp. on Principles of Programming Languages, POPL 1986, pp. 173\u2013183. ACM, New York (1986)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-61440-0_120","volume-title":"Automata, Languages and Programming","author":"J.C. Bradfield","year":"1996","unstructured":"Bradfield, J.C., Esparza, J., Mader, A.: An effective tableau system for the linear time \u03bc-calculus. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 98\u2013109. Springer, Heidelberg (1996)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Dax, C.: Games for the linear time \u03bc-calculus. Master\u2019s thesis, Dep. of Computer Science, University of Munich (2006), Available from: http:\/\/www.tcs.ifi.lmu.de\/lehre\/da_fopra\/Christian_Dax.pdf","DOI":"10.1007\/11944836_26"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Kaivola, R.: A simple decision method for the linear time \u03bc-calculus. In: Proc. Int. Workshop on Structures in Conc. Theory, STRICT 1995, pp. 190\u2013204 (1995)","DOI":"10.1007\/978-1-4471-3078-9_13"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/SFCS.1991.185391","volume-title":"Proc. 32nd Annual Symp. on Foundations of Computer Science, FOCS 1991","author":"N. Klarlund","year":"1991","unstructured":"Klarlund, N.: Progress measures for complementation of \u03c9-automata with applications to temporal logic. In: Proc. 32nd Annual Symp. on Foundations of Computer Science, FOCS 1991, pp. 358\u2013367. IEEE, Los Alamitos (1991)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/276698.276748","volume-title":"Proc. 30th Annual ACM Symp. on Theory of Computing, STOC 1998","author":"O. Kupferman","year":"1998","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: Proc. 30th Annual ACM Symp. on Theory of Computing, STOC 1998, pp. 224\u2013233. ACM Press, New York (1998)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic\u00a02(3), 408\u2013429 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/373243.360210","volume":"36","author":"C.S. Lee","year":"2001","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. J-SIGPLAN\u00a036(3), 81\u201392 (2001)","journal-title":"J-SIGPLAN"},{"key":"26_CR9","volume-title":"Proc. 21st Ann. IEEE Symp. on Logic in Computer Science, LICS 2006","author":"N. Piterman","year":"2006","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proc. 21st Ann. IEEE Symp. on Logic in Computer Science, LICS 2006. IEEE Computer Society Press, Los Alamitos (to appear, 2006)"},{"key":"26_CR10","first-page":"319","volume-title":"Proc. 29th Symp. on Foundations of Computer Science, FOCS 1988","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: Proc. 29th Symp. on Foundations of Computer Science, FOCS 1988, pp. 319\u2013327. IEEE, Los Alamitos (1988)"},{"issue":"3","key":"26_CR11","doi-asserted-by":"crossref","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 logics. Journal of the Association for Computing Machinery\u00a032(3), 733\u2013749 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2-3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. TCS\u00a049(2-3), 217\u2013237 (1987)","journal-title":"TCS"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"R.S. Streett","year":"1989","unstructured":"Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional \u03bc-calculus. Information and Computation\u00a081(3), 249\u2013264 (1989)","journal-title":"Information and Computation"},{"key":"26_CR14","first-page":"250","volume-title":"Proc. Conf. on Principles of Programming Languages, POPL 1988","author":"M.Y. Vardi","year":"1988","unstructured":"Vardi, M.Y.: A temporal fixpoint calculus. In: Proc. Conf. on Principles of Programming Languages, POPL 1988, pp. 250\u2013259. ACM Press, New York (1988)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:46Z","timestamp":1619493466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11944836_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}