Using Implications for Optimizing State Set Representations of Linear Hybrid Systems
暂无分享,去创建一个
[1] Christoph Scholl,et al. Advanced Unbounded CTL Model Checking By Using AIGs, BDD Sweeping, and Quantifier Scheduling , 2006, MBMV.
[2] Armando Tacchella,et al. Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919) , 2004 .
[3] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[5] Goran Frehse,et al. PHAVer: algorithmic verification of hybrid systems past HyTech , 2005, International Journal on Software Tools for Technology Transfer.
[6] Thomas A. Henzinger,et al. HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.
[7] Hardi Hungar,et al. Automatic Verification of Hybrid Systems with Large Discrete State Space , 2006, ATVA.
[8] Hardi Hungar,et al. Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space , 2007, ATVA.
[9] Bruno Dutertre,et al. A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.
[10] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[11] Marco Bozzano,et al. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures , 2005, Journal of Automated Reasoning.
[12] R. Brayton,et al. FRAIGs: A Unifying Representation for Logic Synthesis and Verification , 2005 .
[13] Christoph Scholl,et al. Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling , 2006, 2006 Formal Methods in Computer Aided Design.