Abstract
We define a propositional version of the µ-calculus, and give an exponential-time decision procedure, small model property, and complete deductive system. We also show that it is strictly more expressive than PDL. Finally we give an algebraic semantics and prove a representation theorem.
Publisher
Det Kgl. Bibliotek/Royal Danish Library
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing Adequately Permissive Assumptions for Synthesis;Tools and Algorithms for the Construction and Analysis of Systems;2023
2. Dynamic Logic: A Personal Perspective;Lecture Notes in Computer Science;2018
3. Abstraction for Branching Time Properties;Computer Aided Verification;2003
4. Compositional Analysis for Verification of Parameterized Systems;Tools and Algorithms for the Construction and Analysis of Systems;2003
5. Certifying Model Checkers;Computer Aided Verification;2001