تقرير
Structurally Cyclic Petri Nets
| العنوان: | Structurally Cyclic Petri Nets |
|---|---|
| المؤلفون: | Frank, Drewes, Jérôme, Leroux |
| المصدر: | Logical Methods in Computer Science, Volume 11, Issue 4 (December 22, 2015) lmcs:1616 |
| سنة النشر: | 2015 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Logic in Computer Science |
| الوصف: | A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the general reachability problem for Petri nets. Comment: 9 pages. Key words: Petri net, vector addition system, structural cyclicity, reachability |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.2168/LMCS-11(4:15)2015 |
| URL الوصول: | http://arxiv.org/abs/1510.08331 |
| رقم الأكسشن: | edsarx.1510.08331 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.2168/LMCS-11(4:15)2015 |
|---|