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

## Path-Based Coalgebraic Temporal LogicsAdd to your list(s) Download to your calendar using vCal - Corina Cirstea, University of Southampton
- Friday 06 November 2009, 14:00-15:00
- UG40 Computer Science.
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. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- UG40 Computer Science
- computer sience
Note that ex-directory lists are not shown. |
## Other listsFeatured talks Combinatorics and Probability Seminar School of Mathematics Events## Other talksHidden Markov Model in Multiple Testing on Dependent Data Module tensor categories and the Landau-Ginzburg/conformal field theory correspondence Energy release and transport in solar eruptive events Structured Decompositions: recursive data and recursive algorithms TBC TBC |