## CONCUR '92: Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24-27, 1992 : Proceedings"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."--PUBLISHER'S WEBSITE. |

### What people are saying - Write a review

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

### Contents

The Polyadic trCalculus | 1 |

Testing Equivalence for Petri Nets with Action Refinement | 17 |

Proof Techniques | 32 |

Copyright | |

24 other sections not shown

### Other editions - View all

CONCUR '92: Third International Conference on Concurrency Theory, Stony ... Walter R. Cleaveland No preview available - 2014 |

### Common terms and phrases

abstract action refinement actor algorithm automaton axioms behavior bicomplexes bisimilar bisimulation equivalence C. A. R. Hoare Communicating Sequential Processes communication Computer Science concurrent condition configurations congruence context corresponding defined Definition denote distributed divtr(L elements equations event structures example execution expressions families of posets finite formal formula function Glabbeek I/O Automata implies infinite initial input interface interleaving sequence labeled transition systems labels language Lemma linear temporal logic LNCS mapping morphism node normal form notation Notes in Computer notion observation occurrence operational semantics parallel composition partial order partition Petri Nets posets prefix preorder process algebra proof Proposition protocol prove recursion relation restriction rules satisfies sequence sequential Springer-Verlag synchronization temporal logic temporal properties Theorem theory trace transition relation transition system variables verification weak bisimulation WT nets