Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1986: STACS 86 pp 203–212Cite as

Separating and testing

  • Contributed Papers
  • Conference paper
  • First Online:

  • 119 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 210))

Abstract

A class of languages is separable if, for each pair of non identical languages L′ and L″, there exists some language L such that L ∩ L′=ø ↔ L ∩ L″≠ø. We give a negative answer to the question of separability for a large variety of classes of infinitary languages, from Algω to Σ 11 . We then prove that there exists for the calculus of communicating systems no notion of testing which can separate every pair of agents which differ by their infinite sequences of visible actions.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BOASSON L., NIVAT M., "Adherences of Languages" Journal of Computer and System Sciences 20 (1980), 285–309

    Article  Google Scholar 

  2. DARONDEAU Ph., "Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages" RR 259 IRISA Rennes (1985)

    Google Scholar 

  3. DARONDEAU Ph., "About Fair Asynchrony" — à paraître dans T.C.S. —

    Google Scholar 

  4. EILENBERG S., "Automata, languages and Machines" Vol. A, Academic Press (1974)

    Google Scholar 

  5. GONZALES ALVADARO C.A., "Le Mélange et le Mélange Itératif: les Opérateurs Concurrents" Thèse de 3ème cycle, Université de Paris VII (1984)

    Google Scholar 

  6. GUESSARIAN I., "Algebraic Semantics" Springer-Verlag LNCS 99 (1981)

    Google Scholar 

  7. HENNESSY M., de NICOLA R., "Testing Equivalences for Processes" Theoretical Computer Science 34 (1984) 83–134

    Article  Google Scholar 

  8. HENNESSY M., "Synchronous and Asynchronous Experiments on Processes" Information and Control 59 (1983) 36–83

    Article  Google Scholar 

  9. MILNER R., "Fully Abstract Models of Typed Lambda-Calculi" Theoretical Computer Science 4 (1977) 1–23

    Article  Google Scholar 

  10. MILNER R., "A Calculus of Communicating Systems" Springer-Verlag LNCS 92 (1980)

    Google Scholar 

  11. ROGERS H., "Theory of Recursive Functions and Effective Computability" Mc Graw-Hill (1967)

    Google Scholar 

  12. SHAW A.C., "Software Descriptions with Flow Expressions" IEEE Transactions on Software Engineering 3 (1978) 242–254

    Google Scholar 

  13. STOY J.E., "Denotational Semantics" M.I.T. Press (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus de Beaulieu, F 35042, Rennes Cedex

    Ph. Darondeau

Authors
  1. Ph. Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien G. Vidal-Naquet

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darondeau, P. (1985). Separating and testing. In: Monien, B., Vidal-Naquet, G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-16078-7_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16078-6

  • Online ISBN: 978-3-540-39758-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation