A process algebra with distributed priorities (1996) [16 citations — 5 self]
Download:
by Rance Cleaveland, Gerald Luttgen, V. Natarajan
Theoretical Computer Science
http://www.icase.edu/~luettgen/publications/pdffiles/CONCUR96.pdf
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@TECHREPORT{Cleaveland96aprocess,author = {Rance Cleaveland and Gerald Luttgen and V. Natarajan},
title = {A process algebra with distributed priorities},
institution = {Theoretical Computer Science},
year = {1996}
}
Years of Citing Articles
Abstract:
Abstract. This paper presents a process algebra for distributed systems in which some actions may take precedence over others. In contrast with existing approaches to priorities, our algebra only allows actions to preempt others at the same \location " and therefore captures a notion of localized precedence. Using Park's and Milner's notion of strong bisimulation as a basis, we develop a behavioral congruence and axiomatize it for nite processes; we also derive an associated observational congruence. Simple examples highlight the utility of the theory. 1
