Dynamic Logic of Communicating Hybrid Programs
Abstract
This paper presents a dynamic logic dLCHP 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, dLCHP supports intuitive symbolic execution via explicit recorder variables for communication primitives. Since dLCHP is a conservative extension of differential dynamic logic dL, it can be used soundly along with the dL proof calculus and dL's complete axiomatization for differential equation invariants.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.