Affiliation:
1. Univ. of Sussex, Brighton, UK
Abstract
In this paper, a process algebra that incorporates explicit 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 is based upon a suitable adaptation of the notion of bisimulation preorder. The denotational semantics for the language is given in terms of the initial continuous algebra that satisfies a set of equations
E
,
CI
E
. It is shown that
CI
E
is fully abstract with respect to our choice of behavioral preorder. Several results of independent 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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference36 articles.
1. Observanon equivalence as a tesnng equivalence;ABRAMSKY S;Theoret. Comput Sct.,1987
2. A domain equation for bisimulation
3. On the consistency of Koomen's Fair Abstraction Rule
4. BAETEN J. C. M. A ND VAN GLABBEEK R.J. Abstraction and empty process in process algebra. Fund. Inf. to appear ]] BAETEN J. C. M. A ND VAN GLABBEEK R.J. Abstraction and empty process in process algebra. Fund. Inf. to appear ]]
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献