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

Emptiness checking for arbitrary TELA #13

Open
vhavlena opened this issue Jan 16, 2025 · 0 comments
Open

Emptiness checking for arbitrary TELA #13

vhavlena opened this issue Jan 16, 2025 · 0 comments

Comments

@vhavlena
Copy link
Collaborator

So-far the algorithm for on-the-fly emptiness checking (used for inclusion testing) supports TGBAs only (and hence we cannot plug-in the Pitterman algorithm for nondeterministic components as it produces a parity condition).
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@vhavlena