English

Algorithmic Verification of Continuous and Hybrid Systems

Systems and Control 2014-03-06 v1 Formal Languages and Automata Theory Logic in Computer Science Numerical Analysis

Abstract

We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes replace an infinite number of simulations.

Keywords

Cite

@article{arxiv.1403.0952,
  title  = {Algorithmic Verification of Continuous and Hybrid Systems},
  author = {Oded Maler},
  journal= {arXiv preprint arXiv:1403.0952},
  year   = {2014}
}

Comments

In Proceedings INFINITY 2013, arXiv:1402.6610

R2 v1 2026-06-22T03:20:14.761Z