High undecidability of weak bisimilarity for Petri nets:高不可判定性的弱bisimilarity佩特里网.pdfVIP

  • 8
  • 0
  • 约4.73万字
  • 约 15页
  • 2017-07-24 发布于湖北
  • 举报

High undecidability of weak bisimilarity for Petri nets:高不可判定性的弱bisimilarity佩特里网.pdf

High undecidability of weak bisimilarity for Petri nets Petr Jan~ar * Dept. of Computer Science, University of Ostrava Dvo~s 7, 701 03 Ostrava, Czech Republic e-mail: jancar@oudec.osu.cz A b s t r a c t It is shown that the problem whether two labelled place/transition Petri nets (with initial markings) are weakly bisimilar i

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档