|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Expressiveness of real-time temporal logics
If you have a question about this talk, please contact Bjarki Holm.
A common dilemma in verification is the trade-off between the expressiveness of a specification language and the computational cost of using it. In the realm of logics used to reason about linear time this issue manifests itself in several ways: over finite and discrete structures this is largely a question about succinctness of representation as most logics are decidable and many are equi-expressible; but over continuous and timed domains there is a clear distinction between expressive completeness and decidability. One consequence of this distinction is the development of many different temporal logics for timed systems, each with varying expressive capabilities. In this talk I will survey the descriptive power of some of these temporal logics and discuss the translation of classical expressiveness results into the exotic world of timed domains.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsComputing and Mathematics Institute of Astronomy Galaxies Discussion Group ICE Research Seminar Series
Other talksCurve fitting, errors and analysis of binding data Cambridge Assessment Network: Alternatives to written examinations Oi! Scientology! Church Of Fear roadshow. Winton 2nd Annual Symposium on Materials Discovery Risk and uncertainty in radiotherapy. Why I am the weakest link? CCE Seminar - Caribbean Poetry Project (title to be confirmed)