Logic in Computer Science (LICS 1996)

Paper: A Fully Abstract Domain Model for the pi-Calculus (at LICS 1996)

Authors: Ian Stark

Abstract

Abramsky's domain equation for bisimulation and the author's categorical models for names combine to give a domain-theoretic model for the p-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy, visibility and non-inteference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions).

BibTeX

  @InProceedings{Stark-AFullyAbstractDomai,
    author = 	 {Ian Stark},
    title = 	 {A Fully Abstract Domain Model for the pi-Calculus},
    booktitle =  {Proceedings of the Eleventh Annual IEEE Symp. on Logic in Computer Science, {LICS} 1996},
    year =	 1996,
    editor =	 {Edmund M. Clarke},
    month =	 {July}, 
    pages =      {36-42},
    location =   {New Brunswick, NJ, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }