Forward analysis for WSTS, Part I: Completions - Computer Science > Logic in Computer ScienceReportar como inadecuado




Forward analysis for WSTS, Part I: Completions - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Well-structured transition systems provide the right foundation to compute afinite basis of the set of predecessors of the upward closure of a state. Thedual problem, to compute a finite representation of the set of successors ofthe downward closure of a state, is harder: Until now, the theoreticalframework for manipulating downward-closed sets was missing. We answer thisproblem, using insights from domain theory dcpos and ideal completions, fromtopology sobrifications, and shed new light on the notion of adequate domainsof limits.



Autor: Alain Finkel LSV, Jean Goubault-Larrecq LSV

Fuente: https://arxiv.org/







Documentos relacionados