@Proceedings{fokkink_et_al:LIPIcs.CONCUR.2019,
title = {{LIPIcs, Volume 140, CONCUR'19, Complete Volume}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019},
URN = {urn:nbn:de:0030-drops-112105},
doi = {10.4230/LIPIcs.CONCUR.2019},
annote = {Keywords: Theory of computation, Concurrency}
}
@InProceedings{fokkink_et_al:LIPIcs.CONCUR.2019.0,
author = {Fokkink, Wan and van Glabbeek, Rob},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.0},
URN = {urn:nbn:de:0030-drops-109026},
doi = {10.4230/LIPIcs.CONCUR.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{kwiatkowska:LIPIcs.CONCUR.2019.1,
author = {Kwiatkowska, Marta Z.},
title = {{Safety Verification for Deep Neural Networks with Provable Guarantees}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {1:1--1:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.1},
URN = {urn:nbn:de:0030-drops-109036},
doi = {10.4230/LIPIcs.CONCUR.2019.1},
annote = {Keywords: Neural networks, robustness, formal verification, Bayesian neural networks}
}
@InProceedings{larsen:LIPIcs.CONCUR.2019.2,
author = {Larsen, Kim G.},
title = {{Synthesis of Safe, Optimal and Compact Strategies for Stochastic Hybrid Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {2:1--2:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.2},
URN = {urn:nbn:de:0030-drops-109048},
doi = {10.4230/LIPIcs.CONCUR.2019.2},
annote = {Keywords: Timed automata, Stochastic hybrid grame, Symbolic synthesis, Reinforcement learning, Q-learning, M-learning}
}
@InProceedings{ouaknine:LIPIcs.CONCUR.2019.3,
author = {Ouaknine, Jo\"{e}l},
title = {{Program Invariants}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.3},
URN = {urn:nbn:de:0030-drops-109056},
doi = {10.4230/LIPIcs.CONCUR.2019.3},
annote = {Keywords: Automated invariant generation, program analysis and verification}
}
@InProceedings{vandepol:LIPIcs.CONCUR.2019.4,
author = {van de Pol, Jaco},
title = {{Concurrent Algorithms and Data Structures for Model Checking}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {4:1--4:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.4},
URN = {urn:nbn:de:0030-drops-109066},
doi = {10.4230/LIPIcs.CONCUR.2019.4},
annote = {Keywords: model checking, parallel algorithms, concurrent datastructures}
}
@InProceedings{kretinsky_et_al:LIPIcs.CONCUR.2019.5,
author = {K\v{r}et{\'\i}nsk\'{y}, Jan and Meggendorfer, Tobias},
title = {{Of Cores: A Partial-Exploration Framework for Markov Decision Processes}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {5:1--5:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.5},
URN = {urn:nbn:de:0030-drops-109076},
doi = {10.4230/LIPIcs.CONCUR.2019.5},
annote = {Keywords: Markov Decision Processes, Reachability, Approximation}
}
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2019.6,
author = {Chatterjee, Krishnendu and Piterman, Nir},
title = {{Combinations of Qualitative Winning for Stochastic Parity Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {6:1--6:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.6},
URN = {urn:nbn:de:0030-drops-109089},
doi = {10.4230/LIPIcs.CONCUR.2019.6},
annote = {Keywords: Two Player Games, Stochastic Games, Parity Winning Conditions}
}
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2019.7,
author = {Chatterjee, Krishnendu and Dvo\v{r}\'{a}k, Wolfgang and Henzinger, Monika and Svozil, Alexander},
title = {{Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.7},
URN = {urn:nbn:de:0030-drops-109093},
doi = {10.4230/LIPIcs.CONCUR.2019.7},
annote = {Keywords: model checking, graph games, Streett games}
}
@InProceedings{brihaye_et_al:LIPIcs.CONCUR.2019.8,
author = {Brihaye, Thomas and Delgrange, Florent and Oualhadj, Youssouf and Randour, Mickael},
title = {{Life Is Random, Time Is Not: Markov Decision Processes with Window Objectives}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.8},
URN = {urn:nbn:de:0030-drops-109103},
doi = {10.4230/LIPIcs.CONCUR.2019.8},
annote = {Keywords: Markov decision processes, window mean-payoff, window parity}
}
@InProceedings{bacci_et_al:LIPIcs.CONCUR.2019.9,
author = {Bacci, Giorgio and Bacci, Giovanni and Larsen, Kim G. and Mardare, Radu and Tang, Qiyi and van Breugel, Franck},
title = {{Computing Probabilistic Bisimilarity Distances for Probabilistic Automata}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.9},
URN = {urn:nbn:de:0030-drops-109119},
doi = {10.4230/LIPIcs.CONCUR.2019.9},
annote = {Keywords: Probabilistic automata, Behavioural metrics, Simple stochastic games, Simple policy iteration algorithm}
}
@InProceedings{chistikov_et_al:LIPIcs.CONCUR.2019.10,
author = {Chistikov, Dmitry and Murawski, Andrzej S. and Purser, David},
title = {{Asymmetric Distances for Approximate Differential Privacy}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.10},
URN = {urn:nbn:de:0030-drops-109121},
doi = {10.4230/LIPIcs.CONCUR.2019.10},
annote = {Keywords: Bisimilarity distances, Differential privacy, Labelled Markov chains}
}
@InProceedings{devisme:LIPIcs.CONCUR.2019.11,
author = {de Visme, Marc},
title = {{Event Structures for Mixed Choice}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.11},
URN = {urn:nbn:de:0030-drops-109137},
doi = {10.4230/LIPIcs.CONCUR.2019.11},
annote = {Keywords: probability, nondeterminism, concurrency, event structures, CCS}
}
@InProceedings{finkel_et_al:LIPIcs.CONCUR.2019.12,
author = {Finkel, Alain and Praveen, M.},
title = {{Verification of Flat FIFO Systems}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.12},
URN = {urn:nbn:de:0030-drops-109147},
doi = {10.4230/LIPIcs.CONCUR.2019.12},
annote = {Keywords: Infinite state systems, FIFO, counters, flat systems, reachability, termination, complexity}
}
@InProceedings{brihaye_et_al:LIPIcs.CONCUR.2019.13,
author = {Brihaye, Thomas and Bruy\`{e}re, V\'{e}ronique and Goeminne, Aline and Raskin, Jean-Fran\c{c}ois and van den Bogaard, Marie},
title = {{The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.13},
URN = {urn:nbn:de:0030-drops-109153},
doi = {10.4230/LIPIcs.CONCUR.2019.13},
annote = {Keywords: multiplayer non-zero-sum games played on graphs, quantitative reachability objectives, subgame perfect equilibria, constrained existence problem}
}
@InProceedings{winkler_et_al:LIPIcs.CONCUR.2019.14,
author = {Winkler, Tobias and Junges, Sebastian and P\'{e}rez, Guillermo A. and Katoen, Joost-Pieter},
title = {{On the Complexity of Reachability in Parametric Markov Decision Processes}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.14},
URN = {urn:nbn:de:0030-drops-109162},
doi = {10.4230/LIPIcs.CONCUR.2019.14},
annote = {Keywords: Parametric Markov decision processes, Formal verification, ETR, Complexity}
}
@InProceedings{clemente_et_al:LIPIcs.CONCUR.2019.15,
author = {Clemente, Lorenzo and Hofman, Piotr and Totzke, Patrick},
title = {{Timed Basic Parallel Processes}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.15},
URN = {urn:nbn:de:0030-drops-109171},
doi = {10.4230/LIPIcs.CONCUR.2019.15},
annote = {Keywords: Timed Automata, Petri Nets}
}
@InProceedings{govind_et_al:LIPIcs.CONCUR.2019.16,
author = {Govind, R. and Herbreteau, Fr\'{e}d\'{e}ric and Srivathsan, B. and Walukiewicz, Igor},
title = {{Revisiting Local Time Semantics for Networks of Timed Automata}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.16},
URN = {urn:nbn:de:0030-drops-109184},
doi = {10.4230/LIPIcs.CONCUR.2019.16},
annote = {Keywords: Timed automata, verification, local-time semantics, abstraction}
}
@InProceedings{michaliszyn_et_al:LIPIcs.CONCUR.2019.17,
author = {Michaliszyn, Jakub and Otop, Jan},
title = {{Approximate Learning of Limit-Average Automata}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.17},
URN = {urn:nbn:de:0030-drops-109198},
doi = {10.4230/LIPIcs.CONCUR.2019.17},
annote = {Keywords: weighted automata, learning, expected value}
}
@InProceedings{daviaud_et_al:LIPIcs.CONCUR.2019.18,
author = {Daviaud, Laure and Jurdzi\'{n}ski, Marcin and Lehtinen, Karoliina},
title = {{Alternating Weak Automata from Universal Trees}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.18},
URN = {urn:nbn:de:0030-drops-109208},
doi = {10.4230/LIPIcs.CONCUR.2019.18},
annote = {Keywords: alternating automata, weak automata, B\"{u}chi automata, parity automata, parity games, universal trees}
}
@InProceedings{boker_et_al:LIPIcs.CONCUR.2019.19,
author = {Boker, Udi and Lehtinen, Karoliina},
title = {{Good for Games Automata: From Nondeterminism to Alternation}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.19},
URN = {urn:nbn:de:0030-drops-109212},
doi = {10.4230/LIPIcs.CONCUR.2019.19},
annote = {Keywords: Good for games, history-determinism, alternation}
}
@InProceedings{aghajohari_et_al:LIPIcs.CONCUR.2019.20,
author = {Aghajohari, Milad and Avni, Guy and Henzinger, Thomas A.},
title = {{Determinacy in Discrete-Bidding Infinite-Duration Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.20},
URN = {urn:nbn:de:0030-drops-109226},
doi = {10.4230/LIPIcs.CONCUR.2019.20},
annote = {Keywords: Bidding games, Richman games, determinacy, concurrent games, discrete bidding}
}
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2019.21,
author = {Bruy\`{e}re, V\'{e}ronique and Hautem, Quentin and Randour, Mickael and Raskin, Jean-Fran\c{c}ois},
title = {{Energy Mean-Payoff Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {21:1--21:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.21},
URN = {urn:nbn:de:0030-drops-109239},
doi = {10.4230/LIPIcs.CONCUR.2019.21},
annote = {Keywords: two-player zero-sum games played on graphs, energy and mean-payoff objectives, complexity study and construction of optimal strategies}
}
@InProceedings{gutierrez_et_al:LIPIcs.CONCUR.2019.22,
author = {Gutierrez, Julian and Najib, Muhammad and Perelli, Giuseppe and Wooldridge, Michael},
title = {{Equilibrium Design for Concurrent Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.22},
URN = {urn:nbn:de:0030-drops-109246},
doi = {10.4230/LIPIcs.CONCUR.2019.22},
annote = {Keywords: Games, Temporal logic, Synthesis, Model checking, Nash equilibrium}
}
@InProceedings{bnneland_et_al:LIPIcs.CONCUR.2019.23,
author = {B{\o}nneland, Frederik Meyer and Jensen, Peter Gj{\o}l and Larsen, Kim G. and Mu\~{n}iz, Marco and Srba, Ji\v{r}{\'\i}},
title = {{Partial Order Reduction for Reachability Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.23},
URN = {urn:nbn:de:0030-drops-109251},
doi = {10.4230/LIPIcs.CONCUR.2019.23},
annote = {Keywords: Petri nets, games, synthesis, partial order reduction, stubborn sets}
}
@InProceedings{exibard_et_al:LIPIcs.CONCUR.2019.24,
author = {Exibard, L\'{e}o and Filiot, Emmanuel and Reynier, Pierre-Alain},
title = {{Synthesis of Data Word Transducers}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.24},
URN = {urn:nbn:de:0030-drops-109269},
doi = {10.4230/LIPIcs.CONCUR.2019.24},
annote = {Keywords: Register Automata, Synthesis, Data words, Transducers}
}
@InProceedings{khalimov_et_al:LIPIcs.CONCUR.2019.25,
author = {Khalimov, Ayrat and Kupferman, Orna},
title = {{Register-Bounded Synthesis}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {25:1--25:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.25},
URN = {urn:nbn:de:0030-drops-109277},
doi = {10.4230/LIPIcs.CONCUR.2019.25},
annote = {Keywords: Synthesis, Register Automata, Register Transducers}
}
@InProceedings{beutner_et_al:LIPIcs.CONCUR.2019.26,
author = {Beutner, Raven and Finkbeiner, Bernd and Hecking-Harbusch, Jesko},
title = {{Translating Asynchronous Games for Distributed Synthesis}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.26},
URN = {urn:nbn:de:0030-drops-109289},
doi = {10.4230/LIPIcs.CONCUR.2019.26},
annote = {Keywords: synthesis, distributed systems, causal memory, Petri games, control games}
}
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2019.27,
author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan},
title = {{Long-Run Average Behavior of Vector Addition Systems with States}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.27},
URN = {urn:nbn:de:0030-drops-109293},
doi = {10.4230/LIPIcs.CONCUR.2019.27},
annote = {Keywords: vector addition systems, mean-payoff, Diophantine inequalities}
}
@InProceedings{mazowiecki_et_al:LIPIcs.CONCUR.2019.28,
author = {Mazowiecki, Filip and Pilipczuk, Micha{\l}},
title = {{Reachability for Bounded Branching VASS}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.28},
URN = {urn:nbn:de:0030-drops-109303},
doi = {10.4230/LIPIcs.CONCUR.2019.28},
annote = {Keywords: Branching VASS, counter machines, reachability problem, bobrvass}
}
@InProceedings{guzman_et_al:LIPIcs.CONCUR.2019.29,
author = {Guzm\'{a}n, Michell and Knight, Sophia and Quintero, Santiago and Ram{\'\i}rez, Sergio and Rueda, Camilo and Valencia, Frank},
title = {{Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.29},
URN = {urn:nbn:de:0030-drops-109314},
doi = {10.4230/LIPIcs.CONCUR.2019.29},
annote = {Keywords: Reasoning about Groups, Distributed Knowledge, Infinitely Many Agents, Reasoning about Space, Algebraic Modeling}
}
@InProceedings{beillahi_et_al:LIPIcs.CONCUR.2019.30,
author = {Beillahi, Sidi Mohamed and Bouajjani, Ahmed and Enea, Constantin},
title = {{Robustness Against Transactional Causal Consistency}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.30},
URN = {urn:nbn:de:0030-drops-109321},
doi = {10.4230/LIPIcs.CONCUR.2019.30},
annote = {Keywords: Distributed Databases, Causal Consistency, Model Checking}
}
@InProceedings{blondin_et_al:LIPIcs.CONCUR.2019.31,
author = {Blondin, Michael and Esparza, Javier and Jaax, Stefan},
title = {{Expressive Power of Broadcast Consensus Protocols}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.31},
URN = {urn:nbn:de:0030-drops-109330},
doi = {10.4230/LIPIcs.CONCUR.2019.31},
annote = {Keywords: population protocols, complexity theory, counter machines, distributed computing}
}
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2019.32,
author = {Bertrand, Nathalie and Bouyer, Patricia and Majumdar, Anirban},
title = {{Reconfiguration and Message Losses in Parameterized Broadcast Networks}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.32},
URN = {urn:nbn:de:0030-drops-109345},
doi = {10.4230/LIPIcs.CONCUR.2019.32},
annote = {Keywords: model checking, parameterized verification, broadcast networks}
}
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2019.33,
author = {Bertrand, Nathalie and Konnov, Igor and Lazi\'{c}, Marijana and Widder, Josef},
title = {{Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.33},
URN = {urn:nbn:de:0030-drops-109358},
doi = {10.4230/LIPIcs.CONCUR.2019.33},
annote = {Keywords: threshold automata, counter systems, parameterized verification, randomized distributed algorithms, Byzantine faults}
}
@InProceedings{ledent_et_al:LIPIcs.CONCUR.2019.34,
author = {Ledent, J\'{e}r\'{e}my and Mimram, Samuel},
title = {{A Sound Foundation for the Topological Approach to Task Solvability}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.34},
URN = {urn:nbn:de:0030-drops-109365},
doi = {10.4230/LIPIcs.CONCUR.2019.34},
annote = {Keywords: Fault-tolerant protocols, Asynchronous computability, Combinatorial topology, Protocol complex, Distributed task}
}
@InProceedings{hausmann_et_al:LIPIcs.CONCUR.2019.35,
author = {Hausmann, Daniel and Schr\"{o}der, Lutz},
title = {{Game-Based Local Model Checking for the Coalgebraic mu-Calculus}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {35:1--35:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.35},
URN = {urn:nbn:de:0030-drops-109373},
doi = {10.4230/LIPIcs.CONCUR.2019.35},
annote = {Keywords: Model checking, mu-calculus, coalgebraic logic, graded mu-calculus, probabilistic mu-calculus, parity games}
}
@InProceedings{dorsch_et_al:LIPIcs.CONCUR.2019.36,
author = {Dorsch, Ulrich and Milius, Stefan and Schr\"{o}der, Lutz},
title = {{Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {36:1--36:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.36},
URN = {urn:nbn:de:0030-drops-109384},
doi = {10.4230/LIPIcs.CONCUR.2019.36},
annote = {Keywords: Linear Time, Branching Time, Monads, System Equivalences, Modal Logics, Expressiveness}
}
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2019.37,
author = {Bonchi, Filippo and Piedeleu, Robin and Sobocinski, Pawel and Zanasi, Fabio},
title = {{Bialgebraic Semantics for String Diagrams}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.37},
URN = {urn:nbn:de:0030-drops-109398},
doi = {10.4230/LIPIcs.CONCUR.2019.37},
annote = {Keywords: String Diagram, Structural Operational Semantics, Bialgebraic semantics}
}
@InProceedings{bravetti_et_al:LIPIcs.CONCUR.2019.38,
author = {Bravetti, Mario and Carbone, Marco and Lange, Julien and Yoshida, Nobuko and Zavattaro, Gianluigi},
title = {{A Sound Algorithm for Asynchronous Session Subtyping}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.38},
URN = {urn:nbn:de:0030-drops-109408},
doi = {10.4230/LIPIcs.CONCUR.2019.38},
annote = {Keywords: Session types, Concurrency, Subtyping, Algorithm}
}
@InProceedings{caires_et_al:LIPIcs.CONCUR.2019.39,
author = {Caires, Lu{\'\i}s and P\'{e}rez, Jorge A. and Pfenning, Frank and Toninho, Bernardo},
title = {{Domain-Aware Session Types}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.39},
URN = {urn:nbn:de:0030-drops-109417},
doi = {10.4230/LIPIcs.CONCUR.2019.39},
annote = {Keywords: Session Types, Linear Logic, Process Calculi, Hybrid Logic}
}
@InProceedings{maarand_et_al:LIPIcs.CONCUR.2019.40,
author = {Maarand, Hendrik and Uustalu, Tarmo},
title = {{Reordering Derivatives of Trace Closures of Regular Languages}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.40},
URN = {urn:nbn:de:0030-drops-109426},
doi = {10.4230/LIPIcs.CONCUR.2019.40},
annote = {Keywords: Mazurkiewicz traces, trace closure, regular languages, finite automata, language derivatives, scattering rank, star-connected expressions}
}
@InProceedings{kappe_et_al:LIPIcs.CONCUR.2019.41,
author = {Kapp\'{e}, Tobias and Brunet, Paul and Rot, Jurriaan and Silva, Alexandra and Wagemaker, Jana and Zanasi, Fabio},
title = {{Kleene Algebra with Observations}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {41:1--41:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.41},
URN = {urn:nbn:de:0030-drops-109431},
doi = {10.4230/LIPIcs.CONCUR.2019.41},
annote = {Keywords: Concurrent Kleene algebra, Kleene algebra with tests, free model, axiomatisation, decision procedure}
}
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