A branching time semantics for the Ada * rendezvousmechanism

Boumediene Belkhouche, R. Raymond Lang, Chung Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Bmnching-time semantics b e d on domaina built upon tree structures have been proposed to model concurrent processes. Howeiuer, the resulting models imposed severe restrictwna to enaure monotonicity and wmpositwndity. To oddress these iaaues, we wn-struct a semantic domain!without ractijking these two properties. We ala0 provide a simpk and faithfd semantics of the Ada rendtrzvow mechanism.

Original languageEnglish
Title of host publicationArchitecture and Software Technology
PublisherIEEE Computer Society
Pages517-524
Number of pages8
ISBN (Electronic)0818673249
DOIs
Publication statusPublished - 1996
Externally publishedYes
Event29th Hawaii International Conference on System Sciences, HICSS 1996 - Wailea, United States
Duration: Jan 3 1996Jan 6 1996

Publication series

NameProceedings of the Annual Hawaii International Conference on System Sciences
Volume1
ISSN (Print)1530-1605

Conference

Conference29th Hawaii International Conference on System Sciences, HICSS 1996
Country/TerritoryUnited States
CityWailea
Period1/3/961/6/96

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'A branching time semantics for the Ada * rendezvousmechanism'. Together they form a unique fingerprint.

Cite this