Abstract
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution. State spaces of such systems can be represented by graph transition systems, which are basically transition systems whose states and transitions represent graphs and graph morphisms. Heuristic search is a successful Artificial Intelligence technique for solving exploration problems implicitly present in games, planning, and formal verification. Heuristic search exploits information about the problem being solved to guide the exploration process. The main benefits are significant reductions in the search effort and the size of solutions. We propose the application of heuristic search for the analysis of graph transition systems. We define algorithms and heuristics and present experimental results.
| Original language | English |
|---|---|
| Title of host publication | Graph Transformations : Third International Conference, ICGT 2006 Natal, Rio Grande do Norte, Brazil, September 17-23, 2006 Proceedings |
| Publisher | Springer Berlin Heidelberg |
| Publication date | 2006 |
| Pages | 414-429 |
| ISBN (Print) | 978-3-540-38870-8 |
| ISBN (Electronic) | 978-3-540-38872-2 |
| DOIs | |
| Publication status | Published - 2006 |
| Externally published | Yes |
| Event | 3rd International Conference on Graph Transformation - Rio Grande do Norte, Brazil Duration: 17 Sept 2006 → 23 Sept 2006 Conference number: 3 |
Conference
| Conference | 3rd International Conference on Graph Transformation |
|---|---|
| Number | 3 |
| Country/Territory | Brazil |
| City | Rio Grande do Norte |
| Period | 17/09/2006 → 23/09/2006 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 4178 |
| ISSN | 0302-9743 |