CONCUR’93: 4th Intrenational Conference on Concurrency Theory Hildesheim, Germany, August 23–26, 1993 Proceedings

Gérard Boudol (auth.), Eike Best (eds.)3540572082, 9783540572084

This volume contains the proceedings of CONCUR ’93, the fourth in an annual series of conferences devoted to the study of concurrency. The basic aim of the CONCUR conferences is to communicate advances in concurrency theory and applications. The volume contains 31 papers selected from 113submissions, together with four invited papers and two abstracts of invited talks. The invited talks are: “The lambda-calculus with multiplicities” (extended abstract) by G rard Boudol, “A pi-calculus semantics for an object-based design notation” by Cliff B. Jones, “Partial-order methods for temporal verification” by Pierre Wolper and Patrice Godefroid, “Non-interleaving process algebra” by Jos C.M. Baetenand Jan A. Bergstra, “Loop parallelization in the polytope model” by Christian Lengauer, and “Structured operational semantics for process algebras and equational axiom systems” (abstract) by Bard Bloom.

---

Table of contents :
The lambda-calculus with multiplicities….Pages 1-6
A multiset semantics for the pi-calculus with replication….Pages 7-21
Model checking mobile processes….Pages 22-36
A practical technique for process abstraction….Pages 37-49
Modular completeness for Communication Closed Layers….Pages 50-65
The linear time — Branching time spectrum II….Pages 66-81
A classification of models for concurrency….Pages 82-96
On the ill-timed but well-caused….Pages 97-111
On the reduction of chocs bisimulation to π-calculus bisimulation….Pages 112-126
A theory of bisimulation for the π-calculus….Pages 127-142
Bisimulation equivalence is decidable for basic parallel processes….Pages 143-157
A pi-calculus semantics for an object-based design notation….Pages 158-172
Programming with broadcasts….Pages 173-187
Interpreting broadcast communication in SCCS….Pages 188-201
Proof systems for message-passing process algebras….Pages 202-216
Refinement and decomposition of value-passing action systems….Pages 217-232
Partial-order methods for temporal verification….Pages 233-246
Model construction for implicit specifications in modal logic….Pages 247-261
Branching time temporal logic and amorphous tree automata….Pages 262-277
A generalized event structure for the Muller unfolding of a safe net….Pages 278-292
Domains of higher-dimensional automata….Pages 293-307
Non interleaving process algebra….Pages 308-323
Quiescence, fairness, testing, and the notion of implementation….Pages 324-338
Two fully abstract models for UNITY….Pages 339-352
Transformations preserving properties and properties preserved by transformations in fair transition systems (extended abstract)….Pages 353-367
Minimal memory schedules for dataflow networks….Pages 368-383
Networks of real-time processes….Pages 384-397
Loop parallelization in the polytope model….Pages 398-416
ACSR: An algebra of communicating shared resources with dense time and priorities….Pages 417-431
An Elimination Theorem for regular behaviours with integration….Pages 432-446
A linear local model checking algorithm for CTL….Pages 447-461
Local event structures and Petri nets….Pages 462-476
A congruence theorem for structured operational semantics with predicates….Pages 477-492
From CML to process algebras….Pages 493-508
Types for dyadic interaction….Pages 509-523
Principal typing schemes in a polyadic π-calculus….Pages 524-538
Structured operational semantics for process algebras and equational axiom systems….Pages 539-540