Skip to content
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

Jump to bottom

Rewrite and reduce ATL formula #214

Open
NicEastvillage opened this issue Aug 10, 2023 · 1 comment
Open

Rewrite and reduce ATL formula #214

NicEastvillage opened this issue Aug 10, 2023 · 1 comment
Labels
enhancement New feature or request

Comments

@NicEastvillage
Copy link
Contributor

Many optimizations can be done by rewriting the ATL formula. If we can reduce it to simply true or false then we do not even need to run the certain-zero algorithm. This feature requires an investigation of boolean formula equivalences and an extensible design that can apply rewriting rules repeatedly.

A few example rewrites:

  • A & !A → false
  • A | !A → true
  • A & (A | B) → A
  • A & (!A | B) → A & B
  • <<p1>> (true U A) → <<p1>> F A
  • <<p1>> F false → false
  • ...
@NicEastvillage NicEastvillage added the enhancement New feature or request label Aug 10, 2023
@NicEastvillage
Copy link
Contributor Author

Highly related to #216. Probably same phase of compiler

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@NicEastvillage