A Domain Equation for Bisimulation

Information and Computation

Volumn 92, Issue 2, 1991, Pages 161-218

  Abramsky, Samson ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED;

BISIMULATION; CONCURRENCY THEORY; DENOTATIONAL SEMANTICS; DOMAIN LOGIC; SYNCHRONIZATION TREES; TRANSITION SYSTEMS;

COMPUTER METATHEORY;

EID: 0026171162     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1991.9999     Document Type: Article

References (48)

1. Alge`bres de processus et synchronisations
2. Experiments, powerdomains and fully abstract models for applicative multiprogramming
3. Semantics foundations for applicative multiprogramming
4. Domain Theory and the Logic of Observable Properties
5. Domain theory in logical form
6. Observation equivalence as a testing equivalence
7. Domain theory in logical form
8. The lazy λ-calculus
9. Countable nondeterminism and random assignment
10. Back and forth through infinitary logic
11. Process algebra for synchronous communication
12. Higher level synchronizing devices in MEIJE-SCCS
13. Fundamentals of Algebraic Specification 1
14. An initial algebra approach to the specification correctness and implementation of abstract data types
15. Initial algebra semantics and continuous algebras
16. Algebraic Semantics
17. A term model for synchronous processes
18. Algebraic laws for non-determinism and concurrency
19. Full abstraction for a simple parallel programming language
20. Stone Spaces
21. A probabilistic powerdomain of evaluations
22. Bisimulation through probabilistic testing
23. Processes, a mathematical model of computing agents
24. Fully abstract models of typed lambda-calculi
25. A Calculus for Communicating Systems
26. A modal characterisation of observable machine behaviours
27. Calculi for synchrony and asynchrony
28. Lectures on a calculus for communicating systems
29. Process constructors and interpretations
30. Concurrent processes and their syntax
31. Infinite words, infinite trees, infinite computations
32. Concurrency on automata and infinite sequences
33. A powerdomain construction
34. LCF considered as a programming language
35. Applications of topology to semantics of communicating processes
36. Powerdomains and predicate transformers: A topological view
37. The category-theoretic solution of recursive domain equations
38. Modal logics for communicating systems
39. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
40. Why algebraic theories?
41. Powerdomains and modality
42. A complete proof system for SCCS with modal assertions