This paper presents a dynamic logic $d\mathcal{L}_\text{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\mathcal{L}_\text{CHP}$ supports intuitive symbolic execution via explicit recorder variables for communication primitives. Since $d\mathcal{L}_\text{CHP}$ is a conservative extension of differential dynamic logic $d\mathcal{L}$, it can be used soundly along with the $d\mathcal{L}$ proof calculus and $d\mathcal{L}$'s complete axiomatization for differential equation invariants.

翻译：本文提出了一种用于通信混合程序（CHP）组合演绎验证的动态逻辑$d\mathcal{L}_\text{CHP}$。CHP通过引入CSP风格的通信与并行操作符，超越了传统混合系统中离散与连续动力学的混合模式。我们提出了一种组合式证明演算，该演算通过动态逻辑中的假设-承诺推理，从子程序的证明出发模块化地验证CHP（包括其并行组合）。与Hoare风格的假设-承诺不同，$d\mathcal{L}_\text{CHP}$通过为通信原语引入显式记录变量支持直观的符号执行。由于$d\mathcal{L}_\text{CHP}$是微分动态逻辑$d\mathcal{L}$的保守扩展，因此它可以与$d\mathcal{L}$证明演算以及$d\mathcal{L}$关于微分方程不变性的完备公理化系统保持可靠地协同使用。