Computer Science > Logic in Computer Science
[Submitted on 30 Apr 2021 (v1), last revised 20 Dec 2023 (this version, v9)]
Title:Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
View PDF HTML (experimental)Abstract: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.
Submission history
From: Arnaldo Cesco [view email] [via LMCS proxy][v1] Fri, 30 Apr 2021 09:20:04 UTC (31 KB)
[v2] Thu, 17 Mar 2022 12:12:29 UTC (40 KB)
[v3] Sat, 19 Nov 2022 10:39:31 UTC (44 KB)
[v4] Wed, 10 May 2023 09:34:00 UTC (50 KB)
[v5] Fri, 8 Sep 2023 06:43:04 UTC (43 KB)
[v6] Sun, 12 Nov 2023 15:39:01 UTC (44 KB)
[v7] Wed, 29 Nov 2023 08:27:05 UTC (56 KB)
[v8] Fri, 1 Dec 2023 21:56:24 UTC (56 KB)
[v9] Wed, 20 Dec 2023 10:51:16 UTC (57 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.