CONCUR 2014 - Concurrency Theory : 25th International Conference, CONCUR 2014, Rome, Italy, September 2-5, 2014. Proceedings.

Format:

Book

Contributor:

Baldan, Paolo (Mathematician), editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

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

Theoretical Computer Science and General Issues ; 8704

Language:

English

Subjects (All):

Computer logic.

Software engineering.

Mathematical statistics.

Logic, Symbolic and mathematical.

Logics and Meanings of Programs.

Software Engineering.

Probability and Statistics in Computer Science.

Mathematical Logic and Formal Languages.

Local Subjects:

Logics and Meanings of Programs.

Software Engineering.

Probability and Statistics in Computer Science.

Mathematical Logic and Formal Languages.

Physical Description:

1 online resource (XXII, 594 pages) : 90 illustrations.

Edition:

First edition 2014.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.

System Details:

text file PDF

Summary:

This book constitutes the refereed proceedings of the 25th International Conference on Concurrency Theory, CONCUR 2014, held in Rome, Italy in September 2014. The 35 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 124 submissions. The focus of the conference is on the following topics: process calculi, model checking and abstraction, synthesis, quantitative models, automata and multithreading, complexity, process calculi and types, categories, graphs and quantum systems, automata and time, and games.

Contents:

Laws of Programming: The Algebraic Unification of Theories of Concurrency

The Benefits of Sometimes Not Being Discrete

Deterministic Negotiations: Concurrency for Free

Generalized Bisimulation Metrics

Choreographies, Logically

Deadlock Analysis of Unbounded Process Networks

Trees from Functions as Processes

Bisimulations Up-to: Beyond First-Order Transition Systems

Parameterized Model Checking of Rendezvous Systems

On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability

Lost in Abstraction: Monotonicity in Multi-threaded Programs

Synthesis from Component Libraries with Costs

Compositional Controller Synthesis for Stochastic Games

Synchronizing Strategies under Partial Observability

Probabilistic Robust Timed Games

Perturbation Analysis in Verification of Discrete-Time Markov Chains

Robust Synchronization in Markov Decision Processes

Probabilistic Bisimulation: Naturally on Distributions

Averaging in LTL

Decidable Topologies for Communicating Automata with FIFO and Bag Channels

Controllers for the Verification of Communicating Multi-pushdown Systems

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups

A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman's Algorithm

Bounds on Mobility

Typing Messages for Free in Security Protocols: The Case of Equivalence Properties

Using Higher-Order Contracts to Model Session Types (Extended Abstract)

A Semantic Deconstruction of Session Types

Timed Multiparty Session Types

A Categorical Semantics of Signal Flow Graphs

Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices

A General Framework for Well-Structured Graph Transformation Systems

(Un)decidable Problems about Reachability of Quantum Systems

Ordered Navigation on Multi-attributed Data Words

Verification for Timed Automata Extended with Unbounded Discrete Data Structures

Reducing Clocks in Timed Automata while Preserving Bisimulation

Qualitative Concurrent Parity Games: Bounded Rationality

Adding Negative Prices to Priced Timed Games

Tight Game Abstractions of Probabilistic Automata.

Other Format:

Printed edition:

ISBN:

978-3-662-44584-6

9783662445846

Access Restriction:

Restricted for use by site license.