A Classification of Symbolic Transition Systems
Logic in Computer Science
2007-05-23 v1
Abstract
We define five increasingly comprehensive classes of infinite-state systems, called STS1--5, whose state spaces have finitary structure. For four of these classes, we provide examples from hybrid systems.
Cite
@article{arxiv.cs/0101013,
title = {A Classification of Symbolic Transition Systems},
author = {Thomas A. Henzinger and Rupak Majumdar and Jean-Francois Raskin},
journal= {arXiv preprint arXiv:cs/0101013},
year = {2007}
}
Comments
21 pages