Remarks on the Reachability Graphs of Petri Nets
The question is considered - which graphs are isomorphic to the reachability graphs of Petri nets. Reachability graphs, or sets of achievable states, represent sets of all possible different network states resulting from a given initial state s0 by a finite chain of permissible transitions. They hav...
Saved in:
| Main Author: | Yuriy Anatol’yevich Belov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2022-12-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1752 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
CPN Tools-Assisted Simulation and Verification of Nested Petri Nets
by: L. W. Dworza´nski, et al.
Published: (2015-03-01) -
Calculation and Analysis of Petri Net Reachability Graphs by a Think-Globally-Act-Locally Method
by: Chengzong Li, et al.
Published: (2025-02-01) -
Flows in Generalized Nets with Related Arcs
by: V. A. Skorokhodov
Published: (2015-02-01) -
Augmented Graph Convolutional Network for Enhancing Label Reachability
by: Xiangyi Wang, et al.
Published: (2025-01-01) -
Robust Diagnosability Analysis Using Basis Reachability Graph
by: Shiqi Li, et al.
Published: (2023-01-01)