Computer Science – Symbolic Computation
Scientific paper
2006-06-21
Proc. LPAR 2006, LNCS 4246, pp. 347-361, Springer 2006
Computer Science
Symbolic Computation
16 pages
Scientific paper
10.1007/11916277_24
We prove a general finite convergence theorem for "upward-guarded" fixpoint
expressions over a well-quasi-ordered set. This has immediate applications in
regular model checking of well-structured systems, where a main issue is the
eventual convergence of fixpoint computations. In particular, we are able to
directly obtain several new decidability results on lossy channel systems.
Baier Christel
Bertrand Nathalie
Schnoebelen Ph.
No associations
LandOfFree
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems 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 On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-621790