CONCUR '91: 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991. Proceedings

כריכה קדמית
Jos C.M. Baeten, Jan F. Groote
Springer Science & Business Media, 14 באוג׳ 1991 - 540 עמודים
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.
 

מה אומרים אנשים - כתיבת ביקורת

לא מצאנו ביקורות במקומות הרגילים

תוכן

Formal Techniques for Parallel ObjectOriented Languages
1
Causal Models for Rational Algebraic Processes
18
Action and Statebased Logics for Process Algebras
20
A Tool Set for deciding Behavioral Equivalences
23
Causality Based Models for the Design of Concurrent Systems
43
Modal Logics for Mobile Processes
45
Towards a Design Calculus for Communicating Programs
61
A Theory of Testing for ACP
78
the Framework and some Semantics
281
Action Systems and Action Refinement in the Development of Parallel Systems
298
INVARIANT SEMANTICS OF NETS WITH INHIBITOR ARCS
317
Abstract timed observation and process algebra
332
Simulations between Specifications of Distributed Systems
346
Using TruthPreserving Reductions to Improve the Clarity of KripkeModels
361
Completeness in Real Time Process Algebra
376
Distributed CCS
393

Real Space Process Algebra
96
The Failure of Failures in a Paradigm for Asynchronous Communication
111
On the CSP hierarchy
127
A Conditional Operator for CCS
142
Algebraic Formulations of Trace Theory
157
Compositional Synthesis of Live and Bounded Free Choice Petri Nets
172
The Observation Algebra of Spatial Pomsets
188
Synchrony loosening transformations for Interacting Processes
203
A Compositional Model for Layered Distributed Systems
220
Process Algebra with Guards
235
Model Checking and Modular Verification
250
GEOMETRIC LOGIC CAUSALITY AND EVENT STRUCTURES
266
TimeConstrained Automata
408
Relating Processes With Respect to Speed
424
TESTING BETTING AND TIMED TRUE CONCURRENCY
439
Fairness in Models with True Concurrency
455
Efficient Verification of Determinate Processes
470
Experiments on Processes with Backtracking
480
Some finitegraph models for Process Algebra
495
A Method for the Development of Totally Correct SharedState Parallel Programs
510
SYSTEMS SAVE VERIFICATION EFFORT
526
AUTHOR INDEX
541
זכויות יוצרים

מהדורות אחרות - הצג הכל

מונחים וביטויים נפוצים

מידע ביבליוגרפי