LIPIcs, Volume 85, CONCUR 2017

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