Consistent Consequence for Boolean Equation Systems
Inspired by the concept of a consistent correlation for Boolean equation systems, we introduce and study a novel relation, called consistent consequence. We show that it can be used as an approximation of the solution to an equation system. For the closed, simple and recursive fragment of equation systems we prove that it coincides with direct simulation for parity games. In addition, we show that deciding both consistent consequence and consistent correlations are coNP-complete problems, and we provide a sound and complete proof system for consistent consequence. As an application, we define a novel abstraction mechanism for parameterised Boolean equation systems and we establish its correctness using our theory.
KeywordsEquation System Consistent Consequence Proof System Proposition Variable Label Transition System
Unable to display preview. Download preview PDF.
- 7.Keinänen, M.: Techniques for Solving Boolean Equation Systems. PhD thesis, Helsinki University of Technology (2006)Google Scholar
- 9.Mader, A.: Verification of Modal Properties Using Boolean Equation Systems. PhD thesis, Technische Universität München (1997)Google Scholar
- 10.Mateescu, R.: Vérification des propriétés temporelles des programmes parallèles. PhD thesis, Institut National Polytechnique de Grenoble (1998)Google Scholar