دورية أكاديمية
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
| العنوان: | Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets |
|---|---|
| المؤلفون: | Arnaldo Cesco, Roberto Gorrieri |
| المصدر: | Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023) |
| بيانات النشر: | Logical Methods in Computer Science e.V., 2023. |
| سنة النشر: | 2023 |
| المجموعة: | LCC:Logic LCC:Electronic computers. Computer science |
| مصطلحات موضوعية: | computer science - logic in computer science, Logic, BC1-199, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | We prove that the well-known (strong) fully-concurrent bisimilarity and the novel i-causal-net bisimilarity, which is a sligtlhy coarser variant of causal-net bisimilarity, are decidable for finite bounded Petri nets. The proofs are based on a generalization of the ordered marking proof technique that Vogler used to demonstrate that (strong) fully-concurrent bisimilarity (or, equivalently, history-preserving bisimilarity) is decidable on finite safe nets. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 1860-5974 |
| Relation: | https://lmcs.episciences.org/9285/pdf; https://doaj.org/toc/1860-5974 |
| DOI: | 10.46298/lmcs-19(4:37)2023 |
| URL الوصول: | https://doaj.org/article/a40d66808c854cd49d5e348bf8ad5d62 |
| رقم الأكسشن: | edsdoj.40d66808c854cd49d5e348bf8ad5d62 |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 18605974 |
|---|---|
| DOI: | 10.46298/lmcs-19(4:37)2023 |