2000 character limit reached
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems (1006.5906v1)
Published 30 Jun 2010 in cs.FL and cs.LO
Abstract: We present an extension of an algorithm for computing directly the denotation of a mu-calculus formula X over the configuration graph of a pushdown system to allow backwards modalities. Our method gives the first extension of the saturation technique to the full mu-calculus with backwards modalities.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.