On the Decidability of Behavioral Equivalences for (P,P)-PRS

by   Irina Lomazova, et al.

We study resource similarity and resource bisimilarity – congruent restrictions of the bisimulation equivalence for the (P,P)-class of Process Rewrite Systems (PRS). Both these equivalences coincide with the bisimulation equivalence for (1,P)-subclass of (P,P)-PRS, which is known to be decidable. While it has been shown in the literature that resource similarity is undecidable for (P,P)-PRS, decidability of resource bisimilarity for (P,P)-PRS remained an open question. In this paper, we present an algorithm for checking resource bisimilarity for (P,P)-PRS. We show that although both resource similarity and resource bisimilarity are congruences and have a finite semi-linear basis, only the latter is decidable.


page 1

page 2

page 3

page 4


Resource Transition Systems and Full Abstraction for Linear Higher-Order Effectful Systems

We investigate program equivalence for linear higher-order(sequential) l...

Decision problems for Clark-congruential languages

A common question when studying a class of context-free grammars is whet...

Resource Logics with a Diminishing Resource

Model-checking resource logics with production and consumption of resour...

About Code Equivalence – a Geometric Approach

The equivalence test is a main part in any classification problem. It he...

Resource Burning for Permissionless Systems

Proof-of-work puzzles and CAPTCHAS consume enormous amounts of energy an...

Resource Augmentation

This chapter introduces resource augmentation, in which the performance ...

A new resource measure with respect to resource destroying maps

We formulated a family of new resource measure if the resource can be ch...