@Proceedings{schewe_et_al:LIPIcs.CONCUR.2018,
title = {{LIPIcs, Volume 118, CONCUR'18, Complete Volume}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018},
URN = {urn:nbn:de:0030-drops-97431},
doi = {10.4230/LIPIcs.CONCUR.2018},
annote = {Keywords: Theory of Computation}
}
@InProceedings{schewe_et_al:LIPIcs.CONCUR.2018.0,
author = {Schewe, Sven and Zhang, Lijun},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {0:i--0:xxi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.0},
URN = {urn:nbn:de:0030-drops-95386},
doi = {10.4230/LIPIcs.CONCUR.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{vardi:LIPIcs.CONCUR.2018.1,
author = {Vardi, Moshe Y.},
title = {{The Siren Song of Temporal Synthesis}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.1},
URN = {urn:nbn:de:0030-drops-95393},
doi = {10.4230/LIPIcs.CONCUR.2018.1},
annote = {Keywords: Formal Methods, Temporal Synthesis}
}
@InProceedings{deng:LIPIcs.CONCUR.2018.2,
author = {Deng, Yuxin},
title = {{Bisimulations for Probabilistic and Quantum Processes}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {2:1--2:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.2},
URN = {urn:nbn:de:0030-drops-95406},
doi = {10.4230/LIPIcs.CONCUR.2018.2},
annote = {Keywords: Bisimulations, probabilistic processes, quantum processes}
}
@InProceedings{vanglabbeek:LIPIcs.CONCUR.2018.3,
author = {van Glabbeek, Rob},
title = {{Is Speed-Independent Mutual Exclusion Implementable?}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.3},
URN = {urn:nbn:de:0030-drops-95415},
doi = {10.4230/LIPIcs.CONCUR.2018.3},
annote = {Keywords: Mutual exclusion, speed independence, concurrent reading and writing, liveness, justness}
}
@InProceedings{polyakov_et_al:LIPIcs.CONCUR.2018.4,
author = {Polyakov, Andy and Tsai, Ming-Hsien and Wang, Bow-Yaw and Yang, Bo-Yin},
title = {{Verifying Arithmetic Assembly Programs in Cryptographic Primitives}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.4},
URN = {urn:nbn:de:0030-drops-95425},
doi = {10.4230/LIPIcs.CONCUR.2018.4},
annote = {Keywords: Formal verification, Cryptography, Assembly Programs}
}
@InProceedings{hasuo:LIPIcs.CONCUR.2018.5,
author = {Hasuo, Ichiro},
title = {{Coalgebraic Theory of B\"{u}chi and Parity Automata: Fixed-Point Specifications, Categorically}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {5:1--5:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.5},
URN = {urn:nbn:de:0030-drops-95430},
doi = {10.4230/LIPIcs.CONCUR.2018.5},
annote = {Keywords: Coalgebra, category theory, fixed-point logic, automata, B\"{u}chi automata, parity automata}
}
@InProceedings{abdulla_et_al:LIPIcs.CONCUR.2018.6,
author = {Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Ciobanu, Radu and Mayr, Richard and Totzke, Patrick},
title = {{Universal Safety for Timed Petri Nets is PSPACE-complete}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.6},
URN = {urn:nbn:de:0030-drops-95447},
doi = {10.4230/LIPIcs.CONCUR.2018.6},
annote = {Keywords: timed networks, safety checking, Petri nets, coverability}
}
@InProceedings{bollig_et_al:LIPIcs.CONCUR.2018.7,
author = {Bollig, Benedikt and Fortin, Marie and Gastin, Paul},
title = {{It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.7},
URN = {urn:nbn:de:0030-drops-95455},
doi = {10.4230/LIPIcs.CONCUR.2018.7},
annote = {Keywords: communicating finite-state machines, first-order logic, happened-before relation}
}
@InProceedings{kretinsky_et_al:LIPIcs.CONCUR.2018.8,
author = {Kret{\'\i}nsk\'{y}, Jan and P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois},
title = {{Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.8},
URN = {urn:nbn:de:0030-drops-95468},
doi = {10.4230/LIPIcs.CONCUR.2018.8},
annote = {Keywords: Markov decision processes, Reinforcement learning, Beyond worst case}
}
@InProceedings{tang_et_al:LIPIcs.CONCUR.2018.9,
author = {Tang, Qiyi and van Breugel, Franck},
title = {{Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.9},
URN = {urn:nbn:de:0030-drops-95472},
doi = {10.4230/LIPIcs.CONCUR.2018.9},
annote = {Keywords: probabilistic automaton, probabilistic bisimilarity, distance}
}
@InProceedings{michaliszyn_et_al:LIPIcs.CONCUR.2018.10,
author = {Michaliszyn, Jakub and Otop, Jan},
title = {{Non-deterministic Weighted Automata on Random Words}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.10},
URN = {urn:nbn:de:0030-drops-95481},
doi = {10.4230/LIPIcs.CONCUR.2018.10},
annote = {Keywords: quantitative verification, weighted automata, expected value}
}
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2018.11,
author = {Chatterjee, Krishnendu and Kafshdar Goharshady, Amir and Ibsen-Jensen, Rasmus and Velner, Yaron},
title = {{Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.11},
URN = {urn:nbn:de:0030-drops-95497},
doi = {10.4230/LIPIcs.CONCUR.2018.11},
annote = {Keywords: Crypto-currency, Quantitative Verification, Mean-payoff Games}
}
@InProceedings{meyer_et_al:LIPIcs.CONCUR.2018.12,
author = {Meyer, Roland and Muskalla, Sebastian and Zetzsche, Georg},
title = {{Bounded Context Switching for Valence Systems}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {12:1--12:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.12},
URN = {urn:nbn:de:0030-drops-95500},
doi = {10.4230/LIPIcs.CONCUR.2018.12},
annote = {Keywords: valence systems, graph monoids, bounded context switching}
}
@InProceedings{fournier_et_al:LIPIcs.CONCUR.2018.13,
author = {Fournier, Paulin and Gimbert, Hugo},
title = {{Alternating Nonzero Automata}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.13},
URN = {urn:nbn:de:0030-drops-95517},
doi = {10.4230/LIPIcs.CONCUR.2018.13},
annote = {Keywords: zero-automata, probabilities, temporal logics}
}
@InProceedings{blondin_et_al:LIPIcs.CONCUR.2018.14,
author = {Blondin, Michael and Haase, Christoph and Mazowiecki, Filip},
title = {{Affine Extensions of Integer Vector Addition Systems with States}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.14},
URN = {urn:nbn:de:0030-drops-95520},
doi = {10.4230/LIPIcs.CONCUR.2018.14},
annote = {Keywords: Vector addition systems, affine transformations, reachability, semilinear sets, computational complexity}
}
@InProceedings{atig_et_al:LIPIcs.CONCUR.2018.15,
author = {Atig, Mohamed Faouzi and Bouajjani, Ahmed and Narayan Kumar, K. and Saivasan, Prakash},
title = {{Verifying Quantitative Temporal Properties of Procedural Programs}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.15},
URN = {urn:nbn:de:0030-drops-95531},
doi = {10.4230/LIPIcs.CONCUR.2018.15},
annote = {Keywords: Verification, Formal Methods, Pushdown systems, Visibly pushdown, Quantitative Temporal Properties}
}
@InProceedings{tredup_et_al:LIPIcs.CONCUR.2018.16,
author = {Tredup, Ronny and Rosenke, Christian},
title = {{Narrowing down the Hardness Barrier of Synthesizing Elementary Net Systems}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.16},
URN = {urn:nbn:de:0030-drops-95546},
doi = {10.4230/LIPIcs.CONCUR.2018.16},
annote = {Keywords: Elementary net systems, Petri net synthesis, NP-completeness, Parameterized Complexity}
}
@InProceedings{bonchi_et_al:LIPIcs.CONCUR.2018.17,
author = {Bonchi, Filippo and K\"{o}nig, Barbara and Petrisan, Daniela},
title = {{Up-To Techniques for Behavioural Metrics via Fibrations}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.17},
URN = {urn:nbn:de:0030-drops-95552},
doi = {10.4230/LIPIcs.CONCUR.2018.17},
annote = {Keywords: behavioural metrics, bisimilarity, up-to techniques, coalgebras, fibrations}
}
@InProceedings{doumane_et_al:LIPIcs.CONCUR.2018.18,
author = {Doumane, Amina and Pous, Damien},
title = {{Completeness for Identity-free Kleene Lattices}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.18},
URN = {urn:nbn:de:0030-drops-95564},
doi = {10.4230/LIPIcs.CONCUR.2018.18},
annote = {Keywords: Kleene algebra, Graph languages, Petri Automata, Kleene theorem}
}
@InProceedings{kukovec_et_al:LIPIcs.CONCUR.2018.19,
author = {Kukovec, Jure and Konnov, Igor and Widder, Josef},
title = {{Reachability in Parameterized Systems: All Flavors of Threshold Automata}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.19},
URN = {urn:nbn:de:0030-drops-95578},
doi = {10.4230/LIPIcs.CONCUR.2018.19},
annote = {Keywords: threshold \& counter automata, parameterized verification, reachability}
}
@InProceedings{grigore_et_al:LIPIcs.CONCUR.2018.20,
author = {Grigore, Radu and Kiefer, Stefan},
title = {{Selective Monitoring}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {20:1--20:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.20},
URN = {urn:nbn:de:0030-drops-95586},
doi = {10.4230/LIPIcs.CONCUR.2018.20},
annote = {Keywords: runtime monitoring, probabilistic systems, Markov chains, automata, language equivalence}
}
@InProceedings{kragl_et_al:LIPIcs.CONCUR.2018.21,
author = {Kragl, Bernhard and Qadeer, Shaz and Henzinger, Thomas A.},
title = {{Synchronizing the Asynchronous}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {21:1--21:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.21},
URN = {urn:nbn:de:0030-drops-95591},
doi = {10.4230/LIPIcs.CONCUR.2018.21},
annote = {Keywords: concurrent programs, asynchronous programs, deductive verification, refinement, synchronization, mover types, atomic action, commutativity, Lipton reduction}
}
@InProceedings{goncharov_et_al:LIPIcs.CONCUR.2018.22,
author = {Goncharov, Sergey and Jakob, Julian and Neves, Renato},
title = {{A Semantics for Hybrid Iteration}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.22},
URN = {urn:nbn:de:0030-drops-95604},
doi = {10.4230/LIPIcs.CONCUR.2018.22},
annote = {Keywords: Elgot iteration, guarded iteration, hybrid monad, Zeno behaviour}
}
@InProceedings{sorensen_et_al:LIPIcs.CONCUR.2018.23,
author = {Sorensen, Tyler and Evrard, Hugues and Donaldson, Alastair F.},
title = {{GPU Schedulers: How Fair Is Fair Enough?}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {23:1--23:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.23},
URN = {urn:nbn:de:0030-drops-95619},
doi = {10.4230/LIPIcs.CONCUR.2018.23},
annote = {Keywords: GPU scheduling, Blocking synchronisation, GPU semantics}
}
@InProceedings{hofman_et_al:LIPIcs.CONCUR.2018.24,
author = {Hofman, Piotr and Lasota, Slawomir},
title = {{Linear Equations with Ordered Data}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {24:1--24:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.24},
URN = {urn:nbn:de:0030-drops-95624},
doi = {10.4230/LIPIcs.CONCUR.2018.24},
annote = {Keywords: Linear equations, Petri nets, Petri nets with data, vector addition systems, sets with atoms, orbit-finite sets}
}
@InProceedings{brengos:LIPIcs.CONCUR.2018.25,
author = {Brengos, Tomasz},
title = {{A Coalgebraic Take on Regular and omega-Regular Behaviour for Systems with Internal Moves}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {25:1--25:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.25},
URN = {urn:nbn:de:0030-drops-95632},
doi = {10.4230/LIPIcs.CONCUR.2018.25},
annote = {Keywords: coalgebras, regular languages, omega regular languages, automata, B\"{u}chi automata, silent moves, internal moves, monads, saturation}
}
@InProceedings{roohi_et_al:LIPIcs.CONCUR.2018.26,
author = {Roohi, Nima and Prabhakar, Pavithra and Viswanathan, Mahesh},
title = {{Relating Syntactic and Semantic Perturbations of Hybrid Automata}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.26},
URN = {urn:nbn:de:0030-drops-95644},
doi = {10.4230/LIPIcs.CONCUR.2018.26},
annote = {Keywords: Model Checking, Hybrid Automata, Approximation, Perturbation}
}
@InProceedings{cabrera_et_al:LIPIcs.CONCUR.2018.27,
author = {Cabrera, Benjamin and Heindel, Tobias and Heckel, Reiko and K\"{o}nig, Barbara},
title = {{Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.27},
URN = {urn:nbn:de:0030-drops-95659},
doi = {10.4230/LIPIcs.CONCUR.2018.27},
annote = {Keywords: Petri nets, Bayesian networks, Probabilistic databases, Condition/Event nets, Probabilistic knowledge, Dynamic probability distributions}
}
@InProceedings{gastin_et_al:LIPIcs.CONCUR.2018.28,
author = {Gastin, Paul and Mukherjee, Sayan and Srivathsan, B.},
title = {{Reachability in Timed Automata with Diagonal Constraints}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.28},
URN = {urn:nbn:de:0030-drops-95660},
doi = {10.4230/LIPIcs.CONCUR.2018.28},
annote = {Keywords: Timed Automata, Reachability, Zones, Diagonal constraints}
}
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2018.29,
author = {Bruy\`{e}re, V\'{e}ronique and Hautem, Quentin and Raskin, Jean-Fran\c{c}ois},
title = {{Parameterized complexity of games with monotonically ordered omega-regular objectives}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.29},
URN = {urn:nbn:de:0030-drops-95673},
doi = {10.4230/LIPIcs.CONCUR.2018.29},
annote = {Keywords: two-player zero-sum games played on graphs, omega-regular objectives, ordered objectives, parameterized complexity}
}
@InProceedings{balzer_et_al:LIPIcs.CONCUR.2018.30,
author = {Balzer, Stephanie and Pfenning, Frank and Toninho, Bernardo},
title = {{A Universal Session Type for Untyped Asynchronous Communication}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {30:1--30:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.30},
URN = {urn:nbn:de:0030-drops-95681},
doi = {10.4230/LIPIcs.CONCUR.2018.30},
annote = {Keywords: Session types, sharing, pi-calculus, bisimulation}
}
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2018.31,
author = {Esparza, Javier and Ganty, Pierre and Majumdar, Rupak and Weil-Kennedy, Chana},
title = {{Verification of Immediate Observation Population Protocols}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.31},
URN = {urn:nbn:de:0030-drops-95695},
doi = {10.4230/LIPIcs.CONCUR.2018.31},
annote = {Keywords: Population protocols, Immediate Observation, Parametrized verification}
}
@InProceedings{kretinsky_et_al:LIPIcs.CONCUR.2018.32,
author = {Kret{\'\i}nsk\'{y}, Jan and Rotar, Alexej},
title = {{The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {32:1--32:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.32},
URN = {urn:nbn:de:0030-drops-95708},
doi = {10.4230/LIPIcs.CONCUR.2018.32},
annote = {Keywords: temporal logic, probabilistic verification, probabilistic computation tree logic, satisfiability}
}
@InProceedings{blondin_et_al:LIPIcs.CONCUR.2018.33,
author = {Blondin, Michael and Esparza, Javier and Kucera, Anton{\'\i}n},
title = {{Automatic Analysis of Expected Termination Time for Population Protocols}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.33},
URN = {urn:nbn:de:0030-drops-95711},
doi = {10.4230/LIPIcs.CONCUR.2018.33},
annote = {Keywords: population protocols, performance analysis, expected termination time}
}
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2018.34,
author = {Aceto, Luca and Cassar, Ian and Francalanza, Adrian and Ing\'{o}lfsd\'{o}ttir, Anna},
title = {{On Runtime Enforcement via Suppressions}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.34},
URN = {urn:nbn:de:0030-drops-95729},
doi = {10.4230/LIPIcs.CONCUR.2018.34},
annote = {Keywords: Enforceability, Suppression Enforcement, Monitor Synthesis, Logic}
}
@InProceedings{czerwinski_et_al:LIPIcs.CONCUR.2018.35,
author = {Czerwinski, Wojciech and Lasota, Slawomir and Meyer, Roland and Muskalla, Sebastian and Narayan Kumar, K. and Saivasan, Prakash},
title = {{Regular Separability of Well-Structured Transition Systems}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {35:1--35:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.35},
URN = {urn:nbn:de:0030-drops-95733},
doi = {10.4230/LIPIcs.CONCUR.2018.35},
annote = {Keywords: regular separability, wsts, coverability languages, Petri nets}
}
@InProceedings{gorlin_et_al:LIPIcs.CONCUR.2018.36,
author = {Gorlin, Andrey and Ramakrishnan, C. R.},
title = {{Separable GPL: Decidable Model Checking with More Non-Determinism}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {36:1--36:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.36},
URN = {urn:nbn:de:0030-drops-95743},
doi = {10.4230/LIPIcs.CONCUR.2018.36},
annote = {Keywords: Modal mu-calculus, probabilistic logics, probabilistic systems, branching systems, model checking}
}
@InProceedings{konig_et_al:LIPIcs.CONCUR.2018.37,
author = {K\"{o}nig, Barbara and Mika-Michalski, Christina},
title = {{(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.37},
URN = {urn:nbn:de:0030-drops-95757},
doi = {10.4230/LIPIcs.CONCUR.2018.37},
annote = {Keywords: coalgebra, bisimulation games, spoiler-defender games, behavioural metrics, modal logic}
}
@InProceedings{condurache_et_al:LIPIcs.CONCUR.2018.38,
author = {Condurache, Rodica and Oualhadj, Youssouf and Troquard, Nicolas},
title = {{The Complexity of Rational Synthesis for Concurrent Games}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.38},
URN = {urn:nbn:de:0030-drops-95766},
doi = {10.4230/LIPIcs.CONCUR.2018.38},
annote = {Keywords: Synthesis, concurrent games, Nash equilibria}
}
@InProceedings{krishna_et_al:LIPIcs.CONCUR.2018.39,
author = {Krishna, Shankara Narayanan and Madnani, Khushraj and Pandya, Paritosh K.},
title = {{Logics Meet 1-Clock Alternating Timed Automata}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.39},
URN = {urn:nbn:de:0030-drops-95779},
doi = {10.4230/LIPIcs.CONCUR.2018.39},
annote = {Keywords: Metric Temporal Logic, Alternating Timed Automata, MSO, Regular Expressions, Expressive Completeness}
}
@InProceedings{bartoletti_et_al:LIPIcs.CONCUR.2018.40,
author = {Bartoletti, Massimo and Bocchi, Laura and Murgia, Maurizio},
title = {{Progress-Preserving Refinements of CTA}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {40:1--40:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.40},
URN = {urn:nbn:de:0030-drops-95786},
doi = {10.4230/LIPIcs.CONCUR.2018.40},
annote = {Keywords: protocol implementation, communicating timed automata, message passing}
}
@InProceedings{nagar_et_al:LIPIcs.CONCUR.2018.41,
author = {Nagar, Kartik and Jagannathan, Suresh},
title = {{Automated Detection of Serializability Violations Under Weak Consistency}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {41:1--41:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.41},
URN = {urn:nbn:de:0030-drops-95799},
doi = {10.4230/LIPIcs.CONCUR.2018.41},
annote = {Keywords: Weak Consistency, Serializability, Database Applications}
}
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2018.42,
author = {Almagor, Shaull and Chapman, Brynmor and Hosseini, Mehran and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Effective Divergence Analysis for Linear Recurrence Sequences}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Schewe, Sven and Zhang, Lijun},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.42},
URN = {urn:nbn:de:0030-drops-95802},
doi = {10.4230/LIPIcs.CONCUR.2018.42},
annote = {Keywords: Linear recurrence sequences, Divergence, Algebraic numbers, 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