论文信息 - Data-Structures for the Verification of Timed Automata

Data-Structures for the Verification of Timed Automata

In this paper we suggest numerical decision diagrams a bdd based data structure for representing certain subsets of the Euclidean space namely those encountered in veri cation of timed automata Un like other representation schemes ndd s are canonical and provide for all the necessary operations needed in the veri cation and synthesis of timed automata We report some preliminary experimental results

[1] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2] David L. Dill,et al. Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[3] Kenneth L. McMillan,et al. Symbolic model checking: an approach to the state explosion problem , 1992 .

[4] E. Clarke,et al. Real-time symbolic model checking for discrete time models , 1994 .

[5] Conrado Daws,et al. Verifying ET-LOTOS programmes with KRONOS , 1994, FORTE.

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

[7] Pierre Wolper,et al. An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) , 1995, SAS.

[8] Antoine Rauzy. Toupie = µ-Calculus + Constraints , 1995, CAV.

[9] Amir Pnueli,et al. Timing analysis of asynchronous circuits using timed automata , 1995, CHARME.