Search

• < Previous
• 1
• Next >

---

Antichains for the Automata-Based Approach to Model-Checking

Laurent Doyen ; Jean-Francois Raskin.

We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buechi automata, and the emptiness problem for alternating Buechi automata. To obtain those algorithms, we establish the existence of simulation pre-orders that can be&nbsp;[&hellip;]

---

Expressiveness and Closure Properties for Quantitative Languages

Krishnendu Chatterjee ; Laurent Doyen ; Thomas A Henzinger.

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages~$L$ that assign to each word~$w$ a real number~$L(w)$. In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average,&nbsp;[&hellip;]

---