Combinatorics and resource circuit–based enumeration of reachable states for SPR
Reachability graphs can accurately reflect the state information of bounded Petri nets. However, the complexity of reachability graphs generation is exponential, which makes time waste and sometimes the computation may stop midway after a long time due to exhausted memory. Hence, this work presents...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2016-06-01
|
| Series: | Advances in Mechanical Engineering |
| Online Access: | https://doi.org/10.1177/1687814016648649 |