University of Birmingham > Talks@bham > Theoretical computer science seminar > Path-Based Coalgebraic Temporal Logics

Path-Based Coalgebraic Temporal Logics

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Paul Levy.

I will give a general coalgebraic account of the notions of infinite trace and infinite execution path in state-based, dynamical systems, by extending the generic theory of finite traces developed by Hasuo and coauthors. I will subsequently introduce path-based temporal (including fixpoint) logics for coalgebras, whose semantics is based upon the notion of infinite execution. This approach instantiates to both nondeterministic and stochastic computations, yielding, in particular, path-based fixpoint logics in the style of CTL * for nondeterministic systems, and generalisations of the logic PCTL for probabilistic systems.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.