# A Domain Equation for Bisimulation

@article{Abramsky1991ADE,
title={A Domain Equation for Bisimulation},
author={Samson Abramsky},
journal={Inf. Comput.},
year={1991},
volume={92},
pages={161-218}
}
• S. Abramsky
• Published 1 June 1991
• Computer Science
• Inf. Comput.
Some basic topics in the theory of concurrency are studied from the point of view of denotational semantics, and particularly the ''domain theory in logical form'' developed by the author. A domain of synchronization trees is defined by means of a recursive domain equation involving the Plotkin powerdomain. The logical counterpart of this domain is described, and shown to be related to it by Stone duality. The relationship of this domain logic to the standard Hennessy-Milner logic for…
205 Citations
A coinduction principle for recursive data types based on bisimulation
• M. Fiore
• Computer Science
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
• 1993
An internal full abstraction result for the canonical model of the untyped call-by-value lambda -calculus is proved from two strong-extensionality theorems stating that the equality relation is maximal among all bisimulations.
Pi-Calculus in Logical Form
• Mathematics, Computer Science
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
• 2007
It is shown that initial algebras of functors defined in terms of categorical constructions give rise to a logic that is sound, complete, and characterises bisimilarity.
Trees and Semantics
• C. Baier
• Computer Science
Theor. Comput. Sci.
• 1997
Gamma and the Logic of Transition Traces
• Computer Science
• 1997
This paper systematically develops a program logic for Gamma from a denotational semantics, a domain-theoretic reformulation of the transition trace semantics, which was deened for Gamma by Sands and based on earlier work by Brookes.
Deriving Denotational Models for Bisimulation from Struc- Tured Operational Semantics
The deened an order theoretic interpretation for L and it is proved that it is a complete model for the equational theory of ACP, which is an interesting question which kind of structure to use in order to model this.
CPO Models for a Class of GSOS Languages
• Computer Science
TAPSOFT
• 1995
This paper presents a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail and Meyer, and gets several general results on the bisimulation preorder.
Non-determinism in a functional setting
• C. Ong
• Computer Science
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
• 1993
This work identifies the denotational type that captures the computational situation delta =P(( delta to delta ) perpendicular to ), where P(-) is the Plotkin power-domain functor and carries out a systematic programme that hinges on three distinct interpretations of delta, namely process-theoretic, Denotational, and logical.
Volume 92 Number 2 ( 1991 ) , in the article “ A Domain Equation for Bisimulation
The researchers who wish to apply Abramsky’s domain logic for transition systems in their work should use the version presented in [1, Chap. 5] in lieu of that offered in the journal paper, because there is a subtle error in the proof of Theorem 5.5.8.
A Fully Abstract Model for the [pi]-calculus
• Computer Science
Inf. Comput.
• 2002
A central role is played by the description of non-determinism as a free construction and by the equational theory of the metalanguage in this proof of full abstraction for the finite /spl pi/-calculus in the set-theoretic model.

## References

SHOWING 1-10 OF 38 REFERENCES
Domain Theory in Logical Form
The category-theoretic solution of recursive domain equations
• Mathematics
18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
• 1977
The purpose of the present paper is to set up a categorical framework in which the known techniques for solving equations find a natural place, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega$-categories.
Concurrent Processes and Their Syntax
• Mathematics
JACM
• 1979
It is shown that processes are a flow algebra, and therefore constitute a suitable semantics for flowgraphs, and it is emphasized that the nouon of flowgraph evolved from the notion of process and not the reverse.
LCF Considered as a Programming Language
Algebraic laws for nondeterminism and concurrency
• Computer Science
JACM
• 1985
The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.
Higher-Level Synchronising Devices in Meije-SCCS
• R. Simone
• Computer Science
Theor. Comput. Sci.
• 1985
Lectures on a Calculus for Communicating Systems
• R. Milner
• Computer Science
Seminar on Concurrency
• 1984
This chapter discusses sequential computation, which until quite recently was the only mode of computation available in well-known programming languages, and how the model theory of the lambda calculus has grown and has been harmonised with its evaluation theory.
A Powerdomain for Countable Non-Determinism (Extended Abstract)
A general powerdomain for countable nDndeterminism is proposed and used to give the denotational semantics of a simple imperative programming language with a fair parallel construct.
Full Abstraction for a Simple Parallel Programming Language
• Computer Science
MFCS
• 1979
A denotational semantics for a simple language with parallelism was given, treating parallelism in terms of non-deterministic mergeing of uninterruptible actions, and expected identities such as the associativity and commutativity of the parallel combinator were true in this semantics.