Parallel Composition of Assumption-Commitment Specifications - a Unifying Approach for Shared Variable and Distributed Message Passing Concurrency (1996)
| Citations: | 26 - 6 self |
BibTeX
@MISC{Cau96parallelcomposition,
author = {A. Cau and P. Collette},
title = {Parallel Composition of Assumption-Commitment Specifications - a Unifying Approach for Shared Variable and Distributed Message Passing Concurrency},
year = {1996}
}
Years of Citing Articles
OpenURL
Abstract
We unify the parallel composition rule of assumption-commitment specifications for respectively state-based and message-based concurrent processes. Without providing languagedependent definitions, we first assume that the model of a process can be given as a set of `sequences' (e.g., traces, state sequences). Then we assume the existence of a merging operator that captures the compositionality of that model. On this basis, we formulate a semantic parallel composition rule for assumption-commitment specifications wherein the merging operator behaves as a parameter. Then, by providing suitable language-specific definitions for the model of a process and the merging operator, we transform the semantic rule into syntactic ones, both for the state-based and message-based approaches to concurrency. 1 Introduction In the concurrent programming community, communication between processes is usually modeled in two ways. The first one uses shared variables as a mean for communication and the oth...







