Affiliation:
1. Eindhoven University of Technology, Eindhoven, The Netherlands
Abstract
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a first-order fixpoint logic. Parameterised Boolean equation systems can be used to solve a variety of problems in verification. We study the capabilities of the abstraction theory by comparing it to an abstraction theory for Generalised Kripke modal Transition Systems (GTSs). We show that for model checking the modal μ-calculus, our abstractions can be exponentially more succinct than GTSs and our theory is as complete as the GTS framework for abstraction. Furthermore, we investigate the completeness of our theory irrespective of the encoded decision problem. We illustrate the potential of our theory through case studies using the first-order modal μ-calculus and a real-time extension thereof, conducted using a prototype implementation of a new syntactic transformation for parameterised Boolean equation systems.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference45 articles.
1. A theory of timed automata
2. H. Bekič. 1984. Programming Languages and Their Definition. Springer-Verlag. H. Bekič. 1984. Programming Languages and Their Definition. Springer-Verlag.
3. Modal Mu-Calculi. In Handbook of Modal Logic. Elsevier;Bradfield J.;Chapter,2006
4. Lecture Notes in Computer Science 4703;Chen T.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献