## Seminar on Concurrency: Carnegie-Mellon University Pittsburgh, PA, July 9-11, 1984Stephen D. Brookes, Andrew W. Roscoe, Glynn Winskel |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

On the Axiomatic Treatment of Concurrency | 1 |

Hierarchical Development of Concurrent Systems in a Temporal Logic Framework | 35 |

On the Composition and Decomposition of Assertions | 62 |

Process Algebra with Asynchronous Communication Mechanisms | 76 |

Axioms for Memory Access in Asynchronous Hardware Systems | 96 |

Executing Temporal Logic Programs | 111 |

The Static Derivation of Concurrency and its Mechanized Certification | 131 |

Semantic Considerations in the Actor Paradigm of Concurrent Computation | 151 |

An Improved Failures Model for Communicating Processes | 281 |

Denotational Semantics for occam | 306 |

Linguistic Support of Receptionists for Shared Resources | 330 |

Applications of Topology to Semantics of Communicating Processes | 360 |

Refusal Acceptance Safety | 373 |

The ESTEREL Synchronous Programming Language and its Mathematical Semantics | 389 |

An Implementation Model of Rendezvous Communication | 449 |

A Fully Abstract Model of Fair Asynchrony | 458 |

Unifying the Temporal and the Spatial | 180 |

Lectures on a Calculus for Communicating Systems | 197 |

Sequences Processes and Axioms | 221 |

Categories of Models for Concurrency | 246 |

Maximally Concurrent Evolution of Nonsequential Systems | 268 |

Alternative Semantics for McCarthys amb | 467 |

Semantics of Networks Containing Indeterminate Operators | 479 |

Abstract Interpretation and Indeterminacy | 497 |

A Status Report | 512 |

### Other editions - View all

### Common terms and phrases

abstract action actor algebra allow application approach assertions assume axioms behavior called channel choice command communication complete component composition computation concurrent configuration consider construction contains corresponding defined definition denote derived described divergence domain elements emit environment equivalence example execution expression extended fact failures Figure finite formal formula function give given globally angelic implementation infinite initial input interpretation interval introduced labelled language logic loop means multiset natural nets Note notion objects occurrence operation output parallel partial particular possible present problem programming language proof properties prove receive recursive relation represented require respect result rule satisfies semantics sequence sequential signal simple specification statement structure synchronous temporal termination Theorem theory trace transition trees true variables write