Abstract
Dynamic logic is a framework suitable for specification and verification of dynamic properties of systems. It is a multimodal logic with the modal operations of necessity and possibility determined by binary relations understood as state transition relations or input-output relations associated with computer programs. The logic evolved from the early ideas of J. Yanov [Yan59], E. Engeler [Eng67], and C. Hoare [Hoa69], through the algorithmic logic of A. Salwicki [Sal70, MS87], and finally it was formulated by V. Pratt [Pra76] in the form which emphasizes a modal nature of interactions between programs and assertions (see also [FL79]). A number of interesting variants of propositional dynamic logic, PDL, obtained by restricting or extending it in various ways, have been studied including deterministic PDL, automata PDL, programs with restrictions on allowable tests, programs with complementation and intersection, programs with a converse operation, and logics with well-foundness and halting predicates; for a comprehensive survey see [HKT00].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
