Chapter

Formal Modeling: Actors, Open Systems, Biological Systems

Volume 7000 of the series Lecture Notes in Computer Science pp 74-89

From Explicit to Symbolic Types for Communication Protocols in CCS

  • Hanne Riis NielsonAffiliated withDTU Informatics, Technical University of Denmark
  • , Flemming NielsonAffiliated withDTU Informatics, Technical University of Denmark
  • , Jörg KreikerAffiliated withInstitut für Informatik, Technische Universität München
  • , Henrik PilegaardAffiliated withInstitut für Informatik, Technische Universität München

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We study communication protocols having several rounds and expressed in value passing CCS. We develop a type-based analysis for providing an explicit record of all communications and show the usual subject reduction result. Since the explicit records can be infinitely large, we also develop a type-based analysis for providing a finite, symbolic record of all communications. We show that it correctly approximates the explicit record and prove an adequacy result for it.