Theoretical computer science, 2001, Vol.256 (1), p.63-92
2001
Volltextzugriff (PDF)
Details
- Autor(en) / Beteiligte
- Titel
- Well-structured transition systems everywhere
- Ist Teil von
- Theoretical computer science, 2001, Vol.256 (1), p.63-92
- Ort / Verlag
- Elsevier B.V
- Erscheinungsjahr
- 2001
- Quelle
- Alma/SFX Local Collection
- Beschreibungen/Notizen
- Well-structured transition systems (WSTSs) are a general class of infinite-state systems for which decidability results rely on the existence of a well-quasi-ordering between states that is compatible with the transitions. In this article, we provide an extensive treatment of the WSTS idea and show several new results. Our improved definitions allow many examples of classical systems to be seen as instances of WSTSs.
- Sprache
- Englisch
- Identifikatoren
- ISSN: 0304-3975eISSN: 1879-2294DOI: 10.1016/S0304-3975(00)00102-XTitel-ID: cdi_proquest_miscellaneous_27046589
- Format
- –
- Schlagworte
- Infinite systems, Verification, Well-quasi-ordering