%0 Conference Proceedings
%F BS05-express
%A Bertrand, N.
%A Schnoebelen, Ph.
%T A short visit to the {STS} hierarchy
%B {P}roceedings of the 12th {I}nternational {W}orkshop on {E}xpressiveness in {C}oncurrency ({EXPRESS}'05)
%E Baeten, Jos
%E Phillips, Iain
%V 154
%N 3
%P 59-69
%S Electronic Notes in Theoretical Computer Science
%I Elsevier Science Publishers
%C San Francisco, CA, USA
%X 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
%U http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BS05-express.pdf
%U http://dx.doi.org/10.1016/j.entcs.2006.05.007
%8 July
%D 2006