@inproceedings{853f221ee2094738be19fe978dc7dc42,
title = "SMT-based verification of hybrid systems",
abstract = "Hybrid automata networks (HAN) are a powerful formalism to model complex embedded systems. In this paper, we survey the recent advances in the application of Satisfiability Modulo Theories (SMT) to the analysis of HAN. SMT can be seen as an extended form of Boolean satisfiability (SAT), where literals are interpreted with respect to a background theory (e.g. linear arithmetic). HAN can be symbolically represented by means of SMT formulae, and analyzed by generalizing to the case of SMT the traditional model checking algorithms based on SAT.",
author = "Alessandro Cimatti and Sergio Mover and Stefano Tonetta",
year = "2012",
month = nov,
day = "7",
language = "English",
isbn = "9781577355687",
series = "Proceedings of the National Conference on Artificial Intelligence",
pages = "2100--2105",
booktitle = "AAAI-12 / IAAI-12 - Proceedings of the 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference",
note = "26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12 ; Conference date: 22-07-2012 Through 26-07-2012",
}