DocumentCode
2256698
Title
Priorities in process algebras
Author
Cleaveland, Rance ; Hennessy, Matthew
Author_Institution
Dept. of Comput. Sci., Sussex Univ., Brighton, UK
fYear
1988
fDate
0-0 1988
Firstpage
193
Lastpage
202
Abstract
An operational semantics for an algebraic theory of concurrency is developed that incorporates a notion of priority into the definition of the execution of actions. An equivalence based on strong observational equivalences is defined and shown to be a congruence, and a complete axiomization is given for finite terms. Several examples highlight the novelty and usefulness of the approaches.<>
Keywords
algebra; programming theory; algebraic theory; concurrency; equivalence; finite terms; operational semantics; priority; process algebras; Algebra; Carbon capture and storage; Computer languages; Computer science; Counting circuits; Hardware; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1988. LICS '88., Proceedings of the Third Annual Symposium on
Conference_Location
Edinburgh, UK
Print_ISBN
0-8186-0853-6
Type
conf
DOI
10.1109/LICS.1988.5118
Filename
5118
Link To Document