Selected publications at LSV: 2009

FG09: A. Finkel and J. Goubault-Larrecq. Forward Analysis for WSTS, Part I: Completions. In Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS'09), Freiburg, Germany, February 2009, Leibniz International Proceedings in Informatics 3, pages 433-444. Leibniz-Zentrum für Informatik. ( PDF )

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.

`@inproceedings{FGL-stacs2009,`
	`address =`	`{Freiburg, Germany},`
	`author =`	`{Finkel, Alain and Goubault{-}Larrecq, Jean},`
	`booktitle =`	`{{P}roceedings of the 26th {A}nnual {S}ymposium on {T}heoretical {A}spects of {C}omputer {S}cience ({STACS}'09)},`
	`editor =`	`{Albers, Susanne and Marion, Jean-Yves},`
	`month =`	`feb,`
	`pages =`	`{433-444},`
	`publisher =`	`{Leibniz-Zentrum f{\"u}r Informatik},`
	`series =`	`{Leibniz International Proceedings in Informatics},`
	`title =`	`{Forward Analysis for~{WSTS}, Part~{I}: Completions},`
	`url =`	`{http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FGL-stacs2009.pdf},`
	`volume =`	`{3},`
	`year =`	`{2009},`
`}`

About LSV