Reachability Checking of Finite Precision Timed Automata
暂无分享,去创建一个
Xu Yu-bo | Yan Rong-jie | Rongjie Yan | Liu Chunming | Li Guang-Yuan | Tang Zhi-Song | Tang Zs | Rongjie Yan | L. Chunming | Yan Rong-jie | Li Guang-yuan | Xu Yu-bo | Tang Zhi-song | Tang Zs | Tang Zs
[1] Dirk Beyer,et al. Rabbit: A Tool for BDD-Based Verification of Real-Time Systems , 2003, CAV.
[2] P. Varaiya,et al. Discretization of timed automata , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.
[3] Pierre-Yves Schobbens,et al. Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time , 1997, TACAS.
[4] Wang Yi,et al. Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.
[5] Wang Yi,et al. Partial Order Reductions for Timed Systems , 1998, CONCUR.
[6] Wang Yi,et al. Efficient Timed Reachability Analysis Using Clock Difference Diagrams , 1998, CAV.
[7] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[8] Farn Wang,et al. Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.
[9] Stavros Tripakis,et al. The Tool KRONOS , 1996, Hybrid Systems.
[10] Amir Pnueli,et al. Some Progress in the Symbolic Verification of Timed Automata , 1997, CAV.
[11] Stavros Tripakis,et al. Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.
[12] Wang Yi,et al. UPPAAL Implementation Secrets , 2002, FTRTFT.
[13] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[14] Philippe Schnoebelen,et al. Systems and Software Verification, Model-Checking Techniques and Tools , 2001 .
[15] Gerd Behrmann,et al. Adding Symmetry Reduction to Uppaal , 2003, FORMATS.
[16] L. Thiele,et al. Symbolic model checking of process networks using interval diagram techniques , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).
[17] Farn Wang,et al. Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems , 2000, TACAS.
[18] Amir Pnueli,et al. Data-Structures for the Verification of Timed Automata , 1997, HART.
[19] Conrado Daws,et al. Reducing the number of clock variables of timed automata , 1996, RTSS.
[20] Oscar H. Ibarra,et al. Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.
[21] Joost P. Katoen,et al. Concepts, Algorithms, and Tools for Model Checking , 1999 .
[22] Thomas A. Henzinger,et al. A really temporal logic , 1989, 30th Annual Symposium on Foundations of Computer Science.
[23] Leslie Lamport,et al. A fast mutual exclusion algorithm , 1987, TOCS.
[24] Howard Falk,et al. Formal Verification of Timed Systems: A Survey and Perspective , 2004, Proc. IEEE.
[25] Farn Wang,et al. Region Encoding Diagram for fully symbolic verification of real-time systems , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.
[26] Dragan Bosnacki,et al. A Heuristic for Symmetry Reductions with Scalarsets , 2001, FME.
[27] Wang Yi,et al. Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.