{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:53Z","timestamp":1725456113477},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354011212X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0025792","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:23:41Z","timestamp":1132395821000},"page":"387-396","source":"Crossref","is-referenced-by-count":10,"title":["Using graphs to understand PDL"],"prefix":"10.1007","author":[{"given":"V. R.","family":"Pratt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Decidability and Expressiveness of Logics of Processes","author":"K. Abrahamson","year":"1980","unstructured":"Abrahamson, K., Decidability and Expressiveness of Logics of Processes, Ph.D. Thesis, TR #80-08-01, Dept. of Comp. Sci., U. of Wash., Seattle, 1980."},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1137\/0204011","volume":"4","author":"E. Ashcroft","year":"1975","unstructured":"Ashcroft, E., and Z. Manna, Translating Program Schemas to While-Schemas, SIAM J. Comput., 4, 2, 125\u2013146, June, 1975.","journal-title":"SIAM J. Comput."},{"key":"23_CR3","unstructured":"Dijkstra, E.W., A Discipline of Programming, Prentice-Hall. 1976"},{"issue":"2","key":"23_CR4","first-page":"134","volume":"12","author":"A. Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A., and P. Zeiger, Complexity Measures for Regular Expressions, JCSS, 12., 2, 134\u2013146, April, 1976.","journal-title":"JCSS"},{"issue":"2","key":"23_CR5","first-page":"194","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"Fischer, M. J., and R. Ladner, Propositional Dynamic Logic of Regular Programs, JCSS, 18, 2, 194\u2013211, April 1979.","journal-title":"JCSS"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Floyd, R. W., Assigning Meanings to Programs, In Mathematical Aspects of Computer Science (ed. J.T. Schwartz), 19\u201332, 1967.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare, C.A.R., An Axiomatic Basis for Computer Programming, CACM 12, 576\u2013580, 1969.","journal-title":"CACM"},{"key":"23_CR8","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C., Representation of Events in Nerve Nets, in Automata Studies, (eds. Shannon, C.E. and J. McCarthy), 3\u201340, Princeton University Press, Princeton, NJ, 1956."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Parikh, R., A Completeness Result for a Propositional Dynamic Logic, Lecture Notes in Computer Science No. 64, 403\u2013415, Springer-Verlag, 1978. Also M.I.T. Laboratory for Computer Science Technical Memorandum No. 106, July 1978.","DOI":"10.1007\/3-540-08921-7_88"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Pratt, V.R., Models of Program Logics, Proc. 20th IEEE Conference on Foundations of Computer Science, San Juan, PR, Oct. 1979.","DOI":"10.1109\/SFCS.1979.24"},{"key":"23_CR11","unstructured":"Pratt, V.R., Dynamic Algebras: Examples, Constructions, Applications, MIT\/LCS\/TM-138, M.I.T. Laboratory for Computer Science, May 1979."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Pratt, V.R., Dynamic Algebras and the Nature of Induction, Proc. 12th ACM Symp. on Theory of Computing, 22\u201328, Los Angeles, CA, May, 1980.","DOI":"10.1145\/800141.804649"},{"key":"23_CR13","first-page":"120","volume":"16","author":"V.N. Redko","year":"1964","unstructured":"Redko, V.N., On Defining Relations for the Algebra of Regular Events, (Russian), Ukrain. Mat. Z., 16, 120\u2013126, 1964.","journal-title":"Ukrain. Mat. Z."},{"key":"23_CR14","unstructured":"Segerberg, K., A Completeness Theorem in the Modal Logic of Programs, Preliminary report. Notices of the AMS, 24, 6, A-552. Oct. 1977."}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0025792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:52:37Z","timestamp":1586569957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354011212X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0025792","relation":{},"subject":[]}}