Technical Report 87--02, pages 1-18 pp.. Irvine, USA: University of California; Department of Information and Computer Science, January 1987.
Abstract: The paper explores, mostly from a theoretical point of view, some issues of Petri net equivalence, including both reachability sets and languages. Some new definitions of reachability set equivalence are described which allow the markings of some places to be treated identically or ignored, analogous to the Petri net languages in which multiple transitions may be labelled with the same symbol or with the empty string. The complexity of some decidable Petri net equivalence problems is analyzed.
Keywords: net equivalence; complexity (of net equivqlence); reachability set; net language.