LIPIcs, Volume 42, CONCUR 2015

• Luca Aceto and David de Frutos Escrig LIPIcs, Volume 42, CONCUR'15, Complete Volume 10.4230/LIPIcs.CONCUR.2015
• Luca Aceto and David de Frutos Escrig Front Matter, Table of Contents, Preface, Committees, External Reviewers 10.4230/LIPIcs.CONCUR.2015.i
• Roberto Di Cosmo, Michael Lienhardt, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro, and Jakub Zwolakowski Automatic Application Deployment in the Cloud: from Practice to Theory and Back (Invited Paper) 10.4230/LIPIcs.CONCUR.2015.1
• James Worrell Reachability Problems for Continuous Linear Dynamical Systems (Invited Paper) 10.4230/LIPIcs.CONCUR.2015.17
• Narges Khakpour and Mohammad Reza Mousavi Notions of Conformance Testing for Cyber-Physical Systems: Overview and Roadmap (Invited Paper) 10.4230/LIPIcs.CONCUR.2015.18
• Matthew Hennessy Behavioural Equivalences for Co-operating Transactions (Invited Paper) 10.4230/LIPIcs.CONCUR.2015.41
• Alexandra Silva Applications of Automata and Concurrency Theory in Networks (Invited Paper) 10.4230/LIPIcs.CONCUR.2015.42
• Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier Distributed Local Strategies in Broadcast Networks 10.4230/LIPIcs.CONCUR.2015.44
• Andrea Cerone, Giovanni Bernardi, and Alexey Gotsman A Framework for Transactional Consistency Models with Atomic Visibility 10.4230/LIPIcs.CONCUR.2015.58
• Salvatore La Torre, Anca Muscholl, and Igor Walukiewicz Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable 10.4230/LIPIcs.CONCUR.2015.72
• David Harel, Guy Katz, Robby Lampert, Assaf Marron, and Gera Weiss On the Succinctness of Idioms for Concurrent Programming 10.4230/LIPIcs.CONCUR.2015.85
• Romain Brenguier, Jean-François Raskin, and Ocan Sankur Assume-Admissible Synthesis 10.4230/LIPIcs.CONCUR.2015.100
• Paul Hunter, Guillermo A. Pérez, and Jean-François Raskin Reactive Synthesis Without Regret 10.4230/LIPIcs.CONCUR.2015.114
• Eike Best and Raymond Devillers Synthesis of Bounded Choice-Free Petri Nets 10.4230/LIPIcs.CONCUR.2015.128
• Jan Kretinsky, Kim Guldstrand Larsen, Simon Laursen, and Jiri Srba Polynomial Time Decidability of Weighted Synchronization under Partial Observability 10.4230/LIPIcs.CONCUR.2015.142
• Daniel Gebler and Simone Tini SOS Specifications of Probabilistic Systems by Uniformly Continuous Operators 10.4230/LIPIcs.CONCUR.2015.155
• Sadegh Esmaeil Zadeh Soudjani, Alessandro Abate, and Rupak Majumdar Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes 10.4230/LIPIcs.CONCUR.2015.169
• Vojtech Forejt and Jan Krcal On Frequency LTL in Probabilistic Systems 10.4230/LIPIcs.CONCUR.2015.184
• Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, and Tjark Weber Modal Logics for Nominal Transition Systems 10.4230/LIPIcs.CONCUR.2015.198
• Serguei Lenglet and Alan Schmitt Howe's Method for Contextual Semantics 10.4230/LIPIcs.CONCUR.2015.212
• Luca Cardelli, Mirco Tribastone, Max Tschaikowski, and Andrea Vandin Forward and Backward Bisimulations for Chemical Reaction Networks 10.4230/LIPIcs.CONCUR.2015.226
• Filippo Bonchi, Daniela Petrisan, Damien Pous, and Jurriaan Rot Lax Bialgebras and Up-To Techniques for Weak Bisimulations 10.4230/LIPIcs.CONCUR.2015.240
• Taolue Chen, Fu Song, and Zhilin Wu On the Satisfiability of Indexed Linear Temporal Logics 10.4230/LIPIcs.CONCUR.2015.254
• Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge Expresiveness and Complexity Results for Strategic Reasoning 10.4230/LIPIcs.CONCUR.2015.268
• Laura Bocchi, Julien Lange, and Nobuko Yoshida Meeting Deadlines Together 10.4230/LIPIcs.CONCUR.2015.283
• Thomas Brihaye, Gilles Geeraerts, Axel Haddad, and Benjamin Monmege To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games 10.4230/LIPIcs.CONCUR.2015.297
• Patricia Bouyer, Samy Jaziri, and Nicolas Markey On the Value Problem in Weighted Timed Games 10.4230/LIPIcs.CONCUR.2015.311
• Shaull Almagor, Guy Avni, and Orna Kupferman Repairing Multi-Player Games 10.4230/LIPIcs.CONCUR.2015.325
• Cyriac Aiswarya, Benedikt Bollig, and Paul Gastin An Automata-Theoretic Approach to the Verification of Distributed Algorithms 10.4230/LIPIcs.CONCUR.2015.340
• Ernst Moritz Hahn, Guangyuan Li, Sven Schewe, Andrea Turrini, and Lijun Zhang Lazy Probabilistic Model Checking without Determinisation 10.4230/LIPIcs.CONCUR.2015.354
• Dana Fisman and Yoad Lustig A Modular Approach for Büchi Determinization 10.4230/LIPIcs.CONCUR.2015.368
• Fu Song, Weikai Miao, Geguang Pu, and Min Zhang On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference 10.4230/LIPIcs.CONCUR.2015.383
• Dimitrios Kouzapas, Jorge A. Pérez, and Nobuko Yoshida Characteristic Bisimulation for Higher-Order Session Processes 10.4230/LIPIcs.CONCUR.2015.398
• Marco Carbone, Fabrizio Montesi, Carsten Schürmann, and Nobuko Yoshida Multiparty Session Types as Coherence Proofs 10.4230/LIPIcs.CONCUR.2015.412
• Yuxin Deng, Yuan Feng, and Ugo Dal Lago On Coinduction and Quantum Lambda Calculi 10.4230/LIPIcs.CONCUR.2015.427
• Yuan Feng and Mingsheng Ying Toward Automatic Verification of Quantum Cryptographic Protocols 10.4230/LIPIcs.CONCUR.2015.441
• César Rodríguez, Marcelo Sousa, Subodh Sharma, and Daniel Kroening Unfolding-based Partial Order Reduction 10.4230/LIPIcs.CONCUR.2015.456
• Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar Verification of Population Protocols 10.4230/LIPIcs.CONCUR.2015.470
• Ivan Gavran, Filip Niksic, Aditya Kanade, Rupak Majumdar, and Viktor Vafeiadis Rely/Guarantee Reasoning for Asynchronous Programs 10.4230/LIPIcs.CONCUR.2015.483
• David Baelde, Stéphanie Delaune, and Lucca Hirschi Partial Order Reduction for Security Protocols 10.4230/LIPIcs.CONCUR.2015.497