Propositional Dynamic Logic for Hyperproperties
share
Information security properties of reactive systems like non-interference often require relating different executions of the system to each other and following them simultaneously. Since common logics like LTL, CTL, or the modal mu-calculus cannot express such hyperproperties, the hyperlogics HyperLTL and HyperCTL* were developed to cure this defect. However, these logics are not able to express arbitrary omega-regular properties. In this paper, we introduce HyperPDL-Delta, an adaptation of the Propositional Dynamic Logic of Fischer and Ladner for hyperproperties, in order to remove this limitation. Using an elegant automata-theoretic framework, we show that HyperPDL-Delta model checking is asymptotically not more expensive than HyperCTL* model checking, despite its vastly increased expressive power. We further investigate fragments of HyperPDL-Delta with regard to satisfiability checking.
READ FULL TEXT
