Reachability determination for a non-syntactic subclass of vector replacement systems (Petri nets)
Main Author: | Laucht, C. Matthias |
---|---|
Published: |
2013
|
Online Access: | http://hdl.handle.net/1993/15086 |
Similar Items
-
Reachability determination for a non-syntactic subclass of vector replacement systems (Petri nets)
by: Laucht, C. Matthias
Published: (2013) -
An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees
by: Dan You, et al.
Published: (2018-01-01) -
Some approaches to attack the reachability problem of Petri nets
by: Hsueh, Mei-huei, et al.
Published: (1996) -
Reachability Analysis of Petri Nets with Limited Communication Capabilities
by: Chien-Liang Chen, et al.
Published: (2009) -
Partial Reachability Graph Analysis of Petri Nets for Flexible Manufacturing Systems
by: Menghuan Hu, et al.
Published: (2020-01-01)