Forward analysis and model checking for trace bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the trace bounded—in the sense of Ginsburg and Spanier (1964), [1]—complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]....
Saved in:
Published in | Theoretical computer science Vol. 637; pp. 1 - 29 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
18.07.2016
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We investigate a subclass of well-structured transition systems (WSTS), the trace bounded—in the sense of Ginsburg and Spanier (1964), [1]—complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]. Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.
•The trace boundedness is decidable for complete deterministic WSTS.•The downward-closure of the reachability set is computable for trace bounded complete deterministic WSTS.•Action-based LTL model-checking is decidable for trace bounded complete deterministic WSTS.•State-based LTL model-checking is undecidable for trace bounded complete deterministic WSTS. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/j.tcs.2016.04.020 |