%0 Journal Article
%T Maze Problem''s Solution Based on Timed Petri-net<br>基于TdPN的迷宫问题求解
%A YE Jian-hong
%A YE Shuang
%A SONG Wen
%A SUN Shi-xin
%A <br>叶剑虹
%A 叶双
%A 宋文
%A 孙世新
%J 计算机科学
%D 2011
%I 
%X M-TdPN, an improved search algorithm, was presented in this paper in view of the shortage of traditional solutions of maze problem. Redundancy points were eliminated to reduce the space complexity. The timed Petri net was applied to simulate the maze. Using the concurrency, every token has its own traces. The flags attached on tokens in the end place arc the feasible paths of maze problem. hhe searching efficiency is improved effectively. Results of experimental showed that the M-TdPN algorithm has better search results in case of more complicated maze or more impasse vertexes specially.
%K Limed petri nets
%K Maze problem
%K Concurrency
%K Token flag<br>时延Petri网，迷宫，并发，托肯标签
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=A02D22894B6747143DC0D6BAF6825ED5&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=DF92D298D3FF1E6E&sid=C812B90E96151014&eid=3016592FFF0E4EFB&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=17