Zobrazeno 1 - 10
of 99
pro vyhledávání: '"Kupke, Clemens"'
$\Omega$-automata and Wilke algebras are formalisms for characterising $\omega$-regular languages via their ultimately periodic words. $\Omega$-automata read finite representations of ultimately periodic words, called lassos, and they are a subclass
Externí odkaz:
http://arxiv.org/abs/2407.14115
We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an initial algebra
Externí odkaz:
http://arxiv.org/abs/2405.00237
Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability for a wide
Externí odkaz:
http://arxiv.org/abs/2404.16588
We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find sufficient co
Externí odkaz:
http://arxiv.org/abs/2310.03445
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and F-algebras. We
Externí odkaz:
http://arxiv.org/abs/2303.02065
Publikováno v:
EPTCS 346, 2021, pp. 291-307
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula. These disjunctive formulas have g
Externí odkaz:
http://arxiv.org/abs/2109.08310
A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be reasoned about (probabilistic, cyber-physical, etc.), the focus shifted to quantitative set
Externí odkaz:
http://arxiv.org/abs/2105.10164
Autor:
Atkey, Robert, Gavranović, Bruno, Ghani, Neil, Kupke, Clemens, Ledent, Jérémy, Forsberg, Fredrik Nordvall
Publikováno v:
EPTCS 333, 2021, pp. 198-214
We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model equilibria as a b
Externí odkaz:
http://arxiv.org/abs/2101.12045
We discuss and compare complexity measures for the modal $\mu$-calculus, focusing on size and alternation depth. As a yardstick we take Wilke's alternating tree automata, which we shall call parity formulas in the text. Building on work by Bruse, Fri
Externí odkaz:
http://arxiv.org/abs/2010.14430
Publikováno v:
EPTCS 323, 2020, pp. 95-105
We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category, which can b
Externí odkaz:
http://arxiv.org/abs/2009.06831