Name
Abstract | ||
|---|---|---|
In this paper, we develop and evaluate two new algorithms for checking emptiness of alternating automata. These algorithms build on previous works. First, they rely on antichains to efficiently manipulate the state-spaces underlying the analysis of alternating automata. Second, they are abstract algorithms with built-in refinement operators based on techniques that exploit information computed by abstract fixed points (and not counter-examples as it is usually the case). The efficiency of our new algorithms is illustrated by experimental results. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02979-0_19 | CIAA |
Field | DocType | Volume |
Discrete mathematics,Computer science,Automaton,Exploit,Operator (computer programming),Abstraction refinement,Fixed point | Conference | 5642 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Ganty | 1 | 242 | 20.29 |
| Nicolas Maquet | 2 | 36 | 2.44 |
| Jean-François Raskin | 3 | 1735 | 100.15 |