### Citations

12 | Recursive automata on infinite words - Staiger |

11 | Separation principles in the hierarchies of classical and effective descriptive set theory - Addison |

5 | Proof systems for infinite behaviours - Darondeau, Yoccoz - 1992 |

3 |
Une critique de la notion de test de processus fond'ee sur la non s'eparabilit'e de certaines classes de langages, Informatique Th'eorique et
- Darondeau
- 1986
(Show Context)
Citation Context ...exity. Due to theshigh degree of inefficiency of concurrency models, this complexity has to be gradedsin arithmetical and analytical hierarchies.sTesting equivalences are among these equivalences. In =-=[2]-=-, a separation principlesis defined for classes of o-languages which is concerned with the general notion ofstest. Therefore, the motivation for such a separation principle is neither topological nors... |

1 |
Algebraic Theory of Processes (MIT
- Hemressy
- 1988
(Show Context)
Citation Context ... mechanism between recursive automatas“a la CCS”. It appears that the product automaton jumps to the upper degree of theshierarchy. We then define a Hennessy-like notion of test and test equivalences =-=[4]-=- takingsinto account guarantee constraint and we will prove non-separability under testing forseach class of automata (Theorem 6.2). This result is mainly based on the capability tosremove second-orde... |

1 |
Fully abstract models of typed &calculi, Theoret
- Mimer
- 1977
(Show Context)
Citation Context ...iscriminate any pair of CCS processes having distinct observational behaviours. Itsseems apparently nonconsistent with the very well known existence of fully abstractsmodels for CCS, full abstraction =-=[5]-=- being the property according to which denotationssalways discriminate distinct process behaviours in all possible contexts. Based on thesesseparability results, several generalizations of testing hav... |

1 |
Weene automata and recursion theory, in: Logicaf Fo~datjons of Computer Science
- Mullins
- 1992
(Show Context)
Citation Context ...cursive num-sberings for each class limno C,* and each class lim,o II;. From that numbering, wescould easily imagine recurs&e numberings for each class of 0,-processes as well. Wesrefer the reader to =-=[6]-=- where such indices are built up for more general classes ofsJ. Mullins I Theoretical Computer Science I74 (1997) 231-246 245srecursive automata. Let us call such an index an n-index. Writing 8(i) to ... |

1 |
On guaranteed recursively defined processes: separability on testing
- Mullins
- 1995
(Show Context)
Citation Context ...Nicola and Hennessy’s equivalence, the testing problem for CCS is in II:. CCS’ssassumption of branching finiteness is therefore assumed.sAn earlier version of this work has been presented at ICTCS’95 =-=[7]-=-.s2. Background and preliminary definitionssLet X denotes an alphabet, and X* and Xw, the set of respectively finite words andsinfinite sequences on alphabet X. The empty word is denoted by E. Given c... |

1 |
Theory of Recursive Functions and Efictive Computability
- Rogers
- 1987
(Show Context)
Citation Context ...ssume a Giidel numbering of all recursively enumerable languages over an alpha-sbet X. This yields recursive n~be~ngs for each class C,* and each class II: calledsrespectively CT-index and II,*-index =-=[S]-=- (Section 14.2) and, of course, recursive num-sberings for each class limno C,* and each class lim,o II;. From that numbering, wescould easily imagine recurs&e numberings for each class of 0,-processe... |

1 |
Hierarchies of recursive w-languages
- Staiger
- 1986
(Show Context)
Citation Context ...ical hierarchy.sIt is known that, when X is finite, we get in that way, an infinite hierarchy notsbounded by any arithmetical class of o-languages, i.e. with arbitrary effective structuralscomplexity =-=[9]-=-.sOur first result is to prove that, even in the general case, i.e. even when X is infinite,snone of these classes can be separated (Theorem 3.2).sJ. Mullins/ Theoretical Computer Science I74 (1997) 2... |