Data-Structures for Verification of Timed Automata

Eugene Asarin (1) , Marius Bozga (2) , Alain Kerbrat (2) , Oded Maler (2) , Amir Pnueli (3) , Anne Rasse (2)

1 IITP - Institute for Information Transmission Problems
2 VERIMAG - IMAG - VERIMAG
3 Department of Computer Science and Applied Mathematics [Rehovot]

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.

Mots clés: timed automata; numerical decision diagrams; symbolic verification

Domaines: Systèmes embarqués

Eugene Asarin, Marius Bozga, Alain Kerbrat, Oded Maler, Amir Pnueli, et al.. Data-Structures for Verification of Timed Automata. Hybrid and Real-Time Systems International Workshop, HART'97, Mar 1997, Grenoble, France. pp.346--360, ⟨10.1007/BFb0014706⟩. ⟨hal-00374090⟩