Graded Monad Coalgebras for Continuous-Time Transition Systems
Abstract: Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model continuous-time transition systems. We develop the theory of graded coalgebras-including graded distributive laws between graded monads-and we give conditions for the existence of terminal coalgebras. We define both branching-time and trace semantics, linking them to recent work on Feller-Dynkin processes. Finally, we develop coalgebraic modal logics for both process semantics and state criteria for invariance and expressivity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.