Abstraction in Fixpoint Logic

Abstract

We present a theory of abstraction for the framework of parameterised Boolean equation systems, a firstorder 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.

Modelling the Raft Distributed Consensus Protocol in mCRL2

“…Stronger liveness requirements, asserting that always inevitably a leader must be elected, are simply not true in our model because in some configurations, messages are lost or nodes crash, but also due to us imposing limits on the maximum number of terms we consider. Phrasing the exact properties while taking all exceptions into account is non-trivial: for some properties, a counterexample may not simply be a run of the system but it can consist of an entire subgraph of the transition system [2,3], consisting of a 1 000 or more states. In such cases, understanding the root cause of the violation can be virtually impossible.…”

Finding compact proofs for infinite-data parameterised Boolean equation systems

“…Bisimulation is much stronger than solution equivalence, resulting in a reduced dependence space that is larger than necessary to determine the solution. Besides bisimulation, several other equivalences have been defined in the literature, such as consistent correlation [24] and the corresponding preorder consistent consequence [26]. This inspired us to investigate how our techniques can benefit from a weaker equivalence relation.…”

The mCRL2 Toolset for Analysing Concurrent Systems

“…Two new experimental tools, pbessymbolicbisim [40] and pbesabsinthe [16], support model checking of infinite-state systems. These are two of the few symbolic tools in the toolset.…”