Heuristic Search for the Analysis of Graph Transition Systems

Edelkamp, Stefan and Jabbar, Shahid and Lluch-Lafuente, Alberto Heuristic Search for the Analysis of Graph Transition Systems. In: Graph Transformations (ICGT 2006). Lecture Notes in Computer Science, 4178 . Springer, pp. 414-429. ISBN 3-540-38870-2 (2006)

Preview

PDF - Accepted Version Download (259kB) | Preview

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.

Item Type:	Book Section
Identification Number:	https://doi.org/10.1007/11841883_29
Additional Information:	© Springer-Verlag Berlin Heidelberg 2006. The original publication is available at www.springerlink.com.
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area:	Computer Science and Applications
Depositing User:	Users 30 not found.
Date Deposited:	31 Mar 2011 14:52
Last Modified:	11 Jul 2011 14:34
URI:	http://eprints.imtlucca.it/id/eprint/157

Actions (login required)

Edit Item