A saturation method for the modal μ-calculus over pushdown systems

  • Authors:
  • M. Hague;C. -H. L. Ong

  • Affiliations:
  • Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK;Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, UK

  • Venue:
  • Information and Computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an algorithm for computing directly the denotation of a @m-calculus formula @g over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the full @m-calculus. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton manipulations which compute the denotation by recursion over the structure of the formula. We introduce notions of under-approximation (soundness) and over-approximation (completeness) that apply to automaton transitions rather than runs. Our algorithm is relatively simple and direct, and avoids an immediate exponential blow up. Finally, we show experimentally that the direct algorithm is more efficient than via a reduction to parity games.