Communicating sequential processes
Communicating sequential processes
Refinement calculus, part I: sequential nondeterministic programs
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Programming from specifications
Programming from specifications
An algebraic construction of predicate transformers
Science of Computer Programming - Special issue on mathematics of program construction
Algebraic proofs of consistency and completeness
Theoretical Computer Science
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
(Bi)simulations up-to characterise process semantics
Information and Computation
Theoretical Computer Science
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Linking theories of concurrency
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Synchronous message passing: on the relation between bisimulation and refusal equivalence
Concurrency, Compositionality, and Correctness
Process algebra: a unifying approach
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 5.23 |
There are two quite distinct approaches commonly used when giving meaning to process algebra expressions: an operational semantics, often associated with the CCS language, defines an equivalence between terms by considering whether each can simulate the other; a denotational semantics, often associated with CSP, provides a mapping, recursively defined over the structure of the language, taking each term into a carefully chosen collection of set-theoretic objects. (The traces and failures models are well-known examples of such semantic domains.) We present a formal link between the two approaches, consisting in defining a variant of the bisimulation equivalence that naturally gives rise to the traces and failures ordering. We have no way at present to extend this result to the failures/divergence model.