Name
Abstract | ||
|---|---|---|
This paper adresses the problem of generating a minimal state graph from a program, without building first the whole state graph. The minimality is considered here with respect to bisimulation. A generation algorithm is presented and illustrated. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1007/BFb0023733 | CAV |
Keywords | Field | DocType |
minimal model generation,generic algorithm | Transition system,Computer science,Minimal model,Theoretical computer science,Bisimulation,Symbolic execution,State graph | Conference |
Volume | ISSN | ISBN |
531 | 0302-9743 | 3-540-54477-1 |
Citations | PageRank | References |
73 | 18.07 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmed Bouajjani | 1 | 2663 | 184.84 |
| Jean-Claude Fernandez | 2 | 73 | 18.07 |
| Nicolas Halbwachs | 3 | 3957 | 426.43 |