论文信息 - Generalizing the Discrete Timed Automaton

Generalizing the Discrete Timed Automaton

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.

Oscar H. Ibarra | Jianwen Su | O. Ibarra | Jianwen Su

[1] Oscar H. Ibarra,et al. Reachability Analysis for Some Models of Infinite-State Transition Systems , 2000, CONCUR.

[2] Hubert Comon-Lundh,et al. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[3] Oscar H. Ibarra,et al. Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.

[4] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[5] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[6] Luca Breveglieri,et al. Multi-Push-Down Languages and Grammars , 1996, Int. J. Found. Comput. Sci..

[7] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[8] Ahmed Bouajjani,et al. On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures , 1994, Hybrid Systems.

[9] Panos J. Antsaklis,et al. Hybrid Systems II , 1994, Lecture Notes in Computer Science.

[10] Zhe Dang,et al. Debugging and verification of infinite state real-time systems , 2000 .

[11] Hubert Comon-Lundh,et al. Timed Automata and the Theory of Real Numbers , 1999, CONCUR.