High undecidability of weak bisimilarity for Petri nets

被引：0
|
作者：
Jancar, P
机构：
来源：
TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT | 1995年 / 915卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
It is shown that the problem whether two labelled place/transition Petri nets (with initial markings) are weakly bisimilar is highly undecidable - it resides at least at level omega of the hyperarithmetical hierarchy; on the other hand it belongs to Sigma(1)(1) (the first level of the analytical hierarchy). It contrasts with Pi(1)(0)-completeness of the same problem for trace (language) equivalence. Relations to similar problems for the process algebra BPP (Basic Parallel Processes) are also discussed.
引用
收藏
页码：349 / 363
页数：15
相关论文
共 50 条
  • [1] UNDECIDABILITY OF BISIMILARITY FOR PETRI NETS AND SOME RELATED PROBLEMS
    JANCAR, P
    THEORETICAL COMPUTER SCIENCE, 1995, 148 (02) : 281 - 301
  • [2] Refining the Undecidability Border of Weak Bisimilarity
    Kretinsky, Mojmir
    Rehak, Votech
    Strejcek, Jan
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 149 (01) : 17 - 36
  • [3] Resource Bisimilarity in Petri Nets is Decidable
    Lomazova, Irina A.
    Bashkin, Vladimir A.
    Jancar, Petr
    FUNDAMENTA INFORMATICAE, 2022, 186 (1-4) : 175 - 194
  • [4] Undecidability of weak bisimilarity for PA-processes
    Srba, J
    DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 197 - 208
  • [5] Undecidability of performance equivalence of Petri nets
    Lasota, Slawomir
    Poturalski, Marcin
    THEORETICAL COMPUTER SCIENCE, 2016, 655 : 109 - 119
  • [6] THE UNDECIDABILITY OF PROPOSITIONAL TEMPORAL LOGIC FOR PETRI NETS
    CHERKASOVA, LA
    KOTOV, VE
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1987, 6 (02): : 123 - 130
  • [7] Bisimilarity and behaviour-preserving reconfigurations of open Petri nets
    Baldan, Paolo
    Corradini, Andrea
    Ehrig, Hartmut
    Heckel, Reiko
    Koenig, Barbara
    ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2007, 4624 : 126 - +
  • [8] BISIMILARITY AND BEHAVIOUR-PRESERVING RECONFIGURATIONS OF OPEN PETRI NETS
    Baldan, Paolo
    Corradini, Andrea
    Ehrig, Hartmut
    Heckel, Reiko
    Koenig, Barbara
    LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (04)
  • [9] Techniques for decidability and undecidability of bisimilarity
    Jancar, P
    Moller, F
    CONCUR '99: CONCURRENCY THEORY, 1999, 1664 : 30 - 45
  • [10] ON WEAK PERSISTENCY OF PETRI NETS
    YAMASAKI, H
    INFORMATION PROCESSING LETTERS, 1981, 13 (03) : 94 - 97
12345