Priority in process algebras

摘要: This paper surveys the semantic ramifications of extending traditional process algebras with notions priority that allow for some transitions to be given precedence over others. These enriched formalisms one model system features such as interrupts, prioritized choice, or real-time behavior. Approaches in can classified according whether induced notion pre-emption on is global local and priorities are static dynamic. Early work area concentrated led modeling interrupts aspects real-time, maximal progress, centralized computing environments. More recent research has investigated localized which distribution systems taken into account, well dynamic approaches, i.e., those where values may change evolve. The latter allows behavioral phenomena scheduling algorithms also enables efficient encoding semantics. Technically, this studies different models by presenting extensions Milner''s Calculus Communicating Systems (CCS) pre-emption. In each case operational semantics CCS modified appropriately, theories based strong weak bisimulation given, related approaches process-algebraic settings discussed.