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