Generalizing the Discrete Timed Automaton

Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in parallel.

• Type: Conference
• Year: 2000
• Where: WIA
• Authors: Oscar H. Ibarra, Jianwen Su
• Keywords: Artificial Intelligence, Binary Reachability, Data Structures, Discrete Timed Automata, WIA 2000