Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Undecidable equivalences for basic process algebra
Information and Computation
Journal of the ACM (JACM)
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
A modal fixpoint logic with chop
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The alternation hierarchy in fixpoint logic with chop is strict too
Information and Computation
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
On hierarchically developing reactive systems
Information and Computation
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal 碌-calculus L碌 that is capable of defining non-regular properties which makes it interesting for verification purposes. Its model checking problem over finite transition systems is PSPACE-hard. We define games that characterise FLC's model checking problem over arbitrary transition systems. Over finite transition systems they can be used as a basis of a local model checker for FLC. I.e. the games allow the transition system to be constructed on the fly. On formulas with fixed alternation depth and so-called sequential depth deciding the winner of the games is PSPACE-complete. The best upper bound for the general case is EXPSPACE which can be improved to EXPTIME at the cost of losing the locality property. On L碌 formulas the games behave equally well as the model checking games for L碌, i.e. deciding the winner is in NP驴co-NP.