In this paper, we supplement the set of basic and back-forth behavioural equivalences for Petri nets considered in [11] by place bisimulation ones.
Abstract. In this paper, we supplement the set of basic and back-forth behavioural equiva- lences for Petri nets considered in 11] by place bisimulation ...
Place bisimulation equivalences for design of concurrent and sequential systems · I. V. Tarasyuk · Published in MFCS Workshop on Concurrency 1998 · Computer ...
Place bisimulation equivalences for design of concurrent and sequential systems. Tarasyuk, Igor V. In: Electronic Notes in Theoretical Computer Science 18: ...
Igor V. Tarasyuk : Place bisimulation equivalences for design of concurrent and sequential systems. MFCS Workshop on Concurrency 1998: 191-206.
(PDF) Petri net equivalences for design of concurrent systems
www.researchgate.net › ... › Petri Nets
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. The basic equivalence notions known from ...
May 29, 2017 · We explain how this equivalence may help to simplify performance analysis of the algebraic processes. In a case study, a method of modeling, ...
In contrast to classical bisimulations, which are relations of type S × S, the new equivalence is based on triples. The essence of justness is that a transition ...
Mar 15, 2024 · As a matter of fact, place bisimilarity is a truly concurrent behavioral equivalence, which is slightly finer than causal-net bisimilarity ...
We investigate equivalence notions for concurrent systems. We consider “linear time” approaches where the system behaviour is characterised as the set of ...