+612 9045 4394
 
CHECKOUT
Concur '98 Concurrency Theory : 9th International Conference, Nice, France, September 8-11, 1998, Proceedings - Davide Sangiorgi

Concur '98 Concurrency Theory

9th International Conference, Nice, France, September 8-11, 1998, Proceedings

By: Davide Sangiorgi (Editor), Robert de Simone (Editor)

Paperback Published: 19th August 1998
ISBN: 9783540648963
Number Of Pages: 663

Share This Book:

Paperback

$204.16
or 4 easy payments of $51.04 with Learn more
Ships in 5 to 9 business days

This book constitutes the refereed proceedings of the 9th International Conference on Concurrency Theory, CONCUR'98, held in Nice, France, in September 1998.
The 35 revised full papers presented were carefully selected from a total of 104 submissions. Also presented are five invited contributions. Among the topics covered are moduls of computation and semantic domains, process algebras, Petri Nets, event structures, real-time systems, hybrid systems, model checking, verification techniques, refinement, rewriting, typing systems and algorithms, etc..

Sometimes and Not Never Re-revisited: On Branching Versus Linear Timep. 1
Controllers for Discrete Event Systems via Morphismsp. 18
Synthesis from Knowledge-Based Specificationsp. 34
The Regular Viewpoint on PA-Processesp. 50
Herbrand Automata for Hardware Verificationp. 67
Control Flow Analysis for the pi-calculusp. 84
The Tau-Laws of Fusionp. 99
From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operatorsp. 115
Minimality and Separation Results on Asynchronous Mobile Processes: Representability Theorems by Concurrent Combinatorsp. 131
Abstract Games for Infinite State Processesp. 147
Alternating Refinement Relationsp. 163
Possible Worlds for Process Algebrasp. 179
Automate and Coinduction (an Exercise in Coalgebra)p. 194
Axioms for Real-Time Logicsp. 219
Priority and Maximal Progress are Completely Axiomatisablep. 237
Simulation is Decidable for One-counter Netsp. 253
From Rewrite Rules to Bisimulation Congruencesp. 269
Reasoning about Asynchronous Communication in Dynamically Evolving Object Structuresp. 285
Modelling IP Mobilityp. 301
Reduction in TLAp. 317
Detecting Deadlocks in Concurrent Systemsp. 332
Unfold/Fold Transformations of CCP Programsp. 348
Type Systems for Concurrent Calculip. 364
Stochastic Process Algebras: Benefits for Performance Evaluation and Challengesp. 366
Algebraic Techniques for Timed Systemsp. 373
Probabilistic Resource Failure in Real-Time Process Algebrap. 389
Towards Performance Evaluation with General Distributions in Process Algebrasp. 405
Stochastic Transition Systemsp. 423
It's About Time: Real-Time Logics Reviewedp. 439
Controlled Timed Automatap. 455
On Discretization of Delays in Timed Automata and Digital Circuitsp. 470
Partial Order Reductions for Timed Systemsp. 485
Unfolding and Finite Prefix for Nets with Read Arcsp. 501
Asynchronous Cellular Automata and Asynchronous Automata for Pomsetsp. 517
Deriving Unbounded Petri Nets from Formal Languagesp. 533
Decompositions of Asynchronous Systemsp. 549
Synthesis of ENI-systems Using Minimal Regionsp. 565
A Categorical Axiomatics for Bisimulationp. 581
Fibrational Semantics of Dataflow Networksp. 597
A Relational Model of Non-deterministic Dataflowp. 613
Checking Verifications of Protocols and Distributed Systems by Computerp. 629
Author Indexp. 657
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540648963
ISBN-10: 3540648968
Series: Lecture Notes in Computer Science,
Audience: General
Format: Paperback
Language: English
Number Of Pages: 663
Published: 19th August 1998
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 3.45
Weight (kg): 0.93