A Solver for Modal Fixpoint Logics
نویسندگان
چکیده
منابع مشابه
A Solver for Modal Fixpoint Logics
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiability through infinite (cyclic) tableaux in which branches have an inner thread structure mirroring the regeneration of least and greatest fixpoint constructs in the infinite. Well-foundedness for unfoldings of least fixpo...
متن کاملModal Fixpoint Logics
Context. Modal fixpoint logics constitute a research field of considerable interest, not only because of its many applications in computer science, but also because of its rich mathematical theory, which features deep connections with fields as diverse as lattice theory, automata theory, and universal coalgebra. In the 1970s computer scientists started to use modal logics as specification langu...
متن کاملCompleteness for Flat Modal Fixpoint Logics
This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set Γ of modal formulas of the form γ(x, p1, . . . , pn), where x occurs only positively in γ, the language L♯(Γ) is obtained by adding to the language of polymodal logic a connective ♯γ for each γ ∈ Γ. The term ♯γ(φ1, . . . , φn) is meant to be interpreted as the least fixed point ...
متن کاملFlat modal fixpoint logics with the converse modality
We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Venema. We observe that Santocanale and Venema’s proof that least fixpoints in the Lindenbaum-Tarski algebra of certain flat fixpoint logics are constructive, using finitary adjoints, no longer works when the converse m...
متن کاملFixpoint Logics and Automata: A Coalgebraic Approach
A long and fertile tradition in theoretical computer science, going back to the work of Büchi and Rabin, links the field of (fixpoint) logic to that of automata theory. In particular, automata operating on potentially infinite structures such as streams, trees, graphs or transition systems, provide an invaluable tool for the specification and verification of the ongoing behavior of systems. An ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.04.008