Generalizations of two basic notions in timed automata

Activity: Talk or presentationTalk at workshop, seminar or courseScience to science


A timed automaton (TA) is an abstract model of real-time systems. It has the form of a finite automaton extended with clocks that measure the time that elapsed since past events in order to control the triggering of future events. I will talk on generalizations of two basic notions in the theory of timed automata. One is the timestamp of a TA, which generalizes the notion of reachability. The timestamp is the set of all times at which events occur when considering all feasible runs of the TA. The other notion is that of conformance distance between two timed automata, generalizing the binary notion of inclusion/non-inclusion of the language defined by one TA in the language of another TA
Period25 Feb 2020
Event titleHenzinger Group Seminar, IST Austria
Event typeSeminar
LocationAustriaShow on map