@article {12795,
title = {Priority and abstraction in process algebra},
journal = {Information and Computation},
volume = {205},
year = {2007},
month = {2007/09//},
pages = {1426 - 1458},
abstract = {More than 15 years ago, Cleaveland and Hennessy proposed an extension of the process algebra CCS in which some actions may take priority over others. The theory was equipped with a behavioral congruence based on strong bisimulation.This article gives a full account of the challenges in, and the solutions employed for, defining a semantic theory of observation congruence for this process algebra. A full-abstraction result is presented whose proof relies on a novel approach based on successive approximations for identifying the largest congruence contained in an intuitive but na{\~A}{\textasciimacron}ve equivalence. Prioritized observation congruence is also characterized equationally for the class of finite processes, while its utility for system verification is demonstrated by an illustrative example.
},
keywords = {Axiomatization, Bisimulation, Full abstraction, Observation congruence, Priority, Process algebra},
isbn = {0890-5401},
doi = {10.1016/j.ic.2007.05.001},
url = {http://www.sciencedirect.com/science/article/pii/S0890540107000624},
author = {Cleaveland, Rance and L{\~A}{\textonequarter}ttgen,Gerald and Natarajan,V.}
}