Article ID Journal Published Year Pages File Type
423132 Electronic Notes in Theoretical Computer Science 2006 11 Pages PDF
Abstract

The hierarchy of Symbolic Transition Systems, introduced by Henzinger, Majumdar and Raskin, is an elegant classification tool for some families of infinite-state operational models that support some variants of a symbolic “backward closure” verification algorithm. It was first used and illustrated with families of hybrid systems.In this paper we investigate whether the STS hierarchy can account for classical families of infinite-state systems outside of timed or hybrid systems.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics