CONCUR ’90 Theories of Concurrency: Unification and Extension: Amsterdam, The Netherlands, August 27–30, 1990 Proceedings

Eike Best (auth.), J. C. M. Baeten, J. W. Klop (eds.)3540530487, 9783540530480

This volume gives the proceedings of the conference CONCUR ’90. This is the first conference organized by ESPRIT Basic Research Action 3006, CONCUR (Theories of Concurrency: Unification and Extension), started in September 1989. The principal aims of the action are to explore the relationships among the different approaches to algebraic concurrency theory, and to develop a formalism applicable to a wide range of case studies. The articles in this volume describe the state of the art in concurrency, the theory of communicating concurrent (or distributed) systems.

---

Table of contents :
Partial order semantics of concurrent programs….Pages 1-1
SCONE: A simple calculus of nets….Pages 2-30
Value-passing in process algebras….Pages 31-31
Let’s make models….Pages 32-32
Ideal specification formalism = expressivity + compositionality + decidability + testability + …….Pages 33-56
An axiomatization of Lamport’s temporal logic of actions….Pages 57-69
Convergence of iteration systems….Pages 70-82
Process algebra with a zero object….Pages 83-98
On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences….Pages 99-114
Verifying temporal properties of processes….Pages 115-125
Testing equivalences and fully abstract models for probabilistic processes….Pages 126-138
A preorder for partial process specifications….Pages 141-151
Back and forth bisimulations….Pages 152-165
Reduction and design of well-behaved concurrent systems….Pages 166-181
Synthesis rules for Petri nets, and how they lead to new results….Pages 182-198
The need for headers: An impossibility result for communication over unreliable channels….Pages 199-214
A temporal approach to algebraic specifications….Pages 216-229
Superimposition for interacting processes….Pages 230-245
An implementation of a translational semantics for an imperative language….Pages 246-262
CCSR: A calculus for communicating shared resources….Pages 263-277
The linear time – branching time spectrum….Pages 278-297
A programming logic for formal concurrent systems….Pages 298-313
A new strategy for proving ω-completeness applied to process algebra….Pages 314-331
Transition system specifications with negative premises….Pages 332-341
Delay-insensitive circuits: An algebraic approach to their design….Pages 342-366
Equivalences, congruences, and complete axiomatizations for probabilistic processes….Pages 367-383
Rewriting as a unified model of concurrency….Pages 384-400
A temporal calculus of communicating systems….Pages 401-415
Proving termination of communicating programs….Pages 416-426
Factorization of finite state machines under observational equivalence….Pages 427-441
Partial order logics for elementary net systems: State- and event-approaches….Pages 442-455
Priority as extremal probability….Pages 456-466
A synchronous calculus of relative frequency….Pages 467-480
On the compositional checking of validity….Pages 481-501
Real-time behaviour of asynchronous agents….Pages 502-520
Effective solutions to domain equations an approach to effective denotational semantics….Pages 521-536