BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260901T015405Z
UID:Seminar-dept-281@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20120327T160000
DTEND:20120327T170000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Nathalie Bertrand: Determinizing timed automata\n\nTimed automata are a popular model for real-time systems, that extend finite automata with clocks that can be tested and reset. Unfortunately, unlike finite automata, timed automata cannot be determinized in general. In this talk we will survey two approaches to overcome this difficulty. First of all, we present a generic determinization procedure that is applicable to all know determinizable subclasses. Second, we report on an approximate determinization algorithm based on the resolution of a simple safety game.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=281
LOCATION:G12
END:VEVENT
END:VCALENDAR