New reachability trees for unbounded Petri nets

Document Type

Conference Proceeding

Publication Date

6-29-2015

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.

Identifier

84938222333 (Scopus)

ISBN

[9781479969234]

Publication Title

Proceedings IEEE International Conference on Robotics and Automation

External Full Text Location

https://doi.org/10.1109/ICRA.2015.7139737

ISSN

10504729

First Page

3862

Last Page

3867

Issue

June

Volume

2015-June

This document is currently not available here.

Share

COinS