Skip to main content
SpringerLink
Log in

Full Abstraction for Fair Testing in CCS

  • Conference paper
Algebra and Coalgebra in Computer Science (CALCO 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8089))

Included in the following conference series:

Abstract

In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent presheaf semantics and as a concurrent game semantics. It is here proved that a behavioural equivalence induced by this semantics on CCS processes is fully abstract for fair testing equivalence.

The proof relies on a new algebraic notion called playground, which represents the ‘rule of the game’. From any playground, two languages, equipped with labelled transition systems, are derived, as well as a strong, functional bisimulation between them.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahrens, B.: Initiality for typed syntax and semantics. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol. 7456, pp. 127–141. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  2. Bonsangue, M., Rutten, J., Silva, A.: A kleene theorem for polynomial coalgebras. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 122–136. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313–327. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  4. Bruni, R., Montanari, U.: Cartesian closed double categories, their lambda-notation, and the pi-calculus. In: LICS. IEEE Computer Society (1999)

    Google Scholar 

  5. Cacciagrano, D., Corradini, F., Palamidessi, C.: Explicit fairness in testing semantics. Logical Methods in Computer Science 5(2) (2009)

    Google Scholar 

  6. Cattani, G.L., Winskel, G.: Presheaf models for concurrency. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 58–75. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  7. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34 (1984)

    Google Scholar 

  8. Delorme, M., Mazoyer, J., Ollinger, N., Theyssier, G.: Bulking I: An abstract theory of bulking. Theoretical Computer Science 412(30) (2011)

    Google Scholar 

  9. Ehresmann, C.: Catégories et structures. Dunod (1965)

    Google Scholar 

  10. Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction. The MIT Press (2000)

    Google Scholar 

  11. Garner, R.: Polycategories. PhD thesis, University of Cambridge (2006)

    Google Scholar 

  12. Girard, J.-Y.: Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11(3) (2001)

    Google Scholar 

  13. Grandis, M., Pare, R.: Limits in double categories. Cahiers de Topologie et Géométrie Différentielle Catégoriques 40(3) (1999)

    Google Scholar 

  14. Harmer, R., Hyland, M., Melliès, P.-A.: Categorical combinatorics for innocent strategies. In: LICS. IEEE Computer Society (2007)

    Google Scholar 

  15. Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: LICS. IEEE Computer Society (1999)

    Google Scholar 

  16. Hildebrandt, T.T.: Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay. Theoretical Computer Science 294(1/2) (2003)

    Google Scholar 

  17. Hirschowitz, T.: Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. Preprint (2010)

    Google Scholar 

  18. Hirschowitz, T.: Full abstraction for fair testing in CCS (2012), Draft available from http://lama.univ-savoie.fr/~hirschowitz

  19. Hirschowitz, T., Pous, D.: Innocent strategies as presheaves and interactive equivalences for CCS. Scientific Annals of Computer Science 22(1) (2012), Selected papers from ICE 2011

    Google Scholar 

  20. Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2) (2000)

    Google Scholar 

  21. Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol. 141. North Holland, Amsterdam (1999)

    MATH  Google Scholar 

  22. Joyal, A., Nielsen, M., Winskel, G.: Bisimulation and open maps. In: LICS. IEEE Computer Society (1993)

    Google Scholar 

  23. Kock, J.: Polynomial functors and trees. International Mathematics Research Notices 2011(3) (2011)

    Google Scholar 

  24. MacLane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics, vol. 5. Springer, Heidelberg (1998)

    Google Scholar 

  25. MacLane, S., Moerdijk, I.: Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Universitext. Springer, Heidelberg (1992)

    Book  Google Scholar 

  26. Melliès, P.-A.: Asynchronous games 2: The true concurrency of innocence. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 448–465. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  27. Melliès, P.-A.: Game semantics in string diagrams. In: LICS. IEEE Computer Society (2012)

    Google Scholar 

  28. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  Google Scholar 

  29. Milner, R.: Communication and Concurrency. Prentice-Hall (1989)

    Google Scholar 

  30. Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: Fülöp, Z. (ed.) ICALP 1995. LNCS, vol. 944, pp. 648–659. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  31. Nipkow, T.: Higher-order critical pairs. In: LICS. IEEE Computer Society (1991)

    Google Scholar 

  32. Plotkin, G.D.: A structural approach to operational semantics. DAIMI Report FN-19, Computer Science Department, Aarhus University (1981)

    Google Scholar 

  33. Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2) (2007)

    Google Scholar 

  34. Rideau, S., Winskel, G.: Concurrent strategies. In: LICS. IEEE Computer Society (2011)

    Google Scholar 

  35. Sewell, P.: From rewrite rules to bisimulation congruences. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 269–284. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  36. Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: LICS. IEEE Computer Society (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS and Université de Savoie, France

    Tom Hirschowitz

Authors
  1. Tom Hirschowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Leicester, LE1 7RH, Leicester, UK

    Reiko Heckel

  2. Lehrstuhl für Theoretische Informatik, Friedrich-Alexander Universität, 91058, Erlangen-Nürnberg, Germany

    Stefan Milius

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirschowitz, T. (2013). Full Abstraction for Fair Testing in CCS. In: Heckel, R., Milius, S. (eds) Algebra and Coalgebra in Computer Science. CALCO 2013. Lecture Notes in Computer Science, vol 8089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40206-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40206-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40205-0

  • Online ISBN: 978-3-642-40206-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation