Bisimulation through probabilistic testing
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Modal logic
Reasoning about Uncertainty
ε-connections of abstract description systems
Artificial Intelligence
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A finite model construction for coalgebraic modal logic
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Weak bisimulations for the Giry monad
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Weak bisimulations for the giry monad†
Mathematical Structures in Computer Science
A stochastic interpretation of propositional dynamic logic: expressivity
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Coalgebraic logic over general measurable spaces ??? a survey
Mathematical Structures in Computer Science
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Generalized product of coalgebraic hybrid logics
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Optimal tableau algorithms for coalgebraic logics
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Global caching for coalgebraic description logics
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |
State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism 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 state-based systems as multi-sorted 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.