Computer Science Seminar
Date & Time: 4th January, 10:30 AM to 11:30 AM
Venue: Lecture Hall 802
Expressiveness of History-Deterministic Timed Automata
Sougata Bose
University of Liverpool.
04-01-23

---

Abstract

History-deterministic automata are those in which non-determinism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterizations, and history-deterministic specifications allow for game-based verification without an expensive determinization step. We study this notion in the context of timed automata on infinite words and consider the expressive power of HD timed automata with different acceptance conditions such as safety, reachability and co-Buchi