A Short Visit to the STS Hierarchy

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. Key words: Symbolic transition systems, well-structured transition systems, STS hierarchy.

• Type: Journal
• Year: 2006
• Where: ENTCS
• Authors: Nathalie Bertrand, Ph. Schnoebelen
• Keywords: Elegant Classification Tool, ENTCS 2006, Infinite-state Operational Models, Symbolic Transition Systems