License: 
Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1844
URN: urn:nbn:de:0030-drops-18444
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/1844/
Finkel, Alain ;
Goubault-Larrecq, Jean
Forward Analysis for WSTS, Part I: Completions
Abstract
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the downward closure of a state, is harder: Until now, the theoretical framework for manipulating downward-closed sets was missing. We answer this problem, using insights from domain theory (dcpos and ideal completions), from topology (sobrifications), and shed new light on the notion of adequate domains of limits.
BibTeX - Entry
@InProceedings{finkel_et_al:LIPIcs:2009:1844,
author = {Alain Finkel and Jean Goubault-Larrecq},
title = {{Forward Analysis for WSTS, Part I: Completions}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {433--444},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Susanne Albers and Jean-Yves Marion},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/1844},
URN = {urn:nbn:de:0030-drops-18444},
doi = {10.4230/LIPIcs.STACS.2009.1844},
annote = {Keywords: WSTS, Forward analysis, Completion, Karp-Miller procedure, Domain theory, Sober spaces, Noetherian spaces}
}
|
Keywords: |
|
WSTS, Forward analysis, Completion, Karp-Miller procedure, Domain theory, Sober spaces, Noetherian spaces |
|
Collection: |
|
26th International Symposium on Theoretical Aspects of Computer Science |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
19.02.2009 |
