+612 9045 4394
 
CHECKOUT
Concur '96: Concurrency Theory : 7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings - Ugo Montanari

Concur '96: Concurrency Theory

7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings

By: Ugo Montanari (Editor), Vladimiro Sassone (Editor)

Paperback

Published: 7th August 1996
Ships: 5 to 9 business days
5 to 9 business days
$213.24
or 4 easy payments of $53.31 with Learn more

This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996.
The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems.

Retracing Some Paths in Process Algebrap. 1
Process Calculus Based Upon Evaluation to Committed Formp. 18
A Process Algebra with Distributed Prioritiesp. 34
Symbolic Transition Graph with Assignmentp. 50
Models for Concurrent Constraint Programmingp. 66
Comparing Transition Systems with Independence and Asynchronous Transition Systemsp. 84
A Presheaf Semantics of Value-Passing Processesp. 98
Elementary Control Structuresp. 115
On Transformations of Concurrent Object Programsp. 131
On Bisimulations for the Asynchronous [pi]-Calculusp. 147
On the Expressiveness of Internal Mobility in Name-Passing Calculip. 163
Decoding Choice Encodingsp. 179
Infinite Resultsp. 195
Decidability of Bisimulation Equivalence for Normed Pushdown Processesp. 217
The Modal mu-Calculus Alternation Hierarchy is Strictp. 233
Bisimulation Collapse and the Process Taxonomyp. 247
On the Expressive Completeness of the Propositional mu-Calculus with Respect to the Monadic Second Order Logicp. 263
A Facile Tutorialp. 278
Testing Probabilistic Automatap. 299
Extended Markovian Process Algebrap. 315
Rewriting Logic as a Semantic Framework for Concurrency: A Progress Reportp. 331
Truly Concurrent Constraint Programmingp. 373
Constraints as Processesp. 389
A Calculus of Mobile Agentsp. 406
Algebraic Interpretation of Lambda Calculus with Resourcesp. 422
Concurrent Graph and Term Graph Rewritingp. 438
Petri Boxes and Finite Precedencep. 465
Constrained Properties, Semilinear Systems, and Petri Netsp. 481
Linear Constraint Systems as High-Level Netsp. 498
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checkingp. 514
State Equivalences for Rectangular Hybrid Automatap. 530
Verifying Abstractions of Timed Systemsp. 546
Towards Automatic Temporal Logic Verification of Value Passing Process Algebra Using Abstract Interpretationp. 563
Modelling and Verification of Distributed Algorithmsp. 579
An Algorithmic Approach for Checking Closure Properties of [omega]-Regular Languagesp. 596
Towards Automata for Branching Time and Partial Orderp. 611
Asynchronous Cellular Automata for Pomsets without Auto-Concurrencyp. 627
Action Refinement and Property Inheritance in Systems of Sequential Agentsp. 639
A Calculus for Concurrent Objectsp. 655
Refinement in Interworkingsp. 671
Equivalences of Statechartsp. 687
Modular Verification for Shared-Variable Concurrent Programsp. 703
The Impact of Hardware Models on Shared Memory Consistency Conditionsp. 719
Synchronous Development of Asynchronous Systemsp. 735
Author Indexp. 751
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540616047
ISBN-10: 3540616047
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 759
Published: 7th August 1996
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 3.91
Weight (kg): 1.06