Autor:	Bandreddi E. Prasad, Garimella Uma
Rok vydání:	1993
Předmět:	Tree (data structure) Information Systems and Management Artificial Intelligence Computer science Heuristic Reachability Petri net Heuristics Algorithm Software Graph Management Information Systems
Zdroj:	Knowledge-Based Systems. 6:174-177
ISSN:	0950-7051
DOI:	10.1016/0950-7051(93)90042-r
Popis:	The paper explores the use of heuristics to search reachability trees (graphs) for particular markings. Evaluation functions are defined on markings for two well known heuristics: means-ends analysis and the A ∗ algorithm. A comparison of these approaches with conventional reachability tree analysis (breadth-first search) is given.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::8e9c8d4c95cfd87968ce5370535738bc https://doi.org/10.1016/0950-7051(93)90042-r Zobrazit plný text záznamu