UID:
almahu_9948621595102882
Format:
XI, 549 p.
,
online resource.
Edition:
1st ed. 1991.
ISBN:
9783540383574
Series Statement:
Lecture Notes in Computer Science, 527
Content:
CONCUR'91 is the second international conference on concurrency theory, organized in association with the NFI project Transfer. It is a sequel to the CONCUR'90 conference. Its basic aim is to communicate ongoing work in concurrency theory. This proceedings volume contains 30 papers selected for presentation at the conference (from 71 submitted) together with four invited papers and abstracts of the other invited papers. The papers are organized into sections on process algebras, logics and model checking, applications and specification languages, models and net theory, design and real-time, tools and probabilities, and programming languages. The proceedings of CONCUR'90 are available asVolume 458 of Lecture Notes in Computer Science.
Note:
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.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783662203736
Additional Edition:
Printed edition: ISBN 9783540544302
Language:
English
DOI:
10.1007/3-540-54430-5
URL:
https://doi.org/10.1007/3-540-54430-5
