{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:00:34Z","timestamp":1725642034571},"publisher-location":"London","reference-count":17,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540199823"},{"type":"electronic","value":"9781447130789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/978-1-4471-3078-9_13","type":"book-chapter","created":{"date-parts":[[2011,12,12]],"date-time":"2011-12-12T02:47:45Z","timestamp":1323658065000},"page":"190-204","source":"Crossref","is-referenced-by-count":8,"title":["A Simple Decision Method for the Linear Time Mu-calculus"],"prefix":"10.1007","author":[{"given":"Roope","family":"Kaivola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Springer-Verlag","author":"JL Balcazar","year":"1988","unstructured":"Balcazar, J. L. and; Diaz, J. and; Gabarro. J.: Structural Complexity \/, EATCS Monographs on Theoretical Computer Science vol. 11, Springer-Verlag, 1988"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Banieqbal, B. and Barringer, H.: Temporal Logic with Fixed Points, in Temporal Logic in Specification, LNCS vol. 398, Springer-Verlag, 1989, pp. 62\u201374","DOI":"10.1007\/3-540-51803-7_22"},{"key":"13_CR3","volume-title":"Proc. of the 13th ACM POPL","author":"H Barringer","year":"1986","unstructured":"Barringer, H. and; Kuiper, R. and Pnueli, A.: A Really Abstract Concurrent Model and its Temporal Logic, in Proc. of the 13th ACM POPL, 1986"},{"key":"13_CR4","first-page":"1","volume-title":"Proc. of the 1960 International Congress on Logic","author":"JR B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J. R.: On a Decision Method in Restricted Second-Order Arithmetics, in Proc. of the 1960 International Congress on Logic, Methodology and Philosophy of Science, Stanford University Press, 1962, pp. 1\u201312"},{"key":"13_CR5","first-page":"413","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L. E.: Finiteness of the Odd Perfect and Primitive Abundant Numbers with Distinct Prime Factors, in Americal Journal of Mathematics, vol. 35, 1913, pp. 413\u2013422","journal-title":"Finiteness of the Odd Perfect and Primitive Abundant Numbers with Distinct Prime Factors, in Americal Journal of Mathematics"},{"key":"13_CR6","first-page":"997","volume-title":"Handbook of Theoretical Computer Science, Elsevier\/North-Holland","author":"EA Emerson","year":"1990","unstructured":"Emerson, E. A.: Temporal and Modal Logic, in van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Elsevier\/North-Holland, 1990, pp. 997\u20131072"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E. A. h Clarke, E. M.: Characterising Correctness Properties of Parallel Programs using Fixpoints, in Proc. of the 7th ICALP, LNCS vol. 85, Springer- Verlag, 1980, pp. 169\u2013181","DOI":"10.1007\/3-540-10003-2_69"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the Propositional \/\u00bf-calculus, in Theoretical Computer Science, vol. 27, 1983, pp. 333\u2013354","journal-title":"Results on the Propositional \/\u00bf-calculus, in Theoretical Computer Science"},{"key":"13_CR9","volume-title":"Decidability, Completeness, and Extensions of Linear Time Temporal Logic, PhD thesis, The Weizmann Institute of Science","author":"O Lichtenstein","year":"1991","unstructured":"Lichtenstein, O.: Decidability, Completeness, and Extensions of Linear Time Temporal Logic, PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, 1991"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Lichtenstein, O. and; Pnueli, A. and; Zuck, L.: The Glory of the Past, in Proc. of Workshop on Logics of Programs, LNCS vol. 193, Springer-Verlag, 1985, pp. 97\u2013107","DOI":"10.1007\/3-540-15648-8_16"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the Complexity of u;-Automat a, in Proceedings of the 29th Sym-posium on Foundations of Computer Science, 1988, pp. 319\u2013327","DOI":"10.1109\/SFCS.1988.21948"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W. J.: Relationships Between Nondeterministic and Deterministic Tape Complexities, in Journal of Computer and System Sci., vol. 4, 1970, pp. 177\u2013192","journal-title":"Journal of Computer and System Sci"},{"key":"13_CR13","first-page":"477","volume-title":"Abramsky","author":"C Stirling","year":"1992","unstructured":"Stirling, C.: Modal and Temporal Logics, in Abramsky, S. and; al. (eds.): Handbook of Logic in Computer Science, Oxford University Press, 1992, pp. 477\u2013563"},{"key":"13_CR14","first-page":"249","volume":"81","author":"RS Streett","year":"1989","unstructured":"Streett, R. S. and; Emerson, E. A.: An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus, in Information and Computation, vol. 81, 1989, pp. 249\u2013264","journal-title":"E. A.: An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus, in Information and Computation"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Vardi, M. Y.: A Temporal Fixpoint Calculus, in Proceedings of the 15th ACM Symposium on Priciples of Programming Languages, 1988, pp. 250\u2013259","DOI":"10.1145\/73560.73582"},{"key":"13_CR16","volume-title":"Synthesis of Communicating Processes from Temporal Logic Specifications","author":"P Wolper","year":"1982","unstructured":"Wolper, P.: Synthesis of Communicating Processes from Temporal Logic Specifications, PhD thesis, Stanford University, 1982"},{"key":"13_CR17","first-page":"72","volume":"56","author":"P Wolper","year":"1983","unstructured":"Wolper, P.: Temporal Logic can be More Expressive, in Information and Control, vol 56, 1983, pp. 72\u201399","journal-title":"Temporal Logic can be More Expressive, in Information and Control"}],"container-title":["Workshops in Computing","Structures in Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3078-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T16:31:45Z","timestamp":1593361905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3078-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540199823","9781447130789"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3078-9_13","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1995]]}}}