Reachability trees for Petri nets: a heuristic approach
作者：
Highlights：
•
摘要
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.
论文关键词：Petri nets,graphs,reachability trees,heuristics breadth-first searching,means-ends analysis
论文评审过程：Received 27 April 1992, Revised 26 March 1993, Accepted 26 April 1993, Available online 17 February 2003.
论文官网地址：https://doi.org/10.1016/0950-7051(93)90042-R
