A process algebra with distributed priorities

This paper presents a process algebra for distributed systems in which some actions may take precedence over others. The algebra is distinguished by the design decision that it only allows actions to pre-empt 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 finite processes; we also derive an associated observational congruence and present logical characterizations of our behavioral relations. Simple examples highlight the utility of the theory.

Authors

• Ranee Cleaveland
• Gerald Lüttgen
• V. Natarajan

Keywords

• Process algebra
• Distributed priority
• Bisimulation
• Localized pre-emption
• Axiomatization