@Proceedings{haddad_et_al:LIPIcs.CONCUR.2021,
title = {{LIPIcs, Volume 203, CONCUR 2021, Complete Volume}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {1--672},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021},
URN = {urn:nbn:de:0030-drops-143766},
doi = {10.4230/LIPIcs.CONCUR.2021},
annote = {Keywords: LIPIcs, Volume 203, CONCUR 2021, Complete Volume}
}
@InProceedings{haddad_et_al:LIPIcs.CONCUR.2021.0,
author = {Haddad, Serge and Varacca, Daniele},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.0},
URN = {urn:nbn:de:0030-drops-143779},
doi = {10.4230/LIPIcs.CONCUR.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2021.1,
author = {Bertrand, Nathalie and de Alfaro, Luca and van Glabbeek, Rob and Palamidessi, Catuscia and Yoshida, Nobuko},
title = {{CONCUR Test-Of-Time Award 2021}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {1:1--1:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.1},
URN = {urn:nbn:de:0030-drops-143786},
doi = {10.4230/LIPIcs.CONCUR.2021.1},
annote = {Keywords: Concurrency, CONCUR Test-of-Time Award}
}
@InProceedings{havlena_et_al:LIPIcs.CONCUR.2021.2,
author = {Havlena, Vojt\v{e}ch and Leng\'{a}l, Ond\v{r}ej},
title = {{Reducing (To) the Ranks: Efficient Rank-Based B\"{u}chi Automata Complementation}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {2:1--2:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.2},
URN = {urn:nbn:de:0030-drops-143799},
doi = {10.4230/LIPIcs.CONCUR.2021.2},
annote = {Keywords: B\"{u}chi automata, rank-based complementation, super-tight runs}
}
@InProceedings{doveri_et_al:LIPIcs.CONCUR.2021.3,
author = {Doveri, Kyveli and Ganty, Pierre and Parolini, Francesco and Ranzato, Francesco},
title = {{Inclusion Testing of B\"{u}chi Automata Based on Well-Quasiorders}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {3:1--3:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.3},
URN = {urn:nbn:de:0030-drops-143802},
doi = {10.4230/LIPIcs.CONCUR.2021.3},
annote = {Keywords: B\"{u}chi (Pushdown) Automata, \omega-Language Inclusion, Well-quasiorders}
}
@InProceedings{urbat_et_al:LIPIcs.CONCUR.2021.4,
author = {Urbat, Henning and Hausmann, Daniel and Milius, Stefan and Schr\"{o}der, Lutz},
title = {{Nominal B\"{u}chi Automata with Name Allocation}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.4},
URN = {urn:nbn:de:0030-drops-143813},
doi = {10.4230/LIPIcs.CONCUR.2021.4},
annote = {Keywords: Data languages, infinite words, nominal sets, inclusion checking}
}
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2021.5,
author = {Esparza, Javier and Kiefer, Stefan and K\v{r}et{\'\i}nsk\'{y}, Jan and Weininger, Maximilian},
title = {{Enforcing \omega-Regular Properties in Markov Chains by Restarting}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {5:1--5:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.5},
URN = {urn:nbn:de:0030-drops-143824},
doi = {10.4230/LIPIcs.CONCUR.2021.5},
annote = {Keywords: Markov chains, omega-regular properties, runtime enforcement}
}
@InProceedings{kiefer_et_al:LIPIcs.CONCUR.2021.6,
author = {Kiefer, Stefan and Semukhin, Pavel and Widdershoven, Cas},
title = {{Linear-Time Model Checking Branching Processes}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.6},
URN = {urn:nbn:de:0030-drops-143834},
doi = {10.4230/LIPIcs.CONCUR.2021.6},
annote = {Keywords: model checking, Markov chains, branching processes, automata, computational complexity}
}
@InProceedings{piribauer_et_al:LIPIcs.CONCUR.2021.7,
author = {Piribauer, Jakob and Baier, Christel and Bertrand, Nathalie and Sankur, Ocan},
title = {{Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.7},
URN = {urn:nbn:de:0030-drops-143842},
doi = {10.4230/LIPIcs.CONCUR.2021.7},
annote = {Keywords: Quantified linear temporal logic, Markov chain, Markov decision process, vacuity}
}
@InProceedings{brice_et_al:LIPIcs.CONCUR.2021.8,
author = {Brice, L\'{e}onard and Raskin, Jean-Fran\c{c}ois and van den Bogaard, Marie},
title = {{Subgame-Perfect Equilibria in Mean-Payoff Games}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.8},
URN = {urn:nbn:de:0030-drops-143854},
doi = {10.4230/LIPIcs.CONCUR.2021.8},
annote = {Keywords: Games on graphs, subgame-perfect equilibria, mean-payoff objectives.}
}
@InProceedings{balachander_et_al:LIPIcs.CONCUR.2021.9,
author = {Balachander, Mrudula and Guha, Shibashis and Raskin, Jean-Fran\c{c}ois},
title = {{Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.9},
URN = {urn:nbn:de:0030-drops-143863},
doi = {10.4230/LIPIcs.CONCUR.2021.9},
annote = {Keywords: mean-payoff, Stackelberg games, synthesis}
}
@InProceedings{kozachinskiy:LIPIcs.CONCUR.2021.10,
author = {Kozachinskiy, Alexander},
title = {{Continuous Positional Payoffs}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {10:1--10:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.10},
URN = {urn:nbn:de:0030-drops-143874},
doi = {10.4230/LIPIcs.CONCUR.2021.10},
annote = {Keywords: Games on graphs, positional strategies, continuous payoffs}
}
@InProceedings{kiefer_et_al:LIPIcs.CONCUR.2021.11,
author = {Kiefer, Stefan and Mayr, Richard and Shirmohammadi, Mahsa and Totzke, Patrick},
title = {{Transience in Countable MDPs}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.11},
URN = {urn:nbn:de:0030-drops-143881},
doi = {10.4230/LIPIcs.CONCUR.2021.11},
annote = {Keywords: Markov decision processes, Parity, Transience}
}
@InProceedings{mayr_et_al:LIPIcs.CONCUR.2021.12,
author = {Mayr, Richard and Munday, Eric},
title = {{Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.12},
URN = {urn:nbn:de:0030-drops-143893},
doi = {10.4230/LIPIcs.CONCUR.2021.12},
annote = {Keywords: Markov decision processes, Strategy complexity, Mean payoff}
}
@InProceedings{xu_et_al:LIPIcs.CONCUR.2021.13,
author = {Xu, Ming and Mei, Jingyi and Guan, Ji and Yu, Nengkun},
title = {{Model Checking Quantum Continuous-Time Markov Chains}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.13},
URN = {urn:nbn:de:0030-drops-143908},
doi = {10.4230/LIPIcs.CONCUR.2021.13},
annote = {Keywords: Model Checking, Formal Logic, Quantum Computing, Computer Algebra}
}
@InProceedings{bollig_et_al:LIPIcs.CONCUR.2021.14,
author = {Bollig, Benedikt and Di Giusto, Cinzia and Finkel, Alain and Laversa, Laetitia and Lozes, Etienne and Suresh, Amrita},
title = {{A Unifying Framework for Deciding Synchronizability}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.14},
URN = {urn:nbn:de:0030-drops-143917},
doi = {10.4230/LIPIcs.CONCUR.2021.14},
annote = {Keywords: communicating finite-state machines, message sequence charts, synchronizability, MSO logic, special tree-width}
}
@InProceedings{bertrand_et_al:LIPIcs.CONCUR.2021.15,
author = {Bertrand, Nathalie and Thomas, Bastien and Widder, Josef},
title = {{Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.15},
URN = {urn:nbn:de:0030-drops-143926},
doi = {10.4230/LIPIcs.CONCUR.2021.15},
annote = {Keywords: Verification, Distributed algorithms, Domain theory}
}
@InProceedings{kulkarni_et_al:LIPIcs.CONCUR.2021.16,
author = {Kulkarni, Rucha and Mathur, Umang and Pavlogiannis, Andreas},
title = {{Dynamic Data-Race Detection Through the Fine-Grained Lens}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {16:1--16:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.16},
URN = {urn:nbn:de:0030-drops-143931},
doi = {10.4230/LIPIcs.CONCUR.2021.16},
annote = {Keywords: dynamic analyses, data races, fine-grained complexity}
}
@InProceedings{balasubramanian_et_al:LIPIcs.CONCUR.2021.17,
author = {Balasubramanian, A. R. and Thejaswini, K. S.},
title = {{Adaptive Synchronisation of Pushdown Automata}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.17},
URN = {urn:nbn:de:0030-drops-143948},
doi = {10.4230/LIPIcs.CONCUR.2021.17},
annote = {Keywords: Adaptive synchronisation, Pushdown automata, Alternating pushdown systems}
}
@InProceedings{jecker_et_al:LIPIcs.CONCUR.2021.18,
author = {Jecker, Isma\"{e}l and Mazzocchi, Nicolas and Wolf, Petra},
title = {{Decomposing Permutation Automata}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.18},
URN = {urn:nbn:de:0030-drops-143956},
doi = {10.4230/LIPIcs.CONCUR.2021.18},
annote = {Keywords: Deterministic finite automata (DFA), Permutation automata, Commutative languages, Decomposition, Regular Languages, Primality}
}
@InProceedings{boreale_et_al:LIPIcs.CONCUR.2021.19,
author = {Boreale, Michele and Gorla, Daniele},
title = {{Algebra and Coalgebra of Stream Products}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.19},
URN = {urn:nbn:de:0030-drops-143969},
doi = {10.4230/LIPIcs.CONCUR.2021.19},
annote = {Keywords: Streams, coalgebras, polynomials, differential equations}
}
@InProceedings{foster_et_al:LIPIcs.CONCUR.2021.20,
author = {Foster, Simon and Hur, Chung-Kil and Woodcock, Jim},
title = {{Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.20},
URN = {urn:nbn:de:0030-drops-143973},
doi = {10.4230/LIPIcs.CONCUR.2021.20},
annote = {Keywords: Coinduction, Process Algebra, Theorem Proving, Simulation}
}
@InProceedings{kori_et_al:LIPIcs.CONCUR.2021.21,
author = {Kori, Mayuko and Hasuo, Ichiro and Katsumata, Shin-ya},
title = {{Fibrational Initial Algebra-Final Coalgebra Coincidence over Initial Algebras: Turning Verification Witnesses Upside Down}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {21:1--21:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.21},
URN = {urn:nbn:de:0030-drops-143982},
doi = {10.4230/LIPIcs.CONCUR.2021.21},
annote = {Keywords: initial algebra, final coalgebra, fibration, category theory}
}
@InProceedings{mufid_et_al:LIPIcs.CONCUR.2021.22,
author = {Mufid, Muhammad Syifa'ul and Micheli, Andrea and Abate, Alessandro and Cimatti, Alessandro},
title = {{SMT-Based Model Checking of Max-Plus Linear Systems}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.22},
URN = {urn:nbn:de:0030-drops-143993},
doi = {10.4230/LIPIcs.CONCUR.2021.22},
annote = {Keywords: Max-Plus Linear Systems, Satisfiability Modulo Theory, Model Checking, Linear Temporal Logic}
}
@InProceedings{bruse_et_al:LIPIcs.CONCUR.2021.23,
author = {Bruse, Florian and Lange, Martin},
title = {{A Decidable Non-Regular Modal Fixpoint Logic}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.23},
URN = {urn:nbn:de:0030-drops-144003},
doi = {10.4230/LIPIcs.CONCUR.2021.23},
annote = {Keywords: formal specification, temporal logic, expressive power}
}
@InProceedings{beutner_et_al:LIPIcs.CONCUR.2021.24,
author = {Beutner, Raven and Finkbeiner, Bernd},
title = {{A Temporal Logic for Strategic Hyperproperties}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {24:1--24:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.24},
URN = {urn:nbn:de:0030-drops-144019},
doi = {10.4230/LIPIcs.CONCUR.2021.24},
annote = {Keywords: hyperproperties, temporal logic, alternating-time temporal logic, model checking, multi-agent systems, information flow, asynchronous hyperproperties}
}
@InProceedings{main_et_al:LIPIcs.CONCUR.2021.25,
author = {Main, James C. A. and Randour, Mickael and Sproston, Jeremy},
title = {{Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {25:1--25:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.25},
URN = {urn:nbn:de:0030-drops-144021},
doi = {10.4230/LIPIcs.CONCUR.2021.25},
annote = {Keywords: Window objectives, timed automata, timed games, parity games}
}
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2021.26,
author = {Bouyer, Patricia and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre},
title = {{Arena-Independent Finite-Memory Determinacy in Stochastic Games}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {26:1--26:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.26},
URN = {urn:nbn:de:0030-drops-144037},
doi = {10.4230/LIPIcs.CONCUR.2021.26},
annote = {Keywords: two-player games on graphs, stochastic games, Markov decision processes, finite-memory determinacy, optimal strategies}
}
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2021.27,
author = {Bruy\`{e}re, V\'{e}ronique and Raskin, Jean-Fran\c{c}ois and Tamines, Cl\'{e}ment},
title = {{Stackelberg-Pareto Synthesis}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.27},
URN = {urn:nbn:de:0030-drops-144040},
doi = {10.4230/LIPIcs.CONCUR.2021.27},
annote = {Keywords: Stackelberg non-zero sum games played on graphs, synthesis, parity objectives}
}
@InProceedings{baier_et_al:LIPIcs.CONCUR.2021.28,
author = {Baier, Christel and Funke, Florian and Jantsch, Simon and Karimov, Toghrul and Lefaucheux, Engel and Luca, Florian and Ouaknine, Jo\"{e}l and Purser, David and Whiteland, Markus A. and Worrell, James},
title = {{The Orbit Problem for Parametric Linear Dynamical Systems}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {28:1--28:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.28},
URN = {urn:nbn:de:0030-drops-144053},
doi = {10.4230/LIPIcs.CONCUR.2021.28},
annote = {Keywords: Orbit problem, parametric, linear dynamical systems}
}
@InProceedings{shetty_et_al:LIPIcs.CONCUR.2021.29,
author = {Shetty, Aneesh K. and Krishna, S. and Zetzsche, Georg},
title = {{Scope-Bounded Reachability in Valence Systems}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {29:1--29:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.29},
URN = {urn:nbn:de:0030-drops-144069},
doi = {10.4230/LIPIcs.CONCUR.2021.29},
annote = {Keywords: multi-pushdown systems, underapproximations, valence systems, reachability}
}
@InProceedings{ajdarow_et_al:LIPIcs.CONCUR.2021.30,
author = {Ajdar\'{o}w, Michal and Ku\v{c}era, Anton{\'\i}n},
title = {{Deciding Polynomial Termination Complexity for VASS Programs}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.30},
URN = {urn:nbn:de:0030-drops-144076},
doi = {10.4230/LIPIcs.CONCUR.2021.30},
annote = {Keywords: Termination complexity, vector addition systems}
}
@InProceedings{groote_et_al:LIPIcs.CONCUR.2021.31,
author = {Groote, Jan Friso and Martens, Jan and de Vink, Erik},
title = {{Bisimulation by Partitioning Is \Omega((m+n)log n)}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.31},
URN = {urn:nbn:de:0030-drops-144087},
doi = {10.4230/LIPIcs.CONCUR.2021.31},
annote = {Keywords: Bisimilarity, partition refinement, labeled transition system, lowerbound}
}
@InProceedings{wimann_et_al:LIPIcs.CONCUR.2021.32,
author = {Wi{\ss}mann, Thorsten and Milius, Stefan and Schr\"{o}der, Lutz},
title = {{Explaining Behavioural Inequivalence Generically in Quasilinear Time}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {32:1--32:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.32},
URN = {urn:nbn:de:0030-drops-144094},
doi = {10.4230/LIPIcs.CONCUR.2021.32},
annote = {Keywords: bisimulation, partition refinement, modal logic, distinguishing formulae, coalgebra}
}
@InProceedings{vanglabbeek_et_al:LIPIcs.CONCUR.2021.33,
author = {van Glabbeek, Rob and H\"{o}fner, Peter and Wang, Weiyou},
title = {{Enabling Preserving Bisimulation Equivalence}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.33},
URN = {urn:nbn:de:0030-drops-144107},
doi = {10.4230/LIPIcs.CONCUR.2021.33},
annote = {Keywords: bisimilarity, liveness properties, fairness assumptions, process algebra}
}
@InProceedings{baillot_et_al:LIPIcs.CONCUR.2021.34,
author = {Baillot, Patrick and Ghyselen, Alexis and Kobayashi, Naoki},
title = {{Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {34:1--34:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.34},
URN = {urn:nbn:de:0030-drops-144111},
doi = {10.4230/LIPIcs.CONCUR.2021.34},
annote = {Keywords: Type Systems, Pi-calculus, Process Calculi, Complexity Analysis, Usages, Sized Types}
}
@InProceedings{majumdar_et_al:LIPIcs.CONCUR.2021.35,
author = {Majumdar, Rupak and Mukund, Madhavan and Stutz, Felix and Zufferey, Damien},
title = {{Generalising Projection in Asynchronous Multiparty Session Types}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {35:1--35:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.35},
URN = {urn:nbn:de:0030-drops-144125},
doi = {10.4230/LIPIcs.CONCUR.2021.35},
annote = {Keywords: Multiparty session types, Verification, Communicating state machines}
}
@InProceedings{fowler_et_al:LIPIcs.CONCUR.2021.36,
author = {Fowler, Simon and Kokke, Wen and Dardha, Ornela and Lindley, Sam and Morris, J. Garrett},
title = {{Separating Sessions Smoothly}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {36:1--36:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.36},
URN = {urn:nbn:de:0030-drops-144138},
doi = {10.4230/LIPIcs.CONCUR.2021.36},
annote = {Keywords: session types, hypersequents, linear lambda calculus}
}
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