Efficient Verification of Timed Automata using Dense and Discrete Time SemanticsReport as inadecuate




Efficient Verification of Timed Automata using Dense and Discrete Time Semantics - Download this document for free, or read online. Document in PDF available to download.

1 VERIMAG - IMAG - VERIMAG

Abstract : In this paper we argue that the semantic issues of discrete vs dense time should be separated as much as possible from the pragmatics of state-space representation. Contrary to misconceptions, the discrete semantics is not inherently bound to use state-explosive techniques any more than the dense one. In fact, discrete timed automata can be analyzed using any representation scheme such as DBM used for dense time, and in addition can benefit from enumerative and symbolic techniques such as BDDs which are not naturally applicable to dense time. DBMs, on the other hand, can still be used more efficiently by taking into account the activity of clocks, to eliminate redundancy.

keyword : timed automata model checking discrete-dense semantics clock activity STARI circuit





Author: Marius Bozga - Oded Maler - Stavros Tripakis -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents