Concur'93: 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993. Proceedings

ISBN-13: 9783540572084 / Angielski / Miękka / 1993 / 550 str.

Eike Best; Eike Best

Opis

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.

Spis treści

The lambda-calculus with multiplicities.- A multiset semantics for the pi-calculus with replication.- Model checking mobile processes.- A practical technique for process abstraction.- Modular completeness for Communication Closed Layers.- The linear time — Branching time spectrum II.- A classification of models for concurrency.- On the ill-timed but well-caused.- On the reduction of chocs bisimulation to ?-calculus bisimulation.- A theory of bisimulation for the ?-calculus.- Bisimulation equivalence is decidable for basic parallel processes.- A pi-calculus semantics for an object-based design notation.- Programming with broadcasts.- Interpreting broadcast communication in SCCS.- Proof systems for message-passing process algebras.- Refinement and decomposition of value-passing action systems.- Partial-order methods for temporal verification.- Model construction for implicit specifications in modal logic.- Branching time temporal logic and amorphous tree automata.- A generalized event structure for the Muller unfolding of a safe net.- Domains of higher-dimensional automata.- Non interleaving process algebra.- Quiescence, fairness, testing, and the notion of implementation.- Two fully abstract models for UNITY.- Transformations preserving properties and properties preserved by transformations in fair transition systems (extended abstract).- Minimal memory schedules for dataflow networks.- Networks of real-time processes.- Loop parallelization in the polytope model.- ACSR: An algebra of communicating shared resources with dense time and priorities.- An Elimination Theorem for regular behaviours with integration.- A linear local model checking algorithm for CTL.- Local event structures and Petri nets.- A congruence theorem for structured operational semantics with predicates.- From CML to process algebras.- Types for dyadic interaction.- Principal typing schemes in a polyadic ?-calculus.- Structured operational semantics for process algebras and equational axiom systems.

O autorze

Prof. Dr. Eike Best lehrt Theoretische Informatik an der Universität Hildesheim. Er hat in Karlsruhe studiert, in Newcastle (England) promoviert und sich in Bonn für Informatik habilitiert. Seine Forschungsinteressen konzentrieren sich auf das Gebiet Semantik und Verifikation paralleler und verteilter Systeme.