Abstract | ||
---|---|---|
We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program verification and control synthesis in reactive program compilation. |
Year | DOI | Venue |
---|---|---|
1992 | 10.1016/0167-6423(92)90018-7 | Sci. Comput. Program. |
Keywords | Field | DocType |
minimal state graph generation | Programming language,Computer science,State diagram,Theoretical computer science,Null graph,Graph rewriting,Bisimulation,Clique-width,Voltage graph,Moral graph,Graph (abstract data type) | Journal |
Volume | Issue | ISSN |
18 | 3 | Science of Computer Programming |
Citations | PageRank | References |
54 | 6.91 | 13 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
A. Bouajjani | 1 | 344 | 31.93 |
J.-C. Fernandez | 2 | 160 | 19.31 |
N. Halbwachs | 3 | 244 | 32.81 |
P. Raymond | 4 | 54 | 6.91 |
C. Ratel | 5 | 54 | 6.91 |