BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Expressiveness of real-time temporal logics - Paul Hunter\, Univer
 sity of Oxford
DTSTART:20120323T140000Z
DTEND:20120323T150000Z
UID:TALK35984@talks.cam.ac.uk
CONTACT:Bjarki Holm
DESCRIPTION:A common dilemma in verification is the trade-off between the 
 expressiveness of a specification language and the computational cost of u
 sing it.  In the realm of logics used to reason about linear time this iss
 ue manifests itself in several ways: over finite and discrete structures t
 his is largely a question about succinctness of representation as most log
 ics 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 e
 xpressive 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.
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR