Data Structures for the Veri cation 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… (More)


Cite this paper

@inproceedings{Asarin1997DataSF, title={Data Structures for the Veri cation of Timed Automata}, author={Eugene Asarin and Marius Bozga and Alain Kerbrat and Oded Maler and Amir Pnueli and Anne Rasse}, year={1997} }