{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:18Z","timestamp":1725664698619},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:00:35Z","timestamp":1330297235000},"page":"323-332","source":"Crossref","is-referenced-by-count":0,"title":["Some results on Propositional Dynamic Logic with fixed points"],"prefix":"10.1007","author":[{"given":"Igor","family":"Rents","sequence":"first","affiliation":[]},{"given":"Nikolaj","family":"Shilov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"issue":"n.2.","key":"33_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fisher","year":"1979","unstructured":"Fisher M.J., Ladner R.E.: Prepositional dynamic logic of regular programs. J. Comput. System Sci., 18, n.2., (1979), 194\u2013211","journal-title":"J. Comput. System Sci."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Harel D.: Dynamic Logic. in Handbook of Philosophical Logic, 2, Reidel, (1984).","DOI":"10.1007\/978-94-009-6259-0_10"},{"issue":"n.3","key":"33_CR3","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 Prepositional Mu-Calculus. Theoretical Computer Science, 27, n.3, (1983), 333\u2013354.","journal-title":"Theoretical Computer Science"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Pratt V.R.: A decidable Mu-Calculus: preliminary report. 22-nd IEEE Symp. on Foundation of Computer Science, (1982), 421\u2013427.","DOI":"10.1109\/SFCS.1981.4"},{"issue":"n.3","key":"33_CR5","doi-asserted-by":"crossref","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 Prepositional Mu-Calculus. Information and Computation, 81, n.3, (1989), 249\u2013264.","journal-title":"Information and Computation"},{"key":"33_CR6","unstructured":"Walukiewicz I.: A Complete Deduction System for the \u039c-Calculus. Doctoral Thesis, Warsaw, (1993)."},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/malq.19920380107","volume":"38","author":"R.A. Bull","year":"1992","unstructured":"Bull R.A.: Cut elimination for prepositional dynamic logic without *. Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik, 38, (1992), 85\u2013100.","journal-title":"Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik"},{"key":"33_CR8","unstructured":"Pliuskeviciene A.U.: Index Technique for Prepositional Dynamic logic. (Russian) 10-th USSR Conf. on Math. Log., Alma-Ata, 1990, 130."},{"key":"33_CR9","first-page":"452","volume":"620","author":"N.V. Shilov","year":"1992","unstructured":"Shilov N.V.: Prepositional Dynamic Logic with Fixed Points: Algorithmic tools for verification of Finite State Machines. Int. Symp. on Log. Found. of Comp. Sci. LFCS'92, LNCS, 620, (1992), 452\u2013458.","journal-title":"LNCS"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Shilov N.V. Program schemata vs. automata for decidability of program logics. to appear in Theoretical Computer Science, 175, April 1997.","DOI":"10.1016\/S0304-3975(96)00168-5"},{"issue":"n.2","key":"33_CR11","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch J.R. Clarke E.M. McMillan K.L. Dill D.L. Hwang L.J.: Symbolic Model Checking: 1020 States and Beyond. Information and Computation, 98, n.2, (1992), 142\u2013170.","journal-title":"Information and Computation"},{"key":"33_CR12","first-page":"385","volume":"698","author":"E.A. Emerson","year":"1993","unstructured":"Emerson E.A. Jutla C.S. Sistla A.P.: On model-checking for fragments of Mu-Calculus. Int. Conf. on Computer-Aided Verification CAV'93, LNCS, 698, (1993), 385\u2013396.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:17Z","timestamp":1605647717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}