Testing equivalences for processes

R De Nicola, MCB Hennessy - Theoretical computer science, 1984 - Elsevier
Given a set of processes and a set of tests on these processes we show how to define in a
natural way three different equivalences on processes. These equivalences are applied to a …

[图书][B] Algebraic theory of processes

M Hennessy - 1988 - dl.acm.org
Algebraic theory of processes | Guide books skip to main content ACM Digital Library home
ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …

[图书][B] Concurrency verification: Introduction to compositional and non-compositional methods

WP De Roever - 2001 - books.google.com
This is a systematic and comprehensive introduction both to compositional proof methods for
the state-based verification of concurrent programs, such as the assumption-commitment …

Foundations of actor semantics

WD Clinger - AITR-633, 1981 - dspace.mit.edu
The actor message-passing model of concurrent computation has inspired new ideas in the
areas of knowledge-based systems, programming languages and their semantics, and …

Actor model of computation: scalable robust information systems

C Hewitt - arXiv preprint arXiv:1008.1459, 2010 - arxiv.org
The Actor model is a mathematical theory that treats" Actors" as the universal primitives of
concurrent digital computation. The model has been used both as a framework for a …

A proof system for communicating sequential processes

KR Apt, N Francez, WP De Roever - ACM Transactions on Programming …, 1980 - dl.acm.org
An axiomatic proof system is presented for proving partial correctness and absence of
deadlock (and failure) of communicating sequential processes. The key (meta) rule …

Processes and the denotational semantics of concurrency

JW de Bakker, JI Zucker - Information and Control, 1982 - Elsevier
A framework allowing a unified and rigorous definition of the semantics of concurrency is
proposed. The mathematical model introduces processes as elements of process domains …

Decomposition of distributed programs into communication-closed layers

T Elrad, N Francez - Science of Computer programming, 1982 - Elsevier
The safe decomposition of a distributed program into communication closed layers is
suggested as a superstructure of its decomposition into a collection of communicating …

Distributed termination

N Francez - ACM Transactions on Programming Languages and …, 1980 - dl.acm.org
Discussed is a distributed system based on communication among disjoint processes,
where each process is capable of achieving a post-condition of its local space in such a way …

Specification-oriented semantics for communicating processes

ER Olderog, CAR Hoare - Acta Informatica, 1986 - Springer
A process P satisfies a specification S if every observation we can make of the behaviour of
P is allowed by S. We use this idea of process correctness as a starting point for developing …