Decidability of split equivalence

Y. Abramson*, A. Rabinovich

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 causal 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.

Original languageEnglish
Pages (from-to)15-39
Number of pages25
JournalInformation and Computation
Volume173
Issue number1
DOIs
StatePublished - 25 Feb 2002

Fingerprint

Dive into the research topics of 'Decidability of split equivalence'. Together they form a unique fingerprint.

Cite this