default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th CONCUR 2017: Berlin, Germany
- Roland Meyer, Uwe Nestmann:
28th International Conference on Concurrency Theory, CONCUR 2017, Berlin, Germany, September 5-8, 2017. LIPIcs 85, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-048-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Alastair F. Donaldson, Jeroen Ketema, Tyler Sorensen, John Wickerson:
Forward Progress on GPU Concurrency (Invited Talk). 1:1-1:13 - Romain Brenguier, Arno Pauly
, Jean-François Raskin, Ocan Sankur:
Admissibility in Games with Imperfect Information (Invited Talk). 2:1-2:23 - Hongseok Yang:
Probabilistic Programming (Invited Talk). 3:1-3:1 - Azadeh Farzan, Zachary Kincaid:
A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk). 4:1-4:11 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Bidirectional Nested Weighted Automata. 5:1-5:16 - Uli Schlachter, Harro Wimmel:
k-Bounded Petri Net Synthesis from Modal Transition Systems. 6:1-6:15 - Ki Yung Ahn, Ross Horne, Alwen Tiu:
A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic. 7:1-7:17 - Adrian Francalanza:
Consistently-Detecting Monitors. 8:1-8:19 - Orna Kupferman, Gal Vardi:
Flow Logic. 9:1-9:18 - Luca Aceto, Ignacio Fábregas, Álvaro García-Pérez, Anna Ingólfsdóttir, Yolanda Ortega-Mallén:
Rule Formats for Nominal Process Calculi. 10:1-10:16 - Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi:
Divergence and Unique Solution of Equations. 11:1-11:16 - Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert:
Controlling a Population. 12:1-12:16 - Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani:
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. 13:1-13:17 - Nicolas David, Claude Jard, Didier Lime, Olivier H. Roux:
Coverability Synthesis in Parametric Petri Nets. 14:1-14:16 - Wan J. Fokkink, Rob J. van Glabbeek, Bas Luttik:
Divide and Congruence III: Stability & Divergence. 15:1-15:16 - Ahmed Bouajjani, Constantin Enea, Chao Wang:
Checking Linearizability of Concurrent Priority Queues. 16:1-16:16 - Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge:
Nash Equilibrium and Bisimulation Invariance. 17:1-17:16 - Thomas Chatain, Loïc Paulevé:
Goal-Driven Unfolding of Petri Nets. 18:1-18:16 - Nathanaël Fijalkow, Cristian Riveros, James Worrell:
Probabilistic Automata of Bounded Ambiguity. 19:1-19:14 - Mingzhang Huang, Qiang Yin:
Two Lower Bounds for BPA. 20:1-20:16 - Guy Avni, Thomas A. Henzinger, Ventsislav Chonev:
Infinite-Duration Bidding Games. 21:1-21:18 - Yuxi Fu:
On the Power of Name-Passing Communication. 22:1-22:15 - Filippo Bonchi, Alexandra Silva, Ana Sokolova:
The Power of Convex Algebras. 23:1-23:18 - Filippo Bonchi, Joshua Holland, Dusko Pavlovic, Pawel Sobocinski:
Refinement for Signal Flow Graphs. 24:1-24:16 - Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi:
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. 25:1-25:16 - Andrea Cerone, Alexey Gotsman, Hongseok Yang:
Algebraic Laws for Weak Consistency. 26:1-26:18 - Qiyi Tang, Franck van Breugel:
Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains. 27:1-27:16 - Paul Brunet, Damien Pous, Georg Struth:
On Decidability of Concurrent Kleene Algebra. 28:1-28:15 - Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma:
Model-Checking Counting Temporal Logics on Flat Structures. 29:1-29:17 - Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Paola Giannini:
Concurrent Reversible Sessions. 30:1-30:17 - Patricia Bouyer, Serge Haddad, Vincent Jugé:
Unbounded Product-Form Petri Nets. 31:1-31:16 - Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann:
Efficient Coalgebraic Partition Refinement. 32:1-32:16 - Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
The Complexity of Flat Freeze LTL. 33:1-33:16 - Andrzej S. Murawski, Nikos Tzevelekos:
Higher-Order Linearisability. 34:1-34:18 - Yuan Feng, Ernst Moritz Hahn, Andrea Turrini, Shenggang Ying:
Model Checking Omega-regular Properties for Quantum Markov Chains . 35:1-35:16 - Nicolas Basset, Jean Mairesse, Michèle Soria:
Uniform Sampling for Networks of Automata. 36:1-36:16 - Taolue Chen, Fu Song, Zhilin Wu:
Tractability of Separation Logic with Inductive Definitions: Beyond Lists. 37:1-37:17 - Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig:
Data Multi-Pushdown Automata. 38:1-38:17 - S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar:
Towards an Efficient Tree Automata Based Technique for Timed Systems. 39:1-39:15 - S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. 40:1-40:17
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-22 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
