On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
C. Baier, N. Bertrand, Ph. Schnoebelen

TL;DR
This paper introduces a finite convergence theorem for fixpoint expressions in well-structured systems, enabling new decidability results for lossy channel systems in regular model checking.
Contribution
It provides a general finite convergence theorem for upward-guarded fixpoints in well-quasi-ordered sets, advancing the analysis of well-structured systems.
Findings
Proves a finite convergence theorem for upward-guarded fixpoints.
Applies theorem to establish new decidability results for lossy channel systems.
Enhances the understanding of fixpoint computations in well-structured model checking.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHermeneutics and Narrative Identity · Aging, Elder Care, and Social Issues · Health, Medicine and Society
