D. Huynh and L. Tian. On deciding readiness and failure equivalences for processes in # . Information and Computation, 117(2):193--205, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Failures equivalence Completed trace equivalence Trace equivalence Figure 1: The linear time branching time hierarchy of equivalences. several researchers have studied the decision problems for these relations [KS90, PT87, HT94, SRHS96, BP94, And93, And94, ABGS91, CS91, MS95, Hut91, HT90] A main distinction has turned out to be that of finite state processes versus infinite state processes. It is well known that all behavioural relations in the van Glabbeek hierarchy are decidable for finite state processes, and the main concern is therefore that of the computational complexity ....

.... written pv f q, iff failures(p) failures(q) Processes p and q are related by the readiness preorder, written p v r q, iff readies(p) readies(q) To show that the equivalences defined in this section are PSPACE hard, we shall employ a class of processes introduced by Huynh and Tian [HT90] called locally unary processes, for which failures equivalence and readiness equivalence coincide with completed trace equivalence. Definition 3.18 [HT90] A process p is locally unary iff for each p with there is at most one a 2 Act such that p Gamma . Lemma 3.2 [HT90] If p and q ....

[Article contains additional citation context not shown here]

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

....the process calculus approach (as exemplified in [27] encompasses a much richer class of infinite state systems that are open to automatic techniques normally associated with finite state systems than all those approaches based on trace, or language, equivalence. Recently, Huynh and Tian [22] have shown that failures and readiness equivalences are undecidable for this class of processes and Groote and the first author [17] have proved that in fact all known equivalences other than bisimulation are undecidable here, thus suggesting a new criterion for distinguishing between the ....

Dung T. Huynh and Lu Tian. On Deciding Readiness and Failure Equivalences for Processes. Information and Computation 117(2): 193--205, 1995.

....Hirshfeld of a technique of Jancar which is described in Section 2.4. Both arguments can be shown to hold for the class of normed systems. Also, for both BPA and BPP, this undecidability extends to all equivalences which lie in Glabbeek s spectrum [59] between bisimilarity and language equivalence [82, 61, 79]. Baeten, Bergstra and Klop [4, 5] presented the first such decidability result, that bisimilarity between normed BPA is decidable. Their lengthy proof exploits the periodicity which exists in normed BPA transition systems, and several simpler proofs exploiting structural properties were soon ....

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Information and Computation, 11:193--205, 1995.

....BPA effectively de Thetanes the class of context free languages. This argument can be shown to hold for the class of normed BPA systems as well. This undecidability result extends also to all equivalences which lie in 16 Glabbeek s spectrum [vG90b] between bisimilarity and language equivalence [GH94, HT95]. Another result [Jan95] due to Janicar says that bisimilarity is undecidable for Petri Nets. We generalise the approach of Bosscher [Bos97] and show that the decidability of (strict and nonstrict) bisimilarity in BPA systems extends to BPA ffi systems. In the proof we exploit the result in ....

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes in \Sigma P 2 . Information and Computation, 117(2):193#205, 1995.

....that BPA effectively defines the class of context free languages. This argument can be shown to hold for the class of normed BPA systems as well. This undecidability result extends also to all equivalences which lie in 16 Glabbeek s spectrum [vG90b] between bisimilarity and language equivalence [GH94, HT95]. Another result [Jan95] due to Jancar says that bisimilarity is undecidable for Petri Nets. We generalise the approach of Bosscher [Bos97] and show that the decidability of (strict and nonstrict) bisimilarity in BPA systems extends to BPA # systems. In the proof we exploit the result in [CHS92] ....

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes in # P 2 . Information and Computation, 117(2):193--205, 1995.

....fact that BPA effectively defines the class of context free languages. This argument can be shown to hold for the class of normed BPA systems as well. This undecidability result extends also to all equivalences which lie in Glabbeek s spectrum [vG90b] between bisimilarity and language equivalence [GH94, HT95]. Another result [Jan95] due to Jancar says that bisimilarity is undecidable for Petri Nets. We show that the decidability of bisimilarity in BPA systems can be extended to BPA ffi systems. In the proof we exploit the result in [CHS92] and transform the examined BPA ffi systems into BPA systems, ....

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes in \Sigma P 2 . Information and Computation, 117(2):193--205, 1995.

....the process calculus approach (as exemplified in [27] encompasses a much richer class of infinite state systems that are open to automatic techniques normally associated with finite state systems than all those approaches based on trace, or language, equivalence. Recently, Huynh and Tian [22] have shown that failures and readiness equivalences are undecidable for this class of processes and Groote and the first author [17] have proved that in fact all known equivalences other than bisimulation are undecidable here, thus suggesting a new criterion for distinguishing between the ....

Dung T. Huynh and Lu Tian. On Deciding Readiness and Failure Equivalences for Processes. Information and Computation 117(2): 193--205, 1995.

....the process calculus approach (as exemplified in [24] encompasses a much richer class of infinite state systems that are open to automatic techniques normally associated with finite state systems than all those approaches based on trace, or language, equivalence. Recently, Huynh and Tian [20] have shown that failures and readiness equivalences are undecidable for this class of processes and Groote and the first author [15] have proved that in fact all known equivalences other than bisimulation are undecidable here, thus suggesting a new criterion for distinguishing between the ....

Dung T. Huynh and Lu Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

....negative halves of the bisimulation problem. However, this decision algorithm does not support an equational theory for bisimilarity on BPA as was the case with the tableau system in the normed case. But what about the other equivalences Are they decidable, too The answer is no. Huynh and Tian [HT90] proved that the failures and readiness equivalences are undecidable for normed BPA. Their proof consisted in giving a special class of normed BPA processes for which these equivalences coincide with language equivalence and then showing that the language equivalence problem for arbitrary normed ....

Dung T. Huynh and Lu Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

....of Edinburgh, Edinburgh EH9 3JZ, Scotland e mail: hans dcs.ed.ac.uk Abstract A recent theorem [3, 7, 19] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to a class of context free grammars generating the ffl free context free languages. In [21] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear branching time hierarchy [13] and show that none of them are decidable for normed BPA processes. 1 Introduction In the field of ....

....in Basic Process Algebra (BPA) 2] A recent theorem [3] but see also [7, 15, 19] shows that strong bisimilarity is decidable for normed BPA processes. This result has been extended to BPA processes in general in [10] and similar results have been obtained for Basic Parallel Processes [8, 9] In [21] Huynh and Tian have shown that readiness and failures equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in Figure 1 and show that none of them are decidable for normed BPA processes. We also present a slightly more elegant version of the undecidability ....

[Article contains additional citation context not shown here]

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

....the equivalence hierarchy collapses and consequently all equivalences are decidable in the deterministic case. However, as early as in [11] it was shown by Friedman (in the setting of simple grammars) that the completed trace inclusion preorder is undecidable for deterministic BPA processes. In [20] Huynh and Tian have shown that readiness and failures equivalence are undecidable for BPA processes and, using this and Friedman s result, it was shown in [13] that in fact none of the equivalences in Figure 1 are decidable for normed BPA processes. In [10] Christensen, Huttel and Stirling ....

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

....have that: Fact 4.4 For 2 fCT ; RT ; FT ; F; Rg, the inequations I:n are sound with respect to , and the equations E:n are sound with respect to . Proof: As a a and each of the terms (a n ) a n only contain occurrences of action a, they are locally unary in the sense of [38]. By [34, Lem. 6.13] it follows that, for every positive integer n, a a RT (a n ) a n iff a a CT (a n ) a n : To prove the claim, it is therefore sufficient to show that each of the equalities E:n is sound with respect to CT . The straightforward argument is left to the ....

D. T. Huynh and L. Tian, On deciding readiness and failure equivalences for processes, Information and Computation, 117 (1995), pp. 193--205.

No context found.

D. Huynh and L. Tian. On deciding readiness and failure equivalences for processes in # . Information and Computation, 117(2):193--205, 1995.

No context found.

Dung T. Huynh and Lu Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

No context found.

D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC