Abstract
In this paper we show how to translate bounded-length verification problems for timed automata into formulae in difference logic, a propositional logic enriched with timing constraints. We describe the principles of a satisfiability checker specialized for this logic that we have implemented and report some preliminary experimental results.
Cite
CITATION STYLE
Niebert, P., Mahfoudh, M., Asarin, E., Bozga, M., Maler, O., & Jain, N. (2002). Verification of timed automata via satisfiability checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2469, pp. 225–243). Springer Verlag. https://doi.org/10.1007/3-540-45739-9_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
