@inproceedings{9c6dadde1ba444c89450ac0c8654660f,
title = "New reachability trees for unbounded Petri nets",
abstract = "Reachability is an important dynamic property of Petri nets. Its determination given an unbounded net and initial marking has remained an open problem since 1960s. Due to its extreme difficulty, a great deal of research has been focused on some subclasses of unbounded nets. For arbitrary ones, this work intends to propose a new reachability tree (NRT), which consists of only but all reachable markings from its initial marking. Furthermore, an NRT-based method to decide deadlocks of unbounded nets is presented. An example is provided to show the new results.",
keywords = "Deadlock, Discrete-event system (DES), Petri nets, Reachability tree",
author = "Shouguang Wang and Mengchu Zhou and Mengdi Gan and Dan You and Yue Li",
note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE International Conference on Robotics and Automation, ICRA 2015 ; Conference date: 26-05-2015 Through 30-05-2015",
year = "2015",
month = jun,
day = "29",
doi = "10.1109/ICRA.2015.7139737",
language = "English (US)",
series = "Proceedings - IEEE International Conference on Robotics and Automation",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "June",
pages = "3862--3867",
booktitle = "2015 IEEE International Conference on Robotics and Automation, ICRA 2015",
address = "United States",
edition = "June",
}