Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-06-30
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
Hague Matthew
Ong C.-H. L.
No associations
LandOfFree
A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Saturation Method for the Modal Mu-Calculus with Backwards Modalities over Pushdown Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-154364