52 search results - page 9 / 11 » An institution of modal logics for coalgebras |
116
Voted
PODC
2012
ACM
12 years 12 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
86
Voted
ENTCS
2007
14 years 9 months ago
2007
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
76
Voted
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
75
Voted
ENTCS
2010
14 years 9 months ago
2010
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...