[go: up one dir, main page]
Skip to main content
Springer Nature Link
Account

CONCUR 2014 – Concurrency Theory

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

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Paolo Baldan

    1. Department of Mathematics, University of Padova, Padova, Italy

  2. Daniele Gorla

    1. Department of Computer Science, University of Roma “La Sapienza”, Rome, Italy

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8704)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CONCUR 2014.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook EUR 42.79
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 52.74
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (39 papers)

  1. Front Matter

    Download chapter PDF

  3. Invited Talks

    1. The Benefits of Sometimes Not Being Discrete

      • Jane Hillston
      Pages 7-22

    2. Deterministic Negotiations: Concurrency for Free

      • Javier Esparza
      Pages 23-31

    3. Generalized Bisimulation Metrics

      • Konstantinos Chatzikokolakis, Daniel Gebler, Catuscia Palamidessi, Lili Xu
      Pages 32-46

  4. Process Calculi

    1. Choreographies, Logically

      • Marco Carbone, Fabrizio Montesi, Carsten Schürmann
      Pages 47-62

    2. Deadlock Analysis of Unbounded Process Networks

      • Elena Giachino, Naoki Kobayashi, Cosimo Laneve
      Pages 63-77

    3. Trees from Functions as Processes

      • Davide Sangiorgi, Xian Xu
      Pages 78-92

    4. Bisimulations Up-to: Beyond First-Order Transition Systems

      • Jean-Marie Madiot, Damien Pous, Davide Sangiorgi
      Pages 93-108

  5. Model Checking and Abstraction

    1. Parameterized Model Checking of Rendezvous Systems

      • Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith
      Pages 109-124

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

      • Igor Konnov, Helmut Veith, Josef Widder
      Pages 125-140

    3. Lost in Abstraction: Monotonicity in Multi-threaded Programs

      • Alexander Kaiser, Daniel Kroening, Thomas Wahl
      Pages 141-155

  6. Synthesis

    1. Synthesis from Component Libraries with Costs

      • Guy Avni, Orna Kupferman
      Pages 156-172

    2. Compositional Controller Synthesis for Stochastic Games

      • Nicolas Basset, Marta Kwiatkowska, Clemens Wiltsche
      Pages 173-187

    3. Synchronizing Strategies under Partial Observability

      • Kim Guldstrand Larsen, Simon Laursen, Jiří Srba
      Pages 188-202

    4. Probabilistic Robust Timed Games

      • Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur
      Pages 203-217

  7. Quantitative Models

    1. Perturbation Analysis in Verification of Discrete-Time Markov Chains

      • Taolue Chen, Yuan Feng, David S. Rosenblum, Guoxin Su
      Pages 218-233

    2. Robust Synchronization in Markov Decision Processes

      • Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
      Pages 234-248

    3. Probabilistic Bisimulation: Naturally on Distributions

      • Holger Hermanns, Jan Krčál, Jan Křetínský
      Pages 249-265

    4. Averaging in LTL

      • Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel
      Pages 266-280
Back to top

Other volumes

  1. CONCUR 2014 – Concurrency Theory

Editors and Affiliations

  • Department of Mathematics, University of Padova, Padova, Italy

    Paolo Baldan

  • Department of Computer Science, University of Roma “La Sapienza”, Rome, Italy

    Daniele Gorla

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top