@Proceedings{meyer_et_al:LIPIcs.CONCUR.2017,
title = {{LIPIcs, Volume 85, CONCUR'17, Complete Volume}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017},
URN = {urn:nbn:de:0030-drops-79070},
doi = {10.4230/LIPIcs.CONCUR.2017},
annote = {Keywords: Software, Data, Theory of Computation}
}
@InProceedings{meyer_et_al:LIPIcs.CONCUR.2017.0,
author = {Meyer, Roland and Nestmann, Uwe},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.0},
URN = {urn:nbn:de:0030-drops-77693},
doi = {10.4230/LIPIcs.CONCUR.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{donaldson_et_al:LIPIcs.CONCUR.2017.1,
author = {Donaldson, Alastair F. and Ketema, Jeroen and Sorensen, Tyler and Wickerson, John},
title = {{Forward Progress on GPU Concurrency}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {1:1--1:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.1},
URN = {urn:nbn:de:0030-drops-78055},
doi = {10.4230/LIPIcs.CONCUR.2017.1},
annote = {Keywords: GPUs, concurrency, formal verification, memory models, data races}
}
@InProceedings{brenguier_et_al:LIPIcs.CONCUR.2017.2,
author = {Brenguier, Romain and Pauly, Arno and Raskin, Jean-Fran\c{c}ois and Sankur, Ocan},
title = {{Admissibility in Games with Imperfect Information}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {2:1--2:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.2},
URN = {urn:nbn:de:0030-drops-78066},
doi = {10.4230/LIPIcs.CONCUR.2017.2},
annote = {Keywords: Admissibility, non-zero sum games, reactive synthesis, imperfect infor- mation}
}
@InProceedings{yang:LIPIcs.CONCUR.2017.3,
author = {Yang, Hongseok},
title = {{Probabilistic Programming}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.3},
URN = {urn:nbn:de:0030-drops-78088},
doi = {10.4230/LIPIcs.CONCUR.2017.3},
annote = {Keywords: Probabilistic programming, Machine learning, Denotational semantics}
}
@InProceedings{farzan_et_al:LIPIcs.CONCUR.2017.4,
author = {Farzan, Azadeh and Kincaid, Zachary},
title = {{A New Notion of Compositionality for Concurrent Program Proofs}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {4:1--4:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.4},
URN = {urn:nbn:de:0030-drops-78097},
doi = {10.4230/LIPIcs.CONCUR.2017.4},
annote = {Keywords: Concurrency, Proofs, Dynamic Memory, Recursion}
}
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2017.5,
author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan},
title = {{Bidirectional Nested Weighted Automata}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.5},
URN = {urn:nbn:de:0030-drops-77763},
doi = {10.4230/LIPIcs.CONCUR.2017.5},
annote = {Keywords: weighted automata, nested weighted automata, complexity, bidirectional}
}
@InProceedings{schlachter_et_al:LIPIcs.CONCUR.2017.6,
author = {Schlachter, Uli and Wimmel, Harro},
title = {{k-Bounded Petri Net Synthesis from Modal Transition Systems}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.6},
URN = {urn:nbn:de:0030-drops-77802},
doi = {10.4230/LIPIcs.CONCUR.2017.6},
annote = {Keywords: Modal transition system, bounded Petri net, synthesis}
}
@InProceedings{ahn_et_al:LIPIcs.CONCUR.2017.7,
author = {Ahn, Ki Yung and Horne, Ross and Tiu, Alwen},
title = {{A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.7},
URN = {urn:nbn:de:0030-drops-77899},
doi = {10.4230/LIPIcs.CONCUR.2017.7},
annote = {Keywords: bisimulation, modal logic, intuitionistic logic}
}
@InProceedings{francalanza:LIPIcs.CONCUR.2017.8,
author = {Francalanza, Adrian},
title = {{Consistently-Detecting Monitors}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.8},
URN = {urn:nbn:de:0030-drops-77722},
doi = {10.4230/LIPIcs.CONCUR.2017.8},
annote = {Keywords: Runtime Monitoring, Deterministic Behaviour, Controllability, Compositional Reasoning, Symbolic Analysis}
}
@InProceedings{kupferman_et_al:LIPIcs.CONCUR.2017.9,
author = {Kupferman, Orna and Vardi, Gal},
title = {{Flow Logic}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.9},
URN = {urn:nbn:de:0030-drops-77796},
doi = {10.4230/LIPIcs.CONCUR.2017.9},
annote = {Keywords: Flow Network, Temporal Logic}
}
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2017.10,
author = {Aceto, Luca and F\'{a}bregas, Ignacio and Garc{\'\i}a-P\'{e}rez, \'{A}lvaro and Ing\'{o}lfsd\'{o}ttir, Anna and Ortega-Mall\'{e}n, Yolanda},
title = {{Rule Formats for Nominal Process Calculi}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.10},
URN = {urn:nbn:de:0030-drops-77869},
doi = {10.4230/LIPIcs.CONCUR.2017.10},
annote = {Keywords: nominal sets, nominal structural operational semantics, process algebra, nominal transition systems, scope opening, rule formats}
}
@InProceedings{durier_et_al:LIPIcs.CONCUR.2017.11,
author = {Durier, Adrien and Hirschkoff, Daniel and Sangiorgi, Davide},
title = {{Divergence and Unique Solution of Equations}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.11},
URN = {urn:nbn:de:0030-drops-77849},
doi = {10.4230/LIPIcs.CONCUR.2017.11},
annote = {Keywords: Bisimilarity, unique solution of equations, termination, process calculi}
}
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2017.12,
author = {Bertrand, Nathalie and Dewaskar, Miheer and Genest, Blaise and Gimbert, Hugo},
title = {{Controlling a Population}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.12},
URN = {urn:nbn:de:0030-drops-78000},
doi = {10.4230/LIPIcs.CONCUR.2017.12},
annote = {Keywords: Model-checking, control, parametric systems}
}
@InProceedings{dimitrova_et_al:LIPIcs.CONCUR.2017.13,
author = {Dimitrova, Rayna and Gavran, Ivan and Majumdar, Rupak and Prabhu, Vinayak S. and Soudjani, Sadegh Esmaeil Zadeh},
title = {{The Robot Routing Problem for Collecting Aggregate Stochastic Rewards}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.13},
URN = {urn:nbn:de:0030-drops-77920},
doi = {10.4230/LIPIcs.CONCUR.2017.13},
annote = {Keywords: Path Planning, Graph Games, Quantitative Objectives, Discounting}
}
@InProceedings{david_et_al:LIPIcs.CONCUR.2017.14,
author = {David, Nicolas and Jard, Claude and Lime, Didier and Roux, Olivier H.},
title = {{Coverability Synthesis in Parametric Petri Nets}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.14},
URN = {urn:nbn:de:0030-drops-77831},
doi = {10.4230/LIPIcs.CONCUR.2017.14},
annote = {Keywords: Petri net, Parameters, Coverability, Unboundedness, Synthesis}
}
@InProceedings{fokkink_et_al:LIPIcs.CONCUR.2017.15,
author = {Fokkink, Wan and van Glabbeek, Rob and Luttik, Bas},
title = {{Divide and Congruence III: Stability \& Divergence}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.15},
URN = {urn:nbn:de:0030-drops-77855},
doi = {10.4230/LIPIcs.CONCUR.2017.15},
annote = {Keywords: Structural Operational Semantics, Compositionality, Congruence, Modal Logic, Modal Decomposition, Weak Semantics, Divergence}
}
@InProceedings{bouajjani_et_al:LIPIcs.CONCUR.2017.16,
author = {Bouajjani, Ahmed and Enea, Constantin and Wang, Chao},
title = {{Checking Linearizability of Concurrent Priority Queues}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.16},
URN = {urn:nbn:de:0030-drops-78079},
doi = {10.4230/LIPIcs.CONCUR.2017.16},
annote = {Keywords: Concurrency, Linearizability, Model Checking}
}
@InProceedings{gutierrez_et_al:LIPIcs.CONCUR.2017.17,
author = {Gutierrez, Julian and Harrenstein, Paul and Perelli, Giuseppe and Wooldridge, Michael},
title = {{Nash Equilibrium and Bisimulation Invariance}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.17},
URN = {urn:nbn:de:0030-drops-77902},
doi = {10.4230/LIPIcs.CONCUR.2017.17},
annote = {Keywords: Bisumulation, Nash equilibrium, Multiagent systems, Strategy logic}
}
@InProceedings{chatain_et_al:LIPIcs.CONCUR.2017.18,
author = {Chatain, Thomas and Paulev\'{e}, Lo\"{i}c},
title = {{Goal-Driven Unfolding of Petri Nets}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.18},
URN = {urn:nbn:de:0030-drops-77730},
doi = {10.4230/LIPIcs.CONCUR.2017.18},
annote = {Keywords: model reduction; reachability; concurrency; unfoldings; Petri nets; automata networks}
}
@InProceedings{fijalkow_et_al:LIPIcs.CONCUR.2017.19,
author = {Fijalkow, Nathana\"{e}l and Riveros, Cristian and Worrell, James},
title = {{Probabilistic Automata of Bounded Ambiguity}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.19},
URN = {urn:nbn:de:0030-drops-77716},
doi = {10.4230/LIPIcs.CONCUR.2017.19},
annote = {Keywords: Probabilistic Automata, Emptiness Problem, Stochastic Path Problem, Multi-Objective Optimisation Problems}
}
@InProceedings{huang_et_al:LIPIcs.CONCUR.2017.20,
author = {Huang, Mingzhang and Yin, Qiang},
title = {{Two Lower Bounds for BPA}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {20:1--20:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.20},
URN = {urn:nbn:de:0030-drops-77772},
doi = {10.4230/LIPIcs.CONCUR.2017.20},
annote = {Keywords: BPA, branching bisimulation, regularity}
}
@InProceedings{avni_et_al:LIPIcs.CONCUR.2017.21,
author = {Avni, Guy and Henzinger, Thomas A. and Chonev, Ventsislav},
title = {{Infinite-Duration Bidding Games}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {21:1--21:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.21},
URN = {urn:nbn:de:0030-drops-77741},
doi = {10.4230/LIPIcs.CONCUR.2017.21},
annote = {Keywords: Bidding Games, Parity Games, Mean-Payoff Games, Richman Games}
}
@InProceedings{fu:LIPIcs.CONCUR.2017.22,
author = {Fu, Yuxi},
title = {{On the Power of Name-Passing Communication}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.22},
URN = {urn:nbn:de:0030-drops-77786},
doi = {10.4230/LIPIcs.CONCUR.2017.22},
annote = {Keywords: Interaction theory, expressiveness, bisimulation}
}
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2017.23,
author = {Bonchi, Filippo and Silva, Alexandra and Sokolova, Ana},
title = {{The Power of Convex Algebras}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.23},
URN = {urn:nbn:de:0030-drops-77966},
doi = {10.4230/LIPIcs.CONCUR.2017.23},
annote = {Keywords: belief-state transformers, bisimulation up-to, coalgebra, convex algebra, convex powerset monad, probabilistic automata}
}
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2017.24,
author = {Bonchi, Filippo and Holland, Joshua and Pavlovic, Dusko and Sobocinski, Pawel},
title = {{Refinement for Signal Flow Graphs}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {24:1--24:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.24},
URN = {urn:nbn:de:0030-drops-77758},
doi = {10.4230/LIPIcs.CONCUR.2017.24},
annote = {Keywords: Signal flow graphs, refinement, operational semantics, string diagrams, symmetric monoidal inequality theory}
}
@InProceedings{kappe_et_al:LIPIcs.CONCUR.2017.25,
author = {Kapp\'{e}, Tobias and Brunet, Paul and Luttik, Bas and Silva, Alexandra and Zanasi, Fabio},
title = {{Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {25:1--25:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.25},
URN = {urn:nbn:de:0030-drops-77913},
doi = {10.4230/LIPIcs.CONCUR.2017.25},
annote = {Keywords: Kleene theorem, Series-rational expressions, Automata, Brzozowski derivatives, Concurrency, Pomsets}
}
@InProceedings{cerone_et_al:LIPIcs.CONCUR.2017.26,
author = {Cerone, Andrea and Gotsman, Alexey and Yang, Hongseok},
title = {{Algebraic Laws for Weak Consistency}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {26:1--26:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.26},
URN = {urn:nbn:de:0030-drops-77946},
doi = {10.4230/LIPIcs.CONCUR.2017.26},
annote = {Keywords: Weak Consistency Models, Distributed Databases, Dependency Graphs}
}
@InProceedings{tang_et_al:LIPIcs.CONCUR.2017.27,
author = {Tang, Qiyi and van Breugel, Franck},
title = {{Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.27},
URN = {urn:nbn:de:0030-drops-77983},
doi = {10.4230/LIPIcs.CONCUR.2017.27},
annote = {Keywords: labelled Markov chain, probabilistic bisimilarity, pseudometric, policy iteration}
}
@InProceedings{brunet_et_al:LIPIcs.CONCUR.2017.28,
author = {Brunet, Paul and Pous, Damien and Struth, Georg},
title = {{On Decidability of Concurrent Kleene Algebra}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.28},
URN = {urn:nbn:de:0030-drops-77881},
doi = {10.4230/LIPIcs.CONCUR.2017.28},
annote = {Keywords: Concurrent Kleene algebra, series-parallel pomsets, Petri nets}
}
@InProceedings{decker_et_al:LIPIcs.CONCUR.2017.29,
author = {Decker, Normann and Habermehl, Peter and Leucker, Martin and Sangnier, Arnaud and Thoma, Daniel},
title = {{Model-Checking Counting Temporal Logics on Flat Structures}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.29},
URN = {urn:nbn:de:0030-drops-77709},
doi = {10.4230/LIPIcs.CONCUR.2017.29},
annote = {Keywords: Counting Temporal Logic, Model checking, Flat Kripke Structure}
}
@InProceedings{castellani_et_al:LIPIcs.CONCUR.2017.30,
author = {Castellani, Ilaria and Dezani-Ciancaglini, Mariangiola and Giannini, Paola},
title = {{Concurrent Reversible Sessions}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {30:1--30:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.30},
URN = {urn:nbn:de:0030-drops-77877},
doi = {10.4230/LIPIcs.CONCUR.2017.30},
annote = {Keywords: Communication-centric Systems, Reversible Computation, Process Calculi, Multiparty Session Types}
}
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2017.31,
author = {Bouyer, Patricia and Haddad, Serge and Jug\'{e}, Vincent},
title = {{Unbounded Product-Form Petri Nets}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.31},
URN = {urn:nbn:de:0030-drops-77957},
doi = {10.4230/LIPIcs.CONCUR.2017.31},
annote = {Keywords: Performance evaluation, infinite-state systems, Petri nets, steady-state distribution}
}
@InProceedings{dorsch_et_al:LIPIcs.CONCUR.2017.32,
author = {Dorsch, Ulrich and Milius, Stefan and Schr\"{o}der, Lutz and Wi{\ss}mann, Thorsten},
title = {{Efficient Coalgebraic Partition Refinement}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {32:1--32:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.32},
URN = {urn:nbn:de:0030-drops-77939},
doi = {10.4230/LIPIcs.CONCUR.2017.32},
annote = {Keywords: markov chains, deterministic finite automata, partition refinement, generic algorithm, paige-tarjan algorithm, transition systems}
}
@InProceedings{bollig_et_al:LIPIcs.CONCUR.2017.33,
author = {Bollig, Benedikt and Quaas, Karin and Sangnier, Arnaud},
title = {{The Complexity of Flat Freeze LTL}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.33},
URN = {urn:nbn:de:0030-drops-77993},
doi = {10.4230/LIPIcs.CONCUR.2017.33},
annote = {Keywords: one-counter automata, freeze LTL, model checking}
}
@InProceedings{murawski_et_al:LIPIcs.CONCUR.2017.34,
author = {Murawski, Andrzej S. and Tzevelekos, Nikos},
title = {{Higher-Order Linearisability}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {34:1--34:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.34},
URN = {urn:nbn:de:0030-drops-78035},
doi = {10.4230/LIPIcs.CONCUR.2017.34},
annote = {Keywords: Linearisability, Concurrency, Higher-Order Computation}
}
@InProceedings{feng_et_al:LIPIcs.CONCUR.2017.35,
author = {Feng, Yuan and Hahn, Ernst Moritz and Turrini, Andrea and Ying, Shenggang},
title = {{Model Checking Omega-regular Properties for Quantum Markov Chains}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {35:1--35:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.35},
URN = {urn:nbn:de:0030-drops-77818},
doi = {10.4230/LIPIcs.CONCUR.2017.35},
annote = {Keywords: Quantum Markov chains, model checking, omega-regular properties, bottom strongly connected component}
}
@InProceedings{basset_et_al:LIPIcs.CONCUR.2017.36,
author = {Basset, Nicolas and Mairesse, Jean and Soria, Mich\`{e}le},
title = {{Uniform Sampling for Networks of Automata}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {36:1--36:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.36},
URN = {urn:nbn:de:0030-drops-77977},
doi = {10.4230/LIPIcs.CONCUR.2017.36},
annote = {Keywords: Partially synchronised automata, uniform sampling; recursive method, Boltzmann sampling, Parry measure}
}
@InProceedings{chen_et_al:LIPIcs.CONCUR.2017.37,
author = {Chen, Taolue and Song, Fu and Wu, Zhilin},
title = {{Tractability of Separation Logic with Inductive Definitions: Beyond Lists}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.37},
URN = {urn:nbn:de:0030-drops-77826},
doi = {10.4230/LIPIcs.CONCUR.2017.37},
annote = {Keywords: Separation logic, Inductive definitions, Satisfiability, Entailment}
}
@InProceedings{abdulla_et_al:LIPIcs.CONCUR.2017.38,
author = {Abdulla, Parosh Aziz and Aiswarya, C. and Atig, Mohamed Faouzi},
title = {{Data Multi-Pushdown Automata}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {38:1--38:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.38},
URN = {urn:nbn:de:0030-drops-78049},
doi = {10.4230/LIPIcs.CONCUR.2017.38},
annote = {Keywords: Pushdown Systems, Model-Checking, Gap-Order, Bounded Split-Width}
}
@InProceedings{akshay_et_al:LIPIcs.CONCUR.2017.39,
author = {Akshay, S. and Gastin, Paul and Krishna, Shankara Narayanan and Sarkar, Ilias},
title = {{Towards an Efficient Tree Automata Based Technique for Timed Systems}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.39},
URN = {urn:nbn:de:0030-drops-78017},
doi = {10.4230/LIPIcs.CONCUR.2017.39},
annote = {Keywords: Timed automata, tree automata, pushdown systems, tree-width}
}
@InProceedings{akshay_et_al:LIPIcs.CONCUR.2017.40,
author = {Akshay, S. and Chakraborty, Supratik and Das, Ankush and Jagannath, Vishal and Sandeep, Sai},
title = {{On Petri Nets with Hierarchical Special Arcs}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.40},
URN = {urn:nbn:de:0030-drops-78026},
doi = {10.4230/LIPIcs.CONCUR.2017.40},
annote = {Keywords: Petri Nets, Hierarchy, Reachability, Coverability, Termination, Positivity}
}
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