<h2>LIPIcs, Volume 85, CONCUR 2017</h2>
<ul>
<li>
<span class="authors">Roland Meyer and Uwe Nestmann</span>
<span class="title">LIPIcs, Volume 85, CONCUR'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017">10.4230/LIPIcs.CONCUR.2017</a>
</li>
<li>
<span class="authors">Roland Meyer and Uwe Nestmann</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.0">10.4230/LIPIcs.CONCUR.2017.0</a>
</li>
<li>
<span class="authors">Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen, and John Wickerson</span>
<span class="title">Forward Progress on GPU Concurrency (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.1">10.4230/LIPIcs.CONCUR.2017.1</a>
</li>
<li>
<span class="authors">Romain Brenguier, Arno Pauly, Jean-François Raskin, and Ocan Sankur</span>
<span class="title">Admissibility in Games with Imperfect Information (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.2">10.4230/LIPIcs.CONCUR.2017.2</a>
</li>
<li>
<span class="authors">Hongseok Yang</span>
<span class="title">Probabilistic Programming (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.3">10.4230/LIPIcs.CONCUR.2017.3</a>
</li>
<li>
<span class="authors">Azadeh Farzan and Zachary Kincaid</span>
<span class="title">A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.4">10.4230/LIPIcs.CONCUR.2017.4</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop</span>
<span class="title">Bidirectional Nested Weighted Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.5">10.4230/LIPIcs.CONCUR.2017.5</a>
</li>
<li>
<span class="authors">Uli Schlachter and Harro Wimmel</span>
<span class="title">k-Bounded Petri Net Synthesis from Modal Transition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.6">10.4230/LIPIcs.CONCUR.2017.6</a>
</li>
<li>
<span class="authors">Ki Yung Ahn, Ross Horne, and Alwen Tiu</span>
<span class="title">A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.7">10.4230/LIPIcs.CONCUR.2017.7</a>
</li>
<li>
<span class="authors">Adrian Francalanza</span>
<span class="title">Consistently-Detecting Monitors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.8">10.4230/LIPIcs.CONCUR.2017.8</a>
</li>
<li>
<span class="authors">Orna Kupferman and Gal Vardi</span>
<span class="title">Flow Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.9">10.4230/LIPIcs.CONCUR.2017.9</a>
</li>
<li>
<span class="authors">Luca Aceto, Ignacio Fábregas, Álvaro García-Pérez, Anna Ingólfsdóttir, and Yolanda Ortega-Mallén</span>
<span class="title">Rule Formats for Nominal Process Calculi</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.10">10.4230/LIPIcs.CONCUR.2017.10</a>
</li>
<li>
<span class="authors">Adrien Durier, Daniel Hirschkoff, and Davide Sangiorgi</span>
<span class="title">Divergence and Unique Solution of Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.11">10.4230/LIPIcs.CONCUR.2017.11</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, and Hugo Gimbert</span>
<span class="title">Controlling a Population</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.12">10.4230/LIPIcs.CONCUR.2017.12</a>
</li>
<li>
<span class="authors">Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, and Sadegh Esmaeil Zadeh Soudjani</span>
<span class="title">The Robot Routing Problem for Collecting Aggregate Stochastic Rewards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.13">10.4230/LIPIcs.CONCUR.2017.13</a>
</li>
<li>
<span class="authors">Nicolas David, Claude Jard, Didier Lime, and Olivier H. Roux</span>
<span class="title">Coverability Synthesis in Parametric Petri Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.14">10.4230/LIPIcs.CONCUR.2017.14</a>
</li>
<li>
<span class="authors">Wan Fokkink, Rob van Glabbeek, and Bas Luttik</span>
<span class="title">Divide and Congruence III: Stability & Divergence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.15">10.4230/LIPIcs.CONCUR.2017.15</a>
</li>
<li>
<span class="authors">Ahmed Bouajjani, Constantin Enea, and Chao Wang</span>
<span class="title">Checking Linearizability of Concurrent Priority Queues</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.16">10.4230/LIPIcs.CONCUR.2017.16</a>
</li>
<li>
<span class="authors">Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, and Michael Wooldridge</span>
<span class="title">Nash Equilibrium and Bisimulation Invariance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.17">10.4230/LIPIcs.CONCUR.2017.17</a>
</li>
<li>
<span class="authors">Thomas Chatain and Loïc Paulevé</span>
<span class="title">Goal-Driven Unfolding of Petri Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.18">10.4230/LIPIcs.CONCUR.2017.18</a>
</li>
<li>
<span class="authors">Nathanaël Fijalkow, Cristian Riveros, and James Worrell</span>
<span class="title">Probabilistic Automata of Bounded Ambiguity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.19">10.4230/LIPIcs.CONCUR.2017.19</a>
</li>
<li>
<span class="authors">Mingzhang Huang and Qiang Yin</span>
<span class="title">Two Lower Bounds for BPA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.20">10.4230/LIPIcs.CONCUR.2017.20</a>
</li>
<li>
<span class="authors">Guy Avni, Thomas A. Henzinger, and Ventsislav Chonev</span>
<span class="title">Infinite-Duration Bidding Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.21">10.4230/LIPIcs.CONCUR.2017.21</a>
</li>
<li>
<span class="authors">Yuxi Fu</span>
<span class="title">On the Power of Name-Passing Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.22">10.4230/LIPIcs.CONCUR.2017.22</a>
</li>
<li>
<span class="authors">Filippo Bonchi, Alexandra Silva, and Ana Sokolova</span>
<span class="title">The Power of Convex Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.23">10.4230/LIPIcs.CONCUR.2017.23</a>
</li>
<li>
<span class="authors">Filippo Bonchi, Joshua Holland, Dusko Pavlovic, and Pawel Sobocinski</span>
<span class="title">Refinement for Signal Flow Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.24">10.4230/LIPIcs.CONCUR.2017.24</a>
</li>
<li>
<span class="authors">Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, and Fabio Zanasi</span>
<span class="title">Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.25">10.4230/LIPIcs.CONCUR.2017.25</a>
</li>
<li>
<span class="authors">Andrea Cerone, Alexey Gotsman, and Hongseok Yang</span>
<span class="title">Algebraic Laws for Weak Consistency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.26">10.4230/LIPIcs.CONCUR.2017.26</a>
</li>
<li>
<span class="authors">Qiyi Tang and Franck van Breugel</span>
<span class="title">Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.27">10.4230/LIPIcs.CONCUR.2017.27</a>
</li>
<li>
<span class="authors">Paul Brunet, Damien Pous, and Georg Struth</span>
<span class="title">On Decidability of Concurrent Kleene Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.28">10.4230/LIPIcs.CONCUR.2017.28</a>
</li>
<li>
<span class="authors">Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, and Daniel Thoma</span>
<span class="title">Model-Checking Counting Temporal Logics on Flat Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.29">10.4230/LIPIcs.CONCUR.2017.29</a>
</li>
<li>
<span class="authors">Ilaria Castellani, Mariangiola Dezani-Ciancaglini, and Paola Giannini</span>
<span class="title">Concurrent Reversible Sessions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.30">10.4230/LIPIcs.CONCUR.2017.30</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Serge Haddad, and Vincent Jugé</span>
<span class="title">Unbounded Product-Form Petri Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.31">10.4230/LIPIcs.CONCUR.2017.31</a>
</li>
<li>
<span class="authors">Ulrich Dorsch, Stefan Milius, Lutz Schröder, and Thorsten Wißmann</span>
<span class="title">Efficient Coalgebraic Partition Refinement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.32">10.4230/LIPIcs.CONCUR.2017.32</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Karin Quaas, and Arnaud Sangnier</span>
<span class="title">The Complexity of Flat Freeze LTL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.33">10.4230/LIPIcs.CONCUR.2017.33</a>
</li>
<li>
<span class="authors">Andrzej S. Murawski and Nikos Tzevelekos</span>
<span class="title">Higher-Order Linearisability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.34">10.4230/LIPIcs.CONCUR.2017.34</a>
</li>
<li>
<span class="authors">Yuan Feng, Ernst Moritz Hahn, Andrea Turrini, and Shenggang Ying</span>
<span class="title">Model Checking Omega-regular Properties for Quantum Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.35">10.4230/LIPIcs.CONCUR.2017.35</a>
</li>
<li>
<span class="authors">Nicolas Basset, Jean Mairesse, and Michèle Soria</span>
<span class="title">Uniform Sampling for Networks of Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.36">10.4230/LIPIcs.CONCUR.2017.36</a>
</li>
<li>
<span class="authors">Taolue Chen, Fu Song, and Zhilin Wu</span>
<span class="title">Tractability of Separation Logic with Inductive Definitions: Beyond Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.37">10.4230/LIPIcs.CONCUR.2017.37</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, C. Aiswarya, and Mohamed Faouzi Atig</span>
<span class="title">Data Multi-Pushdown Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.38">10.4230/LIPIcs.CONCUR.2017.38</a>
</li>
<li>
<span class="authors">S. Akshay, Paul Gastin, Shankara Narayanan Krishna, and Ilias Sarkar</span>
<span class="title">Towards an Efficient Tree Automata Based Technique for Timed Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.39">10.4230/LIPIcs.CONCUR.2017.39</a>
</li>
<li>
<span class="authors">S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, and Sai Sandeep</span>
<span class="title">On Petri Nets with Hierarchical Special Arcs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2017.40">10.4230/LIPIcs.CONCUR.2017.40</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