Computer Science – Logic in Computer Science
Scientific paper
2012-02-16
EPTCS 77, 2012, pp. 39-46
Computer Science
Logic in Computer Science
In Proceedings FICS 2012, arXiv:1202.3174
Scientific paper
10.4204/EPTCS.77.6
The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in polynomial time, and conversely every polynomial-time decidable problem that has a bisimulation-invariant encoding into labeled transition systems can also be defined in the higher-dimensional modal mu-calculus. We exemplify the latter connection by giving several examples of decision problems which reduce to model checking of the higher-dimensional modal mu-calculus for some fixed formulas. This way generic model checking algorithms for the logic can then be used via partial evaluation in order to obtain algorithms for theses problems which may benefit from improvements that are well-established in the field of program verification, namely on-the-fly and symbolic techniques. The aim of this work is to extend such techniques to other fields as well, here exemplarily done for process equivalences, automata theory, parsing, string problems, and games.
Lange Martin
Lozes Etienne
No associations
LandOfFree
Model-Checking the Higher-Dimensional Modal mu-Calculus 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 Model-Checking the Higher-Dimensional Modal mu-Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model-Checking the Higher-Dimensional Modal mu-Calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-124936