Specifying coalgebras with modal logic
Theoretical Computer Science
From modal logic to terminal coalgebras
Theoretical Computer Science
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Final sequences and final coalgebras for measurable spaces
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
ACM SIGACT News
Hi-index | 0.00 |
We prove that every functor on the category Meas of measurable spaces built from the identity and constant functors using products, coproducts, and the probability measure functor Δ has a final coalgebra. Our work builds on the construction of the universal Harsanyi type spaces by Heifetz and Samet and papers by Rößiger and Jacobs on coalgebraic modal logic. We construct logical languages, probabilistic logics of transition systems, and interpret them on coalgebras. The final coalgebra is carried by the set of descriptions of all points in all coalgebras. For the category Set, we work with the functor D of discrete probability measures. We prove that every functor on Set built from D and the expected functors has a final coalgebra. The work for Set differs from the work for Meas: negation is needed for final coalgebras on Set but not for Meas.