Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach [chapter]

Corina Cîrstea
2011 Lecture Notes in Computer Science  
We extend the theory of maximal traces of pointed nondeterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras. We then consider linear coalgebraic temporal logics interpreted over non-deterministic coalgebras, and show how to reduce the model checking problem for such logics to the problem of deciding the winner in a regular two-player game. Our approach is inspired by the automata-theoretic approach to model checking Linear Temporal Logic over transition systems.
doi:10.1007/978-3-642-22944-2_10 fatcat:huuv42pksjantav2zxy5bhesbe