Skip to content

69 ideals and sheep #74

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Numero7 merged 2 commits into from
Apr 3, 2025
Merged

69 ideals and sheep #74

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d6c7e0c
refactoring
Numero7 Apr 2, 2025
b86bca7
added missing file
Numero7 Apr 2, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ and other coordinates are ω (see Algorithm 1 in the paper for further details).
The fixpoint computation makes use of a subprocedure: an algorithm solving the so-called `path problem`.
Given a symbolic arena and a (finite) set of abstract configurations F in the arena,
this problem asks whether, from every finite configuration of the arena,
there exists a path within the arena that reaches a configuration in (the ideal generated by) F.
there exists a path within the arena that reaches a configuration in (the downward-closed set generated by) F.
This is solved by computing a semigroup called the symbolic flow semigroup (see Theorem 26 in the paper for further details).

## Quick start
Expand Down
Loading
Loading