Decidability Questions for Bismilarity of Petri Nets and Some Related Problems
暂无分享,去创建一个
[1] Philippe Schnoebelen,et al. Strong Bisimilarity on Nets Revisited , 1991, PARLE.
[2] Derek C. Oppen,et al. A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..
[3] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .
[4] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[5] Yoram Hishfeld. Petri Nets and the Equivalence Problem , 1993 .
[6] Søren Christensen,et al. Bisimulation Equivalence is Decidable for Context-Free Processes , 2005 .
[7] Hsu-Chun Yen,et al. Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States , 1986, Theor. Comput. Sci..
[8] Rüdiger Valk,et al. Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..
[9] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[10] Faron Moller,et al. Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.
[11] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .
[12] Z. Belmesk,et al. Strong bisimilarity on nets revisited (extended abstract) , 1991 .
[13] John E. Hopcroft,et al. On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..
[14] Michel Hack,et al. The Equality Problem for Vector Addition Systems is Undecidable , 1976, Theor. Comput. Sci..
[15] M. Schützenberger,et al. Rational sets in commutative monoids , 1969 .