Unifying B\"uchi Complementation Constructions
Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation. The first is the rank-based approach of Kupferman and Vardi, which operates over a DAG that em...
Sparad:
| Huvudupphov: | , , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
Logical Methods in Computer Science e.V.
2013-03-01
|
| Serie: | Logical Methods in Computer Science |
| Ämnen: | |
| Länkar: | https://lmcs.episciences.org/1179/pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|