Name
Abstract | ||
|---|---|---|
In this paper, we study the complexity of deciding readiness and failure equivalences for finite state processes and recursively defined processes specified by normed context-free grammars (CFGs) in Greibach normal form (GNF). The results are as follows: (1) Readiness and failure equivalences for processes specified by normed GNF CFGs are both undecidable. For this class of processes, the regularity problem with respect to failure or readiness equivalence is also undecidable. Moreover, all these undecidability results hold even for locally unary processes. In the unary case, these problems become decidable. In fact, they are Π p 2 -complete, We also show that with respect to bisimulation equivalence, the regularity for processes specified by normed GNF CFGs is NL-complete. (2) Readiness and failure equivalences for finite state processes are PSPACE-complete. This holds even for locally unary finite state processes. These two equivalences are co-NP-complete for unary finite state processes. Further, for acyclic finite state processes, readiness and failure equivalences are co-NP-complete and they are NL-complete in the unary case. (3) For finite tree processes, we show that finite trace, readiness, and failure equivalences are all L-complete. Further, the results remain true for the unary case. Our results provide a complete characterization of the computational complexity of deciding readiness and failure equivalences for several important classes of processes. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1006/inco.1995.1039 | Inf. Comput. |
Keywords | Field | DocType |
failure equivalence,normal form,computational complexity,context free grammar | Discrete mathematics,Combinatorics,Context-free grammar,Algebra,Unary operation,Decidability,Equivalence (measure theory),Greibach normal form,Mathematics,Recursion,Undecidable problem,Computational complexity theory | Journal |
Volume | Issue | ISSN |
117 | 2 | Information and Computation |
Citations | PageRank | References |
9 | 1.76 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dung T. Huynh | 1 | 434 | 39.60 |
| Lu Tian | 2 | 13 | 2.57 |