UNDECIDABILITY OF BISIMILARITY FOR PETRI NETS AND SOME RELATED PROBLEMS

被引：71
|
作者：
JANCAR, P
机构：
[1] Department of Computer Science, University of Ostrava, 701 03 Ostrava
来源：
THEORETICAL COMPUTER SCIENCE | 1995年 / 148卷 / 02期
关键词：
D O I：
10.1016/0304-3975(95)00037-W
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The main result shows the undecidability of(strong) bisimilarity for labelled (place/transition) Petri nets. The technique of the proof applies to the language (or trace) equivalence and the reachability set equality as well, which yields stronger versions with simpler proofs of already known results. The paper also contains two decidability results. One concerns the Petri nets which are deterministic up to bisimilarity, the other concerns semilinear bisimulations and extends the result of Christensen et al. (1993) for basic parallel processes.
引用
收藏
页码：281 / 301
页数：21
相关论文
共 50 条
  • [1] High undecidability of weak bisimilarity for Petri nets
    Jancar, P
    [J]. TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, 1995, 915 : 349 - 363
  • [2] Resource Bisimilarity in Petri Nets is Decidable
    Lomazova, Irina A.
    Bashkin, Vladimir A.
    Jancar, Petr
    [J]. FUNDAMENTA INFORMATICAE, 2022, 186 (1-4) : 175 - 194
  • [3] Undecidability of performance equivalence of Petri nets
    Lasota, Slawomir
    Poturalski, Marcin
    [J]. THEORETICAL COMPUTER SCIENCE, 2016, 655 : 109 - 119
  • [4] THE UNDECIDABILITY OF PROPOSITIONAL TEMPORAL LOGIC FOR PETRI NETS
    CHERKASOVA, LA
    KOTOV, VE
    [J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1987, 6 (02): : 123 - 130
  • [5] Bisimilarity and behaviour-preserving reconfigurations of open Petri nets
    Baldan, Paolo
    Corradini, Andrea
    Ehrig, Hartmut
    Heckel, Reiko
    Koenig, Barbara
    [J]. ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2007, 4624 : 126 - +
  • [6] BISIMILARITY AND BEHAVIOUR-PRESERVING RECONFIGURATIONS OF OPEN PETRI NETS
    Baldan, Paolo
    Corradini, Andrea
    Ehrig, Hartmut
    Heckel, Reiko
    Koenig, Barbara
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (04)
  • [7] Techniques for decidability and undecidability of bisimilarity
    Jancar, P
    Moller, F
    [J]. CONCUR '99: CONCURRENCY THEORY, 1999, 1664 : 30 - 45
  • [8] RECENT RESULTS ON THE COMPLEXITY OF PROBLEMS RELATED TO PETRI NETS
    HOWELL, RR
    ROSIER, LE
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 266 : 45 - 72
  • [9] Undecidability of bisimilarity by defender's forcing
    Jancar, Petr
    Srba, Jiri
    [J]. JOURNAL OF THE ACM, 2008, 55 (01)
  • [10] Refining the Undecidability Border of Weak Bisimilarity
    Kretinsky, Mojmir
    Rehak, Votech
    Strejcek, Jan
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 149 (01) : 17 - 36
12345