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.
Author(s): Joseph Y. Halpern (auth.), Franck van Breugel, Marsha Chechik (eds.)
Series: Lecture Notes in Computer Science 5201
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 524
City: London
Tags: Logics and Meanings of Programs; Computation by Abstract Devices; Programming Techniques; Theory of Computation; Computer Communication Networks
Front Matter....Pages -
Beyond Nash Equilibrium: Solution Concepts for the 21st Century....Pages 1-1
Service Choreography and Orchestration with Conversations....Pages 2-3
Knowledge and Information in Probabilistic Systems....Pages 4-4
Taming Concurrency: A Program Verification Perspective....Pages 5-5
A Model of Dynamic Separation for Transactional Memory....Pages 6-20
Completeness and Nondeterminism in Model Checking Transactional Memories....Pages 21-35
Semantics of Deterministic Shared-Memory Systems....Pages 36-51
A Scalable and Oblivious Atomicity Assertion....Pages 52-66
R-Automata....Pages 67-81
Distributed Timed Automata with Independently Evolving Clocks....Pages 82-97
A Context-Free Process as a Pushdown Automaton....Pages 98-113
Modeling Computational Security in Long-Lived Systems....Pages 114-130
Contract-Directed Synthesis of Simple Orchestrators....Pages 131-146
Environment Assumptions for Synthesis....Pages 147-161
Smyle : A Tool for Synthesizing Distributed Models from Scenarios by Learning....Pages 162-166
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs....Pages 167-171
Subsequence Invariants....Pages 172-186
Invariants for Parameterised Boolean Equation Systems....Pages 187-202
Unfolding-Based Diagnosis of Systems with an Evolving Topology....Pages 203-217
On the Construction of Sorted Reactive Systems....Pages 218-232
Dynamic Partial Order Reduction Using Probe Sets....Pages 233-247
A Space-Efficient Probabilistic Simulation Algorithm....Pages 248-263
Least Upper Bounds for Probability Measures and Their Applications to Abstractions....Pages 264-278
Abstraction for Stochastic Systems by Erlang’s Method of Stages....Pages 279-294
On the Minimisation of Acyclic Models....Pages 295-309
Quasi-Static Scheduling of Communicating Tasks....Pages 310-324
Strategy Construction for Parity Games with Imperfect Information....Pages 325-339
Mixing Lossy and Perfect Fifo Channels....Pages 340-355
On the Reachability Analysis of Acyclic Networks of Pushdown Systems....Pages 356-371
Spatial and Behavioral Types in the Pi-Calculus....Pages 372-386
A Spatial Equational Logic for the Applied π -Calculus....Pages 387-401
Structured Interactional Exceptions in Session Types....Pages 402-417
Global Progress in Dynamically Interleaved Multiparty Sessions....Pages 418-433
Normed BPA vs. Normed BPP Revisited....Pages 434-446
A Rule Format for Associativity....Pages 447-461
Deriving Structural Labelled Transitions for Mobile Ambients....Pages 462-476
Termination Problems in Chemical Kinetics....Pages 477-491
Towards a Unified Approach to Encodability and Separation Results for Process Calculi....Pages 492-507
A Notion of Glue Expressiveness for Component-Based Systems....Pages 508-522
Back Matter....Pages -
