Resource Bisimilarity in Petri Nets is Decidable
From MaRDI portal
Publication:5038572
DOI10.3233/FI-222125OpenAlexW3216174486MaRDI QIDQ5038572
V. A. Bashkin, Petr Jančar, Irina A. Lomazova
Publication date: 7 October 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.07711
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Undecidability of bisimilarity for Petri nets and some related problems
- Linear time, branching time and partial order in logics and models for concurrency. School/workshop, Noordwijkerhout, The Netherlands, May 30- June 3, 1988. Proceedings
- Strong bisimilarity of simple process algebras: Complexity lower bounds
- Place bisimulation and liveness for open Petri nets
- Process rewrite systems.
- Models of nondeterministic regular expressions
- Bisimilarity on basic parallel processes
- Application and theory of Petri nets and concurrency. 41st international conference, PETRI NETS 2020, Paris, France, June 24--25, 2020. Proceedings
- Application and theory of Petri nets and concurrency. 38th international conference, PETRI NETS 2017, Zaragoza, Spain, June 25--30, 2017. Proceedings
- Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
- Algebraic laws for nondeterminism and concurrency
- Open Petri Nets as Semantic Model for Workflow Integration
- Analyzing Compatibility of Services via Resource Conformance
- The algorithmics of bisimilarity
This page was built for publication: Resource Bisimilarity in Petri Nets is Decidable