A Classification of Symbolic Transition Systems

Simple item page
dc.creatorHenzinger, Thomas A.
dc.creatorMajumdar, Rupak
dc.creatorRaskin, Jean-Francois
dc.date2001-01-16
dc.date.accessioned2026-07-07T03:16:51Z
dc.date.available2026-07-07T03:16:51Z
dc.descriptionWe 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.
dc.description21 pages
dc.identifierhttps://arxiv.org/abs/cs/0101013
dc.identifierhttp://arxiv.org/abs/cs/0101013
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30509
dc.subjectLogic in Computer Science
dc.subjectF.3.1
dc.titleA Classification of Symbolic Transition Systems
dc.typetext

Files

Collections

arXiv