Skip to content

feat: prove that the Buchi congruence has the saturation property#325

Open
ctchou wants to merge 50 commits intoleanprover:mainfrom
ctchou:buchi-saturation
Open

feat: prove that the Buchi congruence has the saturation property#325
ctchou wants to merge 50 commits intoleanprover:mainfrom
ctchou:buchi-saturation

Conversation

@ctchou
Copy link
Contributor

@ctchou ctchou commented Feb 6, 2026

This PR proves that the Buchi congruence introduced in #278 has the saturation property defined in Cslib.Foundations.Data.Set.Saturation. More precisely, the family of omega-languages of the form U * V^ω, where U and V are equivalence classes of the Buchi congruence, saturates the omega-language accepted by the underlying Buchi automaton. This proof is the hardest step in proving the closure of ω-regular languages under complementation and explains why the Buchi congruence is defined the way it is. Some miscellaneous results about LTS and infinite sequences that are needed by the proof are also added.

fmontesi and others added 30 commits January 11, 2026 13:15
Copy link
Collaborator

@chenson2018 chenson2018 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

As I mention I've not fully reviewed buchiFamily_saturation, but here is an initial review.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants

Comments