{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:11Z","timestamp":1725663251734},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540126898"},{"type":"electronic","value":"9783540386827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12689-9_104","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:52:08Z","timestamp":1330192328000},"page":"195-206","source":"Crossref","is-referenced-by-count":3,"title":["Propositional dynamic logic of flowcharts"],"prefix":"10.1007","author":[{"given":"D.","family":"Harel","sequence":"first","affiliation":[]},{"given":"R.","family":"Sherman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","volume":"25","author":"M. Ben-Ari","year":"1982","unstructured":"Ben-Ari, M., J. Y. Halpern and A. Pnueli, 1982, Deterministic propositional dynamic logic: finite models, complexity and completeness, J. Comp. Syst. Sci. 25, 402\u2013417.","journal-title":"J. Comp. Syst. Sci."},{"issue":"2","key":"16_CR2","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","volume":"12","author":"A. Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A. and P. Zeiger, 1976, Complexity measures for regular expressions, J. Comp. Syst. Sci. 12, 2, 134\u2013146.","journal-title":"J. Comp. Syst. Sci."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Floyd, R.W., 1967, Assigning meanings to programs, 19 th AMS Symp. Applied Math. American Math. Society, Providence, R.I. 19\u201331.","DOI":"10.1090\/psapm\/019\/0235771"},{"issue":"2","key":"16_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J. and R. E. Ladner, 1979, Propositional dynamic logic of regular programs, J. Comp. Syst. Sci. 18, 2, 194\u2013211.","journal-title":"J. Comp. Syst. Sci."},{"key":"16_CR5","volume-title":"Handbook of Philosophical Logic, Vol. II","author":"D. Harel","year":"1983","unstructured":"Harel, D., 1983, Dynamic logic, In Handbook of Philosophical Logic, Vol. II, Reidel Publishing Company, Holland\/USA, in press."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Harel, D. and V. R. Pratt, 1978, Nondeterminism in logics of programs, 5 th AC Symp. on Principles of Programming Languages, 203\u2013213.","DOI":"10.1145\/512760.512782"},{"key":"16_CR7","first-page":"576","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare, C. A. R., 1969, An axiomatic basis for computer programing, Comm. Assoc. Mach. 12, 576\u2013583.","journal-title":"Comm. Assoc. Mach."},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","volume":"14","author":"D. Kozen","year":"1981","unstructured":"Kozen, D. and R. Parikh, 1981, An elementary proof of the completeness of PDL, Theor. Comput. Science 14, 113\u2013118.","journal-title":"Theor. Comput. Science"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Pratt, V. R., 1976, Semantical considerations on Floyd-Hoare logic, 17 th IEEE Symp. on Foundations of Computer Science, 119\u2013121.","DOI":"10.1109\/SFCS.1976.27"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Pratt, V. R., 1979, Models of program logics, 20 th IEEE Symp. on Foundations o Computer Science, 115\u2013122.","DOI":"10.1109\/SFCS.1979.24"},{"key":"16_CR11","first-page":"387","volume-title":"Lect. Notes in Comput. Sci. 131","author":"V. R. Pratt","year":"1981","unstructured":"Pratt, V. R., 1981, Using graphs to understand PDL, Workshop on logics of programs, (D. Kozen ed.), Lect. Notes in Comput. Sci. 131, Springer-Verlag, New York, 387\u2013396."},{"key":"16_CR12","unstructured":"Sherman., R. and D. Harel, 1983, A combined proof of one exponential decidability and completeness for PDL, 1 st Int. Workshop on Found. Theoret. Comput. Sci., GTI, Paderborn, 221\u2013233."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Streett, R. S., 1983, Propositional dynamic logic of looping and converse is elementarily decidable. Inf. and Cont., in press.","DOI":"10.1016\/S0019-9958(82)91258-X"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Wolper, P., 1981, Temporal logic can be more expressive, 22 nd IEEE Symp. on Foundations of Computer Science, 340\u2013348.","DOI":"10.1109\/SFCS.1981.44"}],"container-title":["Lecture Notes in Computer Science","Foundations of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12689-9_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:23:47Z","timestamp":1640913827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12689-9_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540126898","9783540386827"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-12689-9_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}