Search

• < Previous
• 1
• Next >

---

Unifying B\"uchi Complementation Constructions

Seth J. Fogarty ; Orna Kupferman ; Thomas Wilke ; Moshe Y. Vardi.

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&nbsp;[&hellip;]

---

Flow Logic

Orna Kupferman ; Gal Vardi.

Flow networks have attracted a lot of research in computer science. Indeed, many questions in numerous application areas can be reduced to questions about flow networks. Many of these applications would benefit from a framework in which one can formally reason about properties of flow networks that&nbsp;[&hellip;]

---

Minimization and Canonization of GFG Transition-Based Automata

Bader Abu Radi ; Orna Kupferman.

While many applications of automata in formal methods can use nondeterministic automata, some applications, most notably synthesis, need deterministic or good-for-games (GFG) automata. The latter are nondeterministic automata that can resolve their nondeterministic choices in a way that only depends&nbsp;[&hellip;]

---