Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Enqvist, Sebastian"'
Autor:
Enqvist, Sebastian, Goranko, Valentin
We introduce and study a natural extension of the Alternating time temporal logic ATL, called Temporal Logic of Coalitional Goal Assignments (TLCGA). It features just one, but quite expressive, coalitional strategic operator, viz. the coalitional goa
Externí odkaz:
http://arxiv.org/abs/2012.14195
Autor:
Enqvist, Sebastian
We present a circular and cut-free proof system for the hybrid mu-calculus and prove its soundness and completeness. The system uses names for fixpoint unfoldings, like the circular proof system for the mu-calculus previously developed by Stirling.
Externí odkaz:
http://arxiv.org/abs/2001.04971
Game logic was introduced by Rohit Parikh in the 1980s as a generalisation of propositional dynamic logic (PDL) for reasoning about outcomes that players can force in determined 2-player games. Semantically, the generalisation from programs to games
Externí odkaz:
http://arxiv.org/abs/1904.07691
Autor:
Enqvist, Sebastian, Venema, Yde
Publikováno v:
Logical Methods in Computer Science, Volume 15, Issue 1 (August 23, 2022) lmcs:4038
We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in th
Externí odkaz:
http://arxiv.org/abs/1710.10706
Autor:
Enqvist, Sebastian
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 fixpoi
Externí odkaz:
http://arxiv.org/abs/1710.04628
Publikováno v:
EPTCS 251, 2017, pp. 57-74
We revisit the crucial issue of natural game equivalences, and semantics of game logics based on these. We present reasons for investigating finer concepts of game equivalence than equality of standard powers, though staying short of modal bisimulati
Externí odkaz:
http://arxiv.org/abs/1707.08737
Publikováno v:
Logical Methods in Computer Science, Volume 13, Issue 2 (July 3, 2017) lmcs:3756
Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas. More speci
Externí odkaz:
http://arxiv.org/abs/1704.08637
We characterize the expressive power of the modal mu-calculus on monotone neighborhood structures, in the style of the Janin-Walukiewicz theorem for the standard modal mu-calculus. For this purpose we consider a monadic second-order logic for monoton
Externí odkaz:
http://arxiv.org/abs/1502.07889
Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees, we provide
Externí odkaz:
http://arxiv.org/abs/1501.07215
Autor:
Enqvist, Sebastian, Sourabh, Sumit
We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [4]. The main result of our paper is that bisimulation for
Externí odkaz:
http://arxiv.org/abs/1412.4586