• DocumentCode
    1822322
  • Title

    A fully abstract denotational model for higher-order processes

  • Author

    Hennessy, M.

  • Author_Institution
    CSAI, Sussex Univ., Brighton, UK
  • fYear
    1993
  • fDate
    19-23 Jun 1993
  • Firstpage
    397
  • Lastpage
    408
  • Abstract
    A higher-order process calculus is defined in which one can describe processes which transmit as messages other processes; it may be viewed as a generalization of the lazy λ-calculus. The authors present a denotational model for the language, obtained by generalizing the domain equation for S. Abramsky´s (1990) model of the lazy λ-calculus. It is shown to be fully abstract with respect to three different behavioural preorders. The first is based on observing the ability of processes to perform an action in all contexts, the second on testing, and the final one on satisfying certain kinds of modal formulae
  • Keywords
    lambda calculus; behavioural preorders; domain equation; fully abstract denotational model; higher-order process calculus; lazy λ-calculus; message transmission; modal formula satisfiability; performability; testing; Algebra; Calculus; Communication channels; Equations; Performance evaluation; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1993. LICS '93., Proceedings of Eighth Annual IEEE Symposium on
  • Conference_Location
    Montreal, Que.
  • Print_ISBN
    0-8186-3140-6
  • Type

    conf

  • DOI
    10.1109/LICS.1993.287568
  • Filename
    287568