 
Summary: Termination, Deadlock, and Divergence
L. ACETO AND M. HENNESSY
University of Sussex, Falmer, Brighton, England
Abstract. In this paper, a process algebra that incorporates expliclt representations of successful
termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an
operational and a denotational semantics for the language is given and it is shown that they agree. The
operational theory N based upon a suitable adaptation of the notion of bisimulation preorder. The
denotational semantics forthelanguage isgiven interms of theinitial continuous algebra that satisfiesa
set of equations E, CI~. It is shown that C'IE is fully abstract with respect to our choice of behavioral
preorder. Several results ofindependent interest are obtained; namely, the finite approximability of the
behavioral preorder and a partial completeness result for the set of equations E with respect to the
preorder.
Categories and Subject Descriptors: D.4.1 [Operating Systems]: Process Managementdead[ocks;
F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languagesoperational
semantics
General Terms: Languages, Theory
1. Introduction
In this paper, we wish to develop a theory for a process algebra that incorpo
rates some explicit representation of termination, deadlock, and divergence. We
develop both an operational theory based on bisimulations, [30] and an
