Proceedings of the Annual Conference of the Institute of Systems, Control and Information Engineers
The 48th Annual Conference of the Institute of Systems, Control and Information Engineers
Session ID : 5001
Conference information
Finite Approximation of the Reachability Graph of an Unbounded Petri Net
*Yongming Bai, Shigemasa Takai
Author information
Keywords: Petri net, reachability graph, finite approximation
CONFERENCE PROCEEDINGS FREE ACCESS

Details
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Abstract
The behavior of a Petri net can be described by its reachability graph. However, the reachability graph of an unbounded Petri net has an infinite number of states. It is known that the coverability graph is a finite automatonthat approximates the reachability graph of the original unbounded Petri net. In this paper, we construct an approximating finite automaton that is different from the coverability graph.
Content from these authors
© 2004 The Institute of Systems, Control and Information Engineers
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top