<h2>LIPIcs, Volume 118, CONCUR 2018</h2>
<ul>
<li>
<span class="authors">Sven Schewe and Lijun Zhang</span>
<span class="title">LIPIcs, Volume 118, CONCUR'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018">10.4230/LIPIcs.CONCUR.2018</a>
</li>
<li>
<span class="authors">Sven Schewe and Lijun Zhang</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.0">10.4230/LIPIcs.CONCUR.2018.0</a>
</li>
<li>
<span class="authors">Moshe Y. Vardi</span>
<span class="title">The Siren Song of Temporal Synthesis (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.1">10.4230/LIPIcs.CONCUR.2018.1</a>
</li>
<li>
<span class="authors">Yuxin Deng</span>
<span class="title">Bisimulations for Probabilistic and Quantum Processes (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.2">10.4230/LIPIcs.CONCUR.2018.2</a>
</li>
<li>
<span class="authors">Rob van Glabbeek</span>
<span class="title">Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.3">10.4230/LIPIcs.CONCUR.2018.3</a>
</li>
<li>
<span class="authors">Andy Polyakov, Ming-Hsien Tsai, Bow-Yaw Wang, and Bo-Yin Yang</span>
<span class="title">Verifying Arithmetic Assembly Programs in Cryptographic Primitives (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.4">10.4230/LIPIcs.CONCUR.2018.4</a>
</li>
<li>
<span class="authors">Ichiro Hasuo</span>
<span class="title">Coalgebraic Theory of Büchi and Parity Automata: Fixed-Point Specifications, Categorically (Invited Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.5">10.4230/LIPIcs.CONCUR.2018.5</a>
</li>
<li>
<span class="authors">Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, and Patrick Totzke</span>
<span class="title">Universal Safety for Timed Petri Nets is PSPACE-complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.6">10.4230/LIPIcs.CONCUR.2018.6</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Marie Fortin, and Paul Gastin</span>
<span class="title">It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.7">10.4230/LIPIcs.CONCUR.2018.7</a>
</li>
<li>
<span class="authors">Jan Kretínský, Guillermo A. Pérez, and Jean-François Raskin</span>
<span class="title">Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.8">10.4230/LIPIcs.CONCUR.2018.8</a>
</li>
<li>
<span class="authors">Qiyi Tang and Franck van Breugel</span>
<span class="title">Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.9">10.4230/LIPIcs.CONCUR.2018.9</a>
</li>
<li>
<span class="authors">Jakub Michaliszyn and Jan Otop</span>
<span class="title">Non-deterministic Weighted Automata on Random Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.10">10.4230/LIPIcs.CONCUR.2018.10</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner</span>
<span class="title">Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.11">10.4230/LIPIcs.CONCUR.2018.11</a>
</li>
<li>
<span class="authors">Roland Meyer, Sebastian Muskalla, and Georg Zetzsche</span>
<span class="title">Bounded Context Switching for Valence Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.12">10.4230/LIPIcs.CONCUR.2018.12</a>
</li>
<li>
<span class="authors">Paulin Fournier and Hugo Gimbert</span>
<span class="title">Alternating Nonzero Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.13">10.4230/LIPIcs.CONCUR.2018.13</a>
</li>
<li>
<span class="authors">Michael Blondin, Christoph Haase, and Filip Mazowiecki</span>
<span class="title">Affine Extensions of Integer Vector Addition Systems with States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.14">10.4230/LIPIcs.CONCUR.2018.14</a>
</li>
<li>
<span class="authors">Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan</span>
<span class="title">Verifying Quantitative Temporal Properties of Procedural Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.15">10.4230/LIPIcs.CONCUR.2018.15</a>
</li>
<li>
<span class="authors">Ronny Tredup and Christian Rosenke</span>
<span class="title">Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.16">10.4230/LIPIcs.CONCUR.2018.16</a>
</li>
<li>
<span class="authors">Filippo Bonchi, Barbara König, and Daniela Petrisan</span>
<span class="title">Up-To Techniques for Behavioural Metrics via Fibrations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.17">10.4230/LIPIcs.CONCUR.2018.17</a>
</li>
<li>
<span class="authors">Amina Doumane and Damien Pous</span>
<span class="title">Completeness for Identity-free Kleene Lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.18">10.4230/LIPIcs.CONCUR.2018.18</a>
</li>
<li>
<span class="authors">Jure Kukovec, Igor Konnov, and Josef Widder</span>
<span class="title">Reachability in Parameterized Systems: All Flavors of Threshold Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.19">10.4230/LIPIcs.CONCUR.2018.19</a>
</li>
<li>
<span class="authors">Radu Grigore and Stefan Kiefer</span>
<span class="title">Selective Monitoring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.20">10.4230/LIPIcs.CONCUR.2018.20</a>
</li>
<li>
<span class="authors">Bernhard Kragl, Shaz Qadeer, and Thomas A. Henzinger</span>
<span class="title">Synchronizing the Asynchronous</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.21">10.4230/LIPIcs.CONCUR.2018.21</a>
</li>
<li>
<span class="authors">Sergey Goncharov, Julian Jakob, and Renato Neves</span>
<span class="title">A Semantics for Hybrid Iteration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.22">10.4230/LIPIcs.CONCUR.2018.22</a>
</li>
<li>
<span class="authors">Tyler Sorensen, Hugues Evrard, and Alastair F. Donaldson</span>
<span class="title">GPU Schedulers: How Fair Is Fair Enough?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.23">10.4230/LIPIcs.CONCUR.2018.23</a>
</li>
<li>
<span class="authors">Piotr Hofman and Slawomir Lasota</span>
<span class="title">Linear Equations with Ordered Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.24">10.4230/LIPIcs.CONCUR.2018.24</a>
</li>
<li>
<span class="authors">Tomasz Brengos</span>
<span class="title">A Coalgebraic Take on Regular and omega-Regular Behaviour for Systems with Internal Moves</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.25">10.4230/LIPIcs.CONCUR.2018.25</a>
</li>
<li>
<span class="authors">Nima Roohi, Pavithra Prabhakar, and Mahesh Viswanathan</span>
<span class="title">Relating Syntactic and Semantic Perturbations of Hybrid Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.26">10.4230/LIPIcs.CONCUR.2018.26</a>
</li>
<li>
<span class="authors">Benjamin Cabrera, Tobias Heindel, Reiko Heckel, and Barbara König</span>
<span class="title">Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.27">10.4230/LIPIcs.CONCUR.2018.27</a>
</li>
<li>
<span class="authors">Paul Gastin, Sayan Mukherjee, and B. Srivathsan</span>
<span class="title">Reachability in Timed Automata with Diagonal Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.28">10.4230/LIPIcs.CONCUR.2018.28</a>
</li>
<li>
<span class="authors">Véronique Bruyère, Quentin Hautem, and Jean-François Raskin</span>
<span class="title">Parameterized complexity of games with monotonically ordered omega-regular objectives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.29">10.4230/LIPIcs.CONCUR.2018.29</a>
</li>
<li>
<span class="authors">Stephanie Balzer, Frank Pfenning, and Bernardo Toninho</span>
<span class="title">A Universal Session Type for Untyped Asynchronous Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.30">10.4230/LIPIcs.CONCUR.2018.30</a>
</li>
<li>
<span class="authors">Javier Esparza, Pierre Ganty, Rupak Majumdar, and Chana Weil-Kennedy</span>
<span class="title">Verification of Immediate Observation Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.31">10.4230/LIPIcs.CONCUR.2018.31</a>
</li>
<li>
<span class="authors">Jan Kretínský and Alexej Rotar</span>
<span class="title">The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.32">10.4230/LIPIcs.CONCUR.2018.32</a>
</li>
<li>
<span class="authors">Michael Blondin, Javier Esparza, and Antonín Kucera</span>
<span class="title">Automatic Analysis of Expected Termination Time for Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.33">10.4230/LIPIcs.CONCUR.2018.33</a>
</li>
<li>
<span class="authors">Luca Aceto, Ian Cassar, Adrian Francalanza, and Anna Ingólfsdóttir</span>
<span class="title">On Runtime Enforcement via Suppressions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.34">10.4230/LIPIcs.CONCUR.2018.34</a>
</li>
<li>
<span class="authors">Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, and Prakash Saivasan</span>
<span class="title">Regular Separability of Well-Structured Transition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.35">10.4230/LIPIcs.CONCUR.2018.35</a>
</li>
<li>
<span class="authors">Andrey Gorlin and C. R. Ramakrishnan</span>
<span class="title">Separable GPL: Decidable Model Checking with More Non-Determinism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.36">10.4230/LIPIcs.CONCUR.2018.36</a>
</li>
<li>
<span class="authors">Barbara König and Christina Mika-Michalski</span>
<span class="title">(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.37">10.4230/LIPIcs.CONCUR.2018.37</a>
</li>
<li>
<span class="authors">Rodica Condurache, Youssouf Oualhadj, and Nicolas Troquard</span>
<span class="title">The Complexity of Rational Synthesis for Concurrent Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.38">10.4230/LIPIcs.CONCUR.2018.38</a>
</li>
<li>
<span class="authors">Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya</span>
<span class="title">Logics Meet 1-Clock Alternating Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.39">10.4230/LIPIcs.CONCUR.2018.39</a>
</li>
<li>
<span class="authors">Massimo Bartoletti, Laura Bocchi, and Maurizio Murgia</span>
<span class="title">Progress-Preserving Refinements of CTA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.40">10.4230/LIPIcs.CONCUR.2018.40</a>
</li>
<li>
<span class="authors">Kartik Nagar and Suresh Jagannathan</span>
<span class="title">Automated Detection of Serializability Violations Under Weak Consistency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.41">10.4230/LIPIcs.CONCUR.2018.41</a>
</li>
<li>
<span class="authors">Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, and James Worrell</span>
<span class="title">Effective Divergence Analysis for Linear Recurrence Sequences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CONCUR.2018.42">10.4230/LIPIcs.CONCUR.2018.42</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