{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T23:09:27Z","timestamp":1757545767400},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10425,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1016\/s0019-9958(85)80047-4","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T22:48:44Z","timestamp":1115419724000},"page":"119-135","source":"Crossref","is-referenced-by-count":13,"title":["Propositional dynamic logic of flowcharts"],"prefix":"10.1016","volume":"64","author":[{"given":"D.","family":"Harel","sequence":"first","affiliation":[]},{"given":"R.","family":"Sherman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(85)80047-4_bib1","series-title":"Ph.D. thesis","article-title":"Decidability and Expressiveness of Logics of Processes","author":"Abrahamson","year":"1980"},{"key":"10.1016\/S0019-9958(85)80047-4_bib2","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","article-title":"Deterministic propositional dynamic logic: Finite models, complexity, and completeness","volume":"25","author":"Ben-Ari","year":"1982","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0019-9958(85)80047-4_bib3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","article-title":"Complexity measures for regular expressions","volume":"12","author":"Ehrenfucht","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80047-4_bib4","series-title":"19th AMS Sympos. Appl. Math.","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","article-title":"Assigning meanings to programs","author":"Floyd","year":"1967"},{"key":"10.1016\/S0019-9958(85)80047-4_bib5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0019-9958(85)80047-4_bib6","first-page":"497","article-title":"Dynamic logic","volume":"Vol. II","author":"Harel","year":"1984"},{"key":"10.1016\/S0019-9958(85)80047-4_bib7","series-title":"5th ACM Sympos. on Principles of Programming Languages","first-page":"203","article-title":"Nondeterminism in logics of programs","author":"Harel","year":"1978"},{"key":"10.1016\/S0019-9958(85)80047-4_bib8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programing","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/S0019-9958(85)80047-4_bib9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(81)90019-0","article-title":"An elementary proof of the completeness of PDL","volume":"14","author":"Kozen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(85)80047-4_bib10","series-title":"17th IEEE Sympos. on Found. of Comput. Sci.","first-page":"119","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/S0019-9958(85)80047-4_bib11","series-title":"20th IEEE Sympos. on Found. of Comput. Sci.","first-page":"115","article-title":"Models of program logics","author":"Pratt","year":"1979"},{"key":"10.1016\/S0019-9958(85)80047-4_bib12","series-title":"Workshop on Logics of Programs","first-page":"387","article-title":"Using graphs to understand PDL","volume":"Vol. 131","author":"Pratt","year":"1981"},{"key":"10.1016\/S0019-9958(85)80047-4_bib13","series-title":"1st Int. Workshop on Found. Theoret. Comput. Sci.","first-page":"221","article-title":"A combined proof of one exponential decidability and completeness for PDL","author":"Sherman","year":"1983"},{"key":"10.1016\/S0019-9958(85)80047-4_bib14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","article-title":"Propositional dynamic logic of looping and converse is elementarily decidable","volume":"54","author":"Streett","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0019-9958(85)80047-4_bib15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","article-title":"Temporal logic can be more expressive","volume":"56","author":"Wolper","year":"1983","journal-title":"Inform. and Control"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:27:43Z","timestamp":1548523663000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["S0019995885800474"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80047-4","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}