Dynamic Logic of Communicating Hybrid Programs
share
This paper presents a dynamic logic dℒ_CHP for compositional deductive verification of communicating hybrid programs (CHPs). CHPs go beyond the traditional mixed discrete and continuous dynamics of hybrid systems by adding CSP-style operators for communication and parallelism. A compositional proof calculus is presented that modularly verifies CHPs including their parallel compositions from proofs of their subprograms by assumption-commitment reasoning in dynamic logic. Unlike Hoare-style assumption-commitments, dℒ_CHP supports intuitive symbolic execution via explicit recorder variables for communication primitives. Since dℒ_CHP is a conservative extension of differential dynamic logic dℒ, it can be used soundly along with the dℒ proof calculus and dℒ's complete axiomatization for differential equation invariants.
READ FULL TEXT