Name
Abstract | ||
|---|---|---|
We show that the problem of deciding branching bisimulation equivalence for normed context-free processes is in Sigma(2)(p), the second level of the polynomial-time hierarchy, and hence in PSPACE. We also show that minimization of normed context-free process graphs is in PSPACE. (C) 1995 Academic Press, Inc. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1006/inco.1995.1069 | Information and Computation |
Keywords | DocType | Volume |
normed context-free process | Journal | 118 |
Issue | ISSN | Citations |
2 | 0890-5401 | 2 |
PageRank | References | Authors |
0.37 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Caucal | 1 | 470 | 39.15 |
| Dung T. Huynh | 2 | 434 | 39.60 |
| Lu Tian | 3 | 13 | 2.57 |