Hybrid and Real-Time Systems
Oded Maler · 1997
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 verification of timed automata. Unlike other representation schemes, NDD's are canonical and provide for all necessary operations needed in the verification and synthesis of timed automata. We report some preliminary experimental results.