## CONCUR '93: 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993 : Proceedings"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."--PUBLISHER'S WEBSITE. |

### What people are saying - Write a review

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

### Other editions - View all

CONCUR'93: 4th International Conference on Concurrency Theory, Hildesheim ... Eike Best No preview available - 2014 |

### Common terms and phrases

abstract action systems algorithm atomic actions automaton axioms Baeten behaviour bisimilarity bisimulation bisimulation equivalence buffer calculus channel Chocs communication Computer Science concurrent congruence consider construction context deadlock defined Definition denote equations event structures example execution expressions finite formula function given Glabbeek graph I/O automata induction infinite info(s interleaving labelled transition system language Lemma linear LNCS loop mapping Milner model checking morphism multiset names node notation Notes in Computer notion occur operational semantics paper parallel composition path format Petri nets polytope polytope model predicate prefix preorder Proc process algebra process calculi proof system properties Proposition quiescent recursive refinement restriction result rules satisfies sequence sequential simulation specification Springer-Verlag strong bisimulation synchronization syntactic syntax systolic arrays T-calculus temporal logic Theorem theory trace transformations transition relation transition system tree variables verification