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.

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

More preliminary checks for find_path #135

Open
Mati-AAU opened this issue Dec 14, 2022 · 0 comments
Open

More preliminary checks for find_path #135

Mati-AAU opened this issue Dec 14, 2022 · 0 comments

Comments

@Mati-AAU
Copy link
Contributor

Mati-AAU commented Dec 14, 2022

The find_path algorithm does preliminary checks using the is_trivially_unreachable function in reachability.rs

Currently, these checks are very limited.
More could be added, which would:
Help improve performance, by avoiding to explore the entire state space in cases the end state is unreachable and it can be caught with a preliminary check instead
Help allow better responses for why the end state is unreachable, see #136

We dont have a full overview of what checks could be done, but one big and interesting idea is checking each component individually first.
In a combined transition system, if the end state is not reachable in the individual components, then it is also not reachable in the combined system.
Doing this will be cheaper compared to exploring the combined system, and will also allow error messages such as "Not reachable in component Machine" instead of just saying its not reachable at all.

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

No branches or pull requests

1 participant