CONCUR ’92: Third International Conference on Concurrency Theory Stony Brook, NY, USA, August 24–27, 1992 Proceedings

Robin Milner (auth.), W.R. Cleaveland (eds.)3540558225, 9783540558224

This book contains a selection of research papers describing recent advancesin the theory of concurrent systems and their applications. The papers were all presented at the CONCUR ’92 conference, which has emerged as the premiere conference on formal aspects of concurrency. The authors include such prominent researchers as R. Milner, A. Pnueli, N. Lynch, and V.R. Pratt. The results represent advances in the mathematical understanding of the behavior of concurrent systems: topics covered include process algebras, models of true concurrency, compositional verification techniques, temporal logic, verification case studies, models of probabilistic and real-time systems, models of systems with dynamic structure, and algorithms and decidability results for system analysis. A key feature of CONCUR is its breadth: in one volume it presents a snapshot of the state of the art in concurrency theory. Assuch, it is indispensible to researchers – and would-be researchers – in theformal analysis of concurrent systems.

---

Table of contents :
The polyadic π-calculus….Pages 1-1
Testing equivalence for mobile processes….Pages 2-16
Testing equivalence for Petri Nets with action refinement: Preliminary report….Pages 17-31
The problem of “weak bisimulation up to”….Pages 32-46
On the uniqueness of fixpoints modulo observation congruence….Pages 47-61
Verification of parallel systems via decomposition….Pages 62-76
Interface refinement in reactive systems….Pages 77-93
Concurrent testing of processes….Pages 94-107
A theory of processes with localities….Pages 108-122
Model checking for context-free processes….Pages 123-137
Bisimulation equivalence is decidable for all context-free processes….Pages 138-147
Distributed bisimularity is decidable for a class of infinite state-space systems….Pages 148-161
How vital is liveness? Verifying timing properties of reactive and hybrid systems….Pages 162-175
Preserving specific properties in program development….Pages 176-191
Sometimes ‘some’ is as good as ‘all’….Pages 192-206
The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic….Pages 207-221
Propositional temporal logics and equivalences….Pages 222-236
The duality of time and information….Pages 237-253
Homology of higher dimensional automata….Pages 254-268
Posets for configurations!….Pages 269-285
On the semantics of Petri Nets….Pages 286-301
Structural operational specifications and trace automata….Pages 302-316
At-most-once message delivery A case study in algorithm verification….Pages 317-324
Games I/O automata play….Pages 325-339
Minimization of timed transition systems….Pages 340-354
Using CSP to verify a timed protocol over a fair medium….Pages 355-369
Timed Ethernet: Real-time formal specification of Ethernet….Pages 370-385
Implementing LOTOS specifications by communicating state machines….Pages 386-400
Discrete time process algebra….Pages 401-420
The silent step in time….Pages 421-435
Action transducers and timed automata….Pages 436-455
Compositional verification of probabilistic processes….Pages 456-471
Axiomatizing probabilistic processes: ACP with generative probabilities….Pages 472-485
Embeddings among concurrent programming languages….Pages 486-503
Logic of trace languages….Pages 504-517
Multiway synchronization verified with coupled simulation….Pages 518-533
Programming in a general model of synchronization….Pages 534-549
Operational and compositional semantics of synchronous automaton compositions….Pages 550-564
Towards a theory of actor computation….Pages 565-579