+612 9045 4394
 
CHECKOUT
Concur '91 : 2nd International Conference on Concurrency Theory, Amsterdam, the Netherlands, August 26-29, 1991. Proceedings - J. C. M. Baeten

Concur '91

2nd International Conference on Concurrency Theory, Amsterdam, the Netherlands, August 26-29, 1991. Proceedings

By: J. C. M. Baeten (Editor), Jan F. Groote (Editor)

Paperback

Published: 14th August 1991
Ships: 15 business days
15 business days
$173.29
or 4 easy payments of $43.32 with Learn more

CONCUR'91 is the second international conference onconcurrency theory, organized in association with the NFIproject Transfer. It is a sequel to the CONCUR'90conference. Its basic aim is to communicate ongoing work inconcurrency theory. This proceedings volume contains 30papers selected for presentation at the conference (from 71submitted) together with four invited papers and abstractsof the other invited papers. The papers are organized intosections on process algebras, logics and model checking,applications and specification languages, models and nettheory, design and real-time, tools and probabilities, andprogramming languages. The proceedings of CONCUR'90 areavailable asVolume 458 of Lecture Notes in ComputerScience.

Formal techniques for parallel object-oriented languages.- Causal models for rational algebraic processes.- Action and state-based logics for process algebras.- A tool set for deciding behavioral equivalences.- Causality based models for the design of concurrent systems.- Modal logics for mobile processes.- Towards a design calculus for communicating programs.- A theory of testing for ACP.- Real space process algebra.- The failure of failures in a paradigm for asynchronous communication.- Embedding as a tool for language comparison: On the CSP hierarchy.- A conditional operator for CCS.- Algebraic formulations of trace theory.- Compositional synthesis of live and bounded free choice Petri nets.- The observation algebra of spatial pomsets.- Synchrony loosening transformations for interacting processes.- A compositional model for layered distributed systems.- Process algebra with guards.- Model checking and modular verification.- Geometric logic, causality and event structures.- Extended Horn clauses: the framework and some semantics.- Action systems and action refinement in the development of parallel systems.- Invariant semantics of nets with inhibitor arcs.- Abstract timed observation and process algebra.- Simulations between specifications of distributed systems.- Using truth-preserving reductions to improve the clarity of kripke-models.- Completeness in real time process algebra.- Distributed CCS.- Time-constrained automata.- Relating processes with respect to speed.- Testing, betting and timed true concurrency.- Fairness in models with true concurrency.- Efficient verification of determinate processes.- Experiments on processes with backtracking.- Some finite-graph models for process algebra.- A method for the development of totally correct shared-state parallel programs.- Reduced labelled transition systems save verification effort.

ISBN: 9783540544302
ISBN-10: 3540544305
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 549
Published: 14th August 1991
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.9
Weight (kg): 0.78