CONCUR 2008 - Concurrency Theory : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings / edited by Franck van Breugel, Marsha Chechik.

Format:

Book

Contributor:

Breugel, Franck van, 1966- editor.

Chechik, Marsha, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 5201.

Theoretical Computer Science and General Issues ; 5201

Language:

English

Subjects (All):

Computer programming.

Computer networks.

Computers.

Computer logic.

Programming Techniques.

Computer Communication Networks.

Theory of Computation.

Logics and Meanings of Programs.

Computation by Abstract Devices.

Local Subjects:

Programming Techniques.

Computer Communication Networks.

Theory of Computation.

Logics and Meanings of Programs.

Computation by Abstract Devices.

Physical Description:

1 online resource (XIII, 524 pages).

Edition:

First edition 2008.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.

System Details:

text file PDF

Summary:

This book constitutes the refereed proceedings of the 19th International Conference on Concurrency Theory, CONCUR 2008, held in Toronto, Canada, August 19-22, 2008. The 33 revised full papers presented together with 2 tool papers were carefully reviewed and selected from 120 submissions. The topics include model checking, process calculi, minimization and equivalence checking, types, semantics, probability, bisimulation and simulation, real time, and formal languages.

Contents:

Invited Papers

Beyond Nash Equilibrium: Solution Concepts for the 21st Century

Service Choreography and Orchestration with Conversations

Knowledge and Information in Probabilistic Systems

Taming Concurrency: A Program Verification Perspective

Contributed Papers

A Model of Dynamic Separation for Transactional Memory

Completeness and Nondeterminism in Model Checking Transactional Memories

Semantics of Deterministic Shared-Memory Systems

A Scalable and Oblivious Atomicity Assertion

R-Automata

Distributed Timed Automata with Independently Evolving Clocks

A Context-Free Process as a Pushdown Automaton

Modeling Computational Security in Long-Lived Systems

Contract-Directed Synthesis of Simple Orchestrators

Environment Assumptions for Synthesis

Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning

SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs

Subsequence Invariants

Invariants for Parameterised Boolean Equation Systems

Unfolding-Based Diagnosis of Systems with an Evolving Topology

On the Construction of Sorted Reactive Systems

Dynamic Partial Order Reduction Using Probe Sets

A Space-Efficient Probabilistic Simulation Algorithm

Least Upper Bounds for Probability Measures and Their Applications to Abstractions

Abstraction for Stochastic Systems by Erlang's Method of Stages

On the Minimisation of Acyclic Models

Quasi-Static Scheduling of Communicating Tasks

Strategy Construction for Parity Games with Imperfect Information

Mixing Lossy and Perfect Fifo Channels

On the Reachability Analysis of Acyclic Networks of Pushdown Systems

Spatial and Behavioral Types in the Pi-Calculus

A Spatial Equational Logic for the Applied ?-Calculus

Structured Interactional Exceptions in Session Types

Global Progress in Dynamically Interleaved Multiparty Sessions

Normed BPA vs. Normed BPP Revisited

A Rule Format for Associativity

Deriving Structural Labelled Transitions for Mobile Ambients

Termination Problems in Chemical Kinetics

Towards a Unified Approach to Encodability and Separation Results for Process Calculi

A Notion of Glue Expressiveness for Component-Based Systems.

Other Format:

Printed edition:

ISBN:

978-3-540-85361-9

9783540853619

Access Restriction:

Restricted for use by site license.