Name
Abstract | ||
|---|---|---|
We present an abstract interpretation based approach to solve the coverability problem of well-structured transition systems. Our approach distinguishes from other attempts in that (1) we solve this problem for the whole class of well-structured transition systems using a forward algorithm. So, our algorithm has to deal with possibly infinite downward closed sets. (2) Whereas other approaches have a non generic representation for downward closed sets of states, which turns out to be hard to devise in practice, we introduce a generic representation requiring no additional effort of implementation. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11609773_4 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
approach distinguishes,non generic representation,well-structured transition system,abstract interpretation,downward closed set,forward algorithm,additional effort,infinite downward closed set,generic representation,coverability problem,coverability property,complete abstract interpretation framework | Transition system,Discrete mathematics,Model checking,Forward algorithm,Computer science,Abstract interpretation,Closed set,Theoretical computer science,Hybrid automaton | Conference |
Volume | ISSN | ISBN |
3855 | 0302-9743 | 3-540-31139-4 |
Citations | PageRank | References |
20 | 0.87 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Ganty | 1 | 242 | 20.29 |
| Jean-François Raskin | 2 | 1735 | 100.15 |
| Laurent Van Begin | 3 | 194 | 11.15 |