The mu-calculus and Model Checking
J Bradfield, I Walukiewicz - Handbook of Model Checking, 2018 - Springer
This chapter presents that part of the theory of the μ μ-calculus that is relevant to the model-
checking problem as broadly understood. The μ μ-calculus is one of the most important …
checking problem as broadly understood. The μ μ-calculus is one of the most important …
EXPTIME tableaux for the coalgebraic mu-calculus
C Cîrstea, C Kupke, D Pattinson - Logical Methods in …, 2011 - lmcs.episciences.org
The coalgebraic approach to modal logic provides a uniform framework that captures the
semantics of a large class of structurally different modal logics, including eg graded and …
semantics of a large class of structurally different modal logics, including eg graded and …
On guarded transformation in the modal μ-calculus
This article is concerned with the problem of transforming a formula of the modal μ-calculus
into an equivalent guarded formula. Many procedures in the literature explicitly require their …
into an equivalent guarded formula. Many procedures in the literature explicitly require their …
Evidence for fixpoint logic
S Cranen, B Luttik, TAC Willemse - 24th EACSL Annual …, 2015 - drops.dagstuhl.de
For many modal logics, dedicated model checkers offer diagnostics (eg, counterexamples)
that help the user understand the result provided by the solver. Fixpoint logic offers a …
that help the user understand the result provided by the solver. Fixpoint logic offers a …
On closure ordinals for the modal mu-calculus
B Afshari, GE Leigh - Computer Science Logic 2013 (CSL 2013), 2013 - drops.dagstuhl.de
The closure ordinal of a formula of modal mu-calculus mu X phi is the least ordinal kappa, if
it exists, such that the denotation of the formula and the kappa-th iteration of the monotone …
it exists, such that the denotation of the formula and the kappa-th iteration of the monotone …
A decidable non-regular modal fixpoint logic
Abstract Fixpoint Logic with Chop (FLC) extends the modal μ-calculus with an operator for
sequential composition between predicate transformers. This makes it an expressive modal …
sequential composition between predicate transformers. This makes it an expressive modal …
A circular proof system for the hybrid mu-calculus
S Enqvist - arXiv preprint arXiv:2001.04971, 2020 - arxiv.org
arXiv:2001.04971v3 [cs.LO] 10 Jun 2020 Page 1 A circular proof system for the hybrid μ-calculus
Sebastian Enqvist Department of Philosophy, Stockholm University June 11, 2020 Abstract We …
Sebastian Enqvist Department of Philosophy, Stockholm University June 11, 2020 Abstract We …
Global caching for the flat coalgebraic µ-calculus
D Hausmann, L Schröder - 2015 22nd International …, 2015 - ieeexplore.ieee.org
Branching-time temporal logics generalizing relational temporal logics such as CTL have
been proposed for various system types beyond the purely relational world. This includes …
been proposed for various system types beyond the purely relational world. This includes …
Incremental decision procedures for modal logics with nominals and eventualities
M Kaminski - 2012 - publikationen.sulb.uni-saarland.de
This thesis contributes to the study of incremental decision procedures for modal logics with
nominals and eventualities. Eventualities are constructs that allow to reason about the …
nominals and eventualities. Eventualities are constructs that allow to reason about the …
On parity game preorders and the logic of matching plays
MW Gazda, TAC Willemse - International Conference on Current Trends in …, 2016 - Springer
Parity games can be used to solve satisfiability, verification and controller synthesis
problems. As part of an effort to better understand their nature, or the nature of the problems …
problems. As part of an effort to better understand their nature, or the nature of the problems …