Skip to main content
Conference Proceedings

Fundamental structures in well-structured infinite transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1380 102-118
DOI: 10.1007/bfb0054314
28Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We suggest a simple and clean definition for Well-Structured Transition Systems [20,1], a general class of infinite state systems for which decidability results exist. As a consequence we can (1) generalize the definition in many ways, (2) find examples of (general) WSTS's in many fields, and (3) present new decidability results.

Cite

CITATION STYLE

APA

Finkel, A., & Schnoebelen, P. (1998). Fundamental structures in well-structured infinite transition systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1380, pp. 102–118). Springer Verlag. https://doi.org/10.1007/bfb0054314

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free