CONCUR ’91: 2nd International Conference on Concurrency Theory Amsterdam, The Netherlands, August 26–29, 1991 Proceedings

Pierre America (auth.), Jos C. M. Baeten, Jan Frisco Groote (eds.)3540544305, 9783540544302

CONCUR’91 is the second international conference on concurrency theory, organized in association with the NFI project Transfer. It is a sequel to the CONCUR’90 conference. Its basic aim is to communicate ongoing work in concurrency theory. This proceedings volume contains 30 papers selected for presentation at the conference (from 71 submitted) together with four invited papers and abstracts of the other invited papers. The papers are organized into sections on process algebras, logics and model checking, applications and specification languages, models and net theory, design and real-time, tools and probabilities, and programming languages. The proceedings of CONCUR’90 are available asVolume 458 of Lecture Notes in Computer Science.

---

Table of contents :
Formal techniques for parallel object-oriented languages….Pages 1-17
Causal models for rational algebraic processes….Pages 18-19
Action and state-based logics for process algebras….Pages 20-22
A tool set for deciding behavioral equivalences….Pages 23-42
Causality based models for the design of concurrent systems….Pages 43-44
Modal logics for mobile processes….Pages 45-60
Towards a design calculus for communicating programs….Pages 61-77
A theory of testing for ACP….Pages 78-95
Real space process algebra….Pages 96-110
The failure of failures in a paradigm for asynchronous communication….Pages 111-126
Embedding as a tool for language comparison: On the CSP hierarchy….Pages 127-141
A conditional operator for CCS….Pages 142-156
Algebraic formulations of trace theory….Pages 157-171
Compositional synthesis of live and bounded free choice Petri nets….Pages 172-187
The observation algebra of spatial pomsets….Pages 188-202
Synchrony loosening transformations for interacting processes….Pages 203-219
A compositional model for layered distributed systems….Pages 220-234
Process algebra with guards….Pages 235-249
Model checking and modular verification….Pages 250-265
Geometric logic, causality and event structures….Pages 266-280
Extended Horn clauses: the framework and some semantics….Pages 281-297
Action systems and action refinement in the development of parallel systems….Pages 298-316
Invariant semantics of nets with inhibitor arcs….Pages 317-331
Abstract timed observation and process algebra….Pages 332-345
Simulations between specifications of distributed systems….Pages 346-360
Using truth-preserving reductions to improve the clarity of kripke-models….Pages 361-375
Completeness in real time process algebra….Pages 376-392
Distributed CCS….Pages 393-407
Time-constrained automata….Pages 408-423
Relating processes with respect to speed….Pages 424-438
Testing, betting and timed true concurrency….Pages 439-454
Fairness in models with true concurrency….Pages 455-469
Efficient verification of determinate processes….Pages 470-479
Experiments on processes with backtracking….Pages 480-494
Some finite-graph models for process algebra….Pages 495-509
A method for the development of totally correct shared-state parallel programs….Pages 510-525
Reduced labelled transition systems save verification effort….Pages 526-540