Results 1  10
of
28
PSPACE bounds for rank 1 modal logics
 IN LICS’06
, 2006
"... For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a sh ..."
Abstract

Cited by 25 (15 self)
 Add to MetaCart
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACEbounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant prooftheoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way.
A Finite Model Construction For Coalgebraic Modal Logic
"... In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness result ..."
Abstract

Cited by 24 (16 self)
 Add to MetaCart
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal logic admits a complete axiomatization of rank 1; it also enables us to establish a generic decidability result and a first complexity bound. Examples covered by these general results include, besides standard HennessyMilner logic, graded modal logic and probabilistic modal logic.
Modular construction of modal logics
 Concurrency Theory, CONCUR 04, volume 3170 of Lect. Notes Comput. Sci
, 2004
"... Abstract. We present a modular approach to defining logics for a wide variety of statebased systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
Abstract. We present a modular approach to defining logics for a wide variety of statebased systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems. 1
Algebraiccoalgebraic specification in CoCasl
 J. LOGIC ALGEBRAIC PROGRAMMING
, 2006
"... We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criter ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criteria for the existence of cofree models, also for several variants of nested cofree and free specifications. Moreover, we describe an extension of the existing proof support for Casl (in the shape of an encoding into higherorder logic) to CoCasl.
Modular algorithms for heterogeneous modal logics
 IN AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP 07, VOL. 4596 OF LNCS
, 2007
"... Statebased systems and modal logics for reasoning about them often heterogeneously combine a number of features such as nondeterminism and probabilities. Here, we show that the combination of features can be reflected algorithmically and develop modular decision procedures for heterogeneous modal ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
Statebased systems and modal logics for reasoning about them often heterogeneously combine a number of features such as nondeterminism and probabilities. Here, we show that the combination of features can be reflected algorithmically and develop modular decision procedures for heterogeneous modal logics. The modularity is achieved by formalising the underlying statebased systems as multisorted coalgebras and associating both a logical and an algorithmic description to a number of basic building blocks. Our main result is that logics arising as combinations of these building blocks can be decided in polynomial space provided that this is the case for the components. By instantiating the general framework to concrete cases, we obtain PSPACE decision procedures for a wide variety of structurally different logics, describing e.g. Segala systems and games with uncertain information.
Coalgebraic Modal Logic of Finite Rank
, 2002
"... This paper studies coalgebras from the perspective of finite observations. We introduce the notion of finite step equivalence and a corresponding category with finite step equivalencepreserving morphisms. This category always has a final object, which generalises the canonical model construction fr ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
This paper studies coalgebras from the perspective of finite observations. We introduce the notion of finite step equivalence and a corresponding category with finite step equivalencepreserving morphisms. This category always has a final object, which generalises the canonical model construction from Kripke models to coalgebras. We then turn to logics whose formulae are invariant under finite step equivalence, which we call logics of rank . For these logics, we use topological methods and give a characterisation of compact logics and definable classes of models.
Rank1 modal logics are coalgebraic
 IN STACS 2007, 24TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, PROCEEDINGS
, 2007
"... Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of coalgebras for an endofunctor can always be axiomatised in rank 1. Here we establish the converse, i.e. every rank 1 modal logic has a sound and strongly complete coal ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of coalgebras for an endofunctor can always be axiomatised in rank 1. Here we establish the converse, i.e. every rank 1 modal logic has a sound and strongly complete coalgebraic semantics. As a consequence, recent results on coalgebraic modal logic, in particular generic decision procedures and upper complexity bounds, become applicable to arbitrary rank 1 modal logics, without regard to their semantic status; we thus obtain purely syntactic versions of these results. As an extended example, we apply our framework to recently defined deontic logics.
Ultrafilter extensions for coalgebras
 In Algebra and Coalgebra in Computer Science, volume 3629 of LNCS
, 2005
"... Abstract. This paper studies finitary modal logics as specification languages for Setcoalgebras (coalgebras on the category of sets) using Stone duality. It is wellknown that Setcoalgebras are not semantically adequate for finitary modal logics in the sense that bisimilarity does not in general co ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
Abstract. This paper studies finitary modal logics as specification languages for Setcoalgebras (coalgebras on the category of sets) using Stone duality. It is wellknown that Setcoalgebras are not semantically adequate for finitary modal logics in the sense that bisimilarity does not in general coincide with logical equivalence.
ON MINIMAL COALGEBRAS
"... Abstract. We define an outdegree for Fcoalgebras and show that the coalgebras of outdegree at most κ form a covariety. As a subcategory of all Fcoalgebras, this class has a terminal object, which for many problems can stand in for the terminal Fcoalgebra, which need not exist in general. As exam ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. We define an outdegree for Fcoalgebras and show that the coalgebras of outdegree at most κ form a covariety. As a subcategory of all Fcoalgebras, this class has a terminal object, which for many problems can stand in for the terminal Fcoalgebra, which need not exist in general. As examples, we derive structure theoretic results about minimal coalgebras, showing that, for instance minimization of coalgebras is functorial, that products of finitely many minimal coalgebras exist and are given by their largest common subcoalgebra, that minimal subcoalgebras have no inner endomorphisms and show how minimal subcoalgebras can be constructed from Mooreautomata. Since the elements of minimal subcoalgebras must correspond uniquely to the formulae of any logic characterizing observational equivalence, we give in the last section a straightforward and selfcontained account of the coalgebraic logic of D. Pattinson and L. Schröder, which we believe is simpler and more direct than the original exposition. For every automaton A there exists a minimal automaton ∇(A), which displays
A coalgebraic approach to the semantics of the ambient calculus
 ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE
, 2005
"... Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example is the ambient calculus. Due to the complexity of the involved spatial reduction, there is — in contrast to the situatio ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example is the ambient calculus. Due to the complexity of the involved spatial reduction, there is — in contrast to the situation in standard process algebra — up to now no satisfying coalgebraic representation of a mobile process calculus. Here, we discuss a coalgebraic denotational semantics for the ambient calculus, viewed as a step towards a generic coalgebraic framework for modelling mobile systems. Crucial features of our modelling are a set of GSOS style transition rules for the ambient calculus, a hardwiring of the socalled hardening relation in the functorial signature, and a setbased treatment of hidden name sharing. The formal representation of this framework is cast in the algebraiccoalgebraic specification language CoCasl.