Sciweavers

FM
2001
Springer
89views Formal Methods» more  FM 2001»
13 years 9 months ago
Test-Case Calculation through Abstraction
Bernhard K. Aichernig
FM
2001
Springer
108views Formal Methods» more  FM 2001»
13 years 9 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer