@InProceedings{Hirshfeld:CSL:1994,
  author="Hirshfeld, Yoram",
  editor="B{\"o}rger, Egon and Gurevich, Yuri and Meinke, Karl",
  title="Petri nets and the equivalence problem",
  booktitle="Computer Science Logic",
  year="1994",
  publisher="Springer Berlin Heidelberg",
  address="Berlin, Heidelberg",
  doi = {10.1007/bfb0049331},
  pages="165--174",
  abstract="We prove that trace equivalence is undecidable for the very small and natural subclass of Petri nets in which no transition requires more than one token; this subclass corresponds exactly to the calculus BPP of Christensen for which bisimulation equivalence is known to be decidable. We present this result along with a survey of decidability results for various notions of equivalence with respect to various subclasses of Petri nets.",
  isbn="978-3-540-48599-5"
}

@InProceedings{Hirshfeld:CSL:1994, author="Hirshfeld, Yoram", editor="B{\"o}rger, Egon and Gurevich, Yuri and Meinke, Karl", title="Petri nets and the equivalence problem", booktitle="Computer Science Logic", year="1994", publisher="Springer Berlin Heidelberg", address="Berlin, Heidelberg", doi = {10.1007/bfb0049331}, pages="165--174", abstract="We prove that trace equivalence is undecidable for the very small and natural subclass of Petri nets in which no transition requires more than one token; this subclass corresponds exactly to the calculus BPP of Christensen for which bisimulation equivalence is known to be decidable. We present this result along with a survey of decidability results for various notions of equivalence with respect to various subclasses of Petri nets.", isbn="978-3-540-48599-5" }