Talks & Seminars
Title: Analyzing Timed Systems Using Tree Automata
Prof. Paul Gastin,
Date & Time: November 25, 2016 13:45
Venue: SIC 201, 02nd Floor, C Block, Dept. of CSE, Kanwal Rekhi Bldg
Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new technique to analyze such timed systems. The main idea is to consider timed behaviors as graphs with matching edges capturing timing constraints. As an example, we develop the technique on timed pushdown systems. We show that their behaviors are graphs of bounded tree-width. Hence, they can be interpreted in trees opening the way to tree automata based techniques which are more powerful than analysis based on word automata. The technique is quite general and applies to many timed systems. Joint work with S. Akshay and S. Krishna from IIT Bombay, extended abstract at CONCUR’16.
Speaker Profile:
Details about him are available at: http://www.lsv.ens-cachan.fr/~gastin/
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback