• DocumentCode
    296712
  • Title

    A branching time semantics for the Ada rendezvous mechanism

  • Author

    Belkhouche, Boumediene ; Lang, R. Raymond ; Ng, Chung Wa

  • Author_Institution
    Dept. of Comput. Sci., Tulane Univ., New Orleans, LA, USA
  • Volume
    1
  • fYear
    1996
  • fDate
    3-6 Jan 1996
  • Firstpage
    517
  • Abstract
    Branching-time semantics based on domains built upon tree structures have been proposed to model concurrent processes. However, the resulting models imposed severe restrictions to ensure monotonicity and compositionality. To address these issues, we construct a semantic domain without sacrificing these two properties. We also provide a simple and faithful semantics of the Ada rendezvous mechanism
  • Keywords
    Ada; computational linguistics; parallel processing; trees (mathematics); Ada rendezvous mechanism; branching time semantics; compositionality; model concurrent processes; monotonicity; semantic domain; tree structures; Computer science; Concrete; Educational institutions; Extraterrestrial measurements; Finite element methods; Production; Refining; System recovery; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,
  • Conference_Location
    Wailea, HI
  • Print_ISBN
    0-8186-7324-9
  • Type

    conf

  • DOI
    10.1109/HICSS.1996.495501
  • Filename
    495501
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=296712