Forward analysis for WSTS, Part I: Completions

Details Forward analysis for WSTS, Part I: Completions Forward analysis for WSTS, Part I: Completions

2009-02-10

arxiv.org/abs/0902.1587v1

26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 433-444

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Forward analysis for WSTS, Part I: Completions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Forward analysis for WSTS, Part I: Completions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Forward analysis for WSTS, Part I: Completions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19675