Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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.
Nathalie Bertrand
nathalie.bertrand@irisa.fr
@InProceedings{BS05-express,
Author = {Bertrand, N. and Schnoebelen, Ph.},
Title = {A short visit to the {STS} hierarchy},
BookTitle = {{P}roceedings of the 12th {I}nternational {W}orkshop on {E}xpressiveness in {C}oncurrency ({EXPRESS}'05)},
editor = {Baeten, Jos and Phillips, Iain},
Volume = {154},
Number = {3},
Pages = {59--69},
Series = {Electronic Notes in Theoretical Computer Science},
Publisher = {Elsevier Science Publishers},
Address = {San Francisco, CA, USA},
Month = {July},
Year = {2006}
}
Get EndNote Reference (.ref)