Elsevier

Information and Computation

Volume 173, Issue 1, 25 February 2002, Pages 15-39
Information and Computation

Regular Article
Decidability of Split Equivalence

https://doi.org/10.1006/inco.2001.3074Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)