Decidability of split equivalence

Authors:
Y. Abramson;A. Rabinovich
Affiliations:
Tel Aviv University, Ramat Aviv, Israel;Tel Aviv University, Ramat Aviv, Israel
Venue:
Information and Computation
Year:
2002

Citing 7
Cited 0

The equational theory of pomsets

Theoretical Computer Science
The limit of splitn-language equivalence

Information and Computation
Free shuffle algebras in language varieties

Theoretical Computer Science
The difference between splitting in n and n + 1

Information and Computation
A solution of an interleaving decision problem by a partial order technique

POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
On the composition of processes

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully abstract models for a process language with refinement

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all instantiations of its variables by strings? Our proof uses the notations developed in the casual approach to concurrency. As a byproduct we obtain decidability of similar equivalence for other formalisms. In particular, we prove decidability of split equivalence for Petri nets. Our paper also provides an alternative proof for a characterization of split equivalence recently given by W. Vogler.