A Classification of Symbolic Transition Systems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
21 pages

Keywords

Logic in Computer Science, F.3.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30509

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0101013
 http://arxiv.org/abs/cs/0101013

Collections

arXiv