Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

04/30/2021
by   Arnaldo Cesco, et al.
0

We prove that (strong) fully-concurrent bisimilarity and 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, historypreserving bisimilarity) is decidable on finite safe nets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2023

Compositional Net Semantics up to Step Net Bisimilarity

Step net bisimilarity <cit.> is a truly concurrent behavioral equivalenc...
research
08/04/2022

Petri Nets for Concurrent Programming

Concurrent programming is used in all large and complex computer systems...
research
09/21/2022

Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets

A crucial question in analyzing a concurrent system is to determine its ...
research
08/17/2023

Compositional Semantics of Finite Petri Nets

Structure-preserving bisimilarity is a truly concurrent behavioral equiv...
research
02/09/2018

The Monadic Second Order Theory of Grid-Free 1-Safe Petri Nets is Decidable

Finite 1-safe Petri nets, also called net systems, are natural models of...
research
02/10/2021

Interpreting a concurrent λ-calculus in differential proof nets (extended version)

In this paper, we show how to interpret a language featuring concurrency...
research
03/26/2018

Bounded Context Switching for Valence Systems

We study valence systems, finite-control programs over infinite-state me...

Please sign up or login with your details

Forgot password? Click here to reset