Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Bisimulation for probabilistic transition systems: a coalgebraic approach
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
From modal logic to terminal coalgebras
Theoretical Computer Science
Modal logic
Bialgebraic Modelling of Timed Processes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
On the final sequence of a finitary set functor
Theoretical Computer Science
Software Engineering: Report of a conference sponsored by the NATO Science Committee, Garmisch, Germany, 7-11 Oct. 1968, Brussels, Scientific Affairs Division, NATO
Coalgebraic Modal Logic Beyond Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Games for Coalgebraic Fixed Point Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Presenting functors on many-sorted varieties and applications
Information and Computation
Probabilistic Logical Characterization
Information and Computation
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the fusion of coalgebraic 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
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 5.23 |
We present a modular approach to defining logics for a wide variety of state-based systems. The systems are modelled as coalgebras, and we use modal logics to specify their observable properties. We show that the syntax, semantics and proof systems associated with such logics can all be derived in a modular fashion. 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, for which no complete axiomatisation has been obtained so far.