LIPIcs, Volume 203
CONCUR 2021, August 24-27, 2021, Virtual Conference
Editors: Serge Haddad and Daniele Varacca
Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Alain Finkel, Serge Haddad, and Lina Ye. About Decisiveness of Dynamic Probabilistic Models. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{finkel_et_al:LIPIcs.CONCUR.2023.14, author = {Finkel, Alain and Haddad, Serge and Ye, Lina}, title = {{About Decisiveness of Dynamic Probabilistic Models}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.14}, URN = {urn:nbn:de:0030-drops-190089}, doi = {10.4230/LIPIcs.CONCUR.2023.14}, annote = {Keywords: infinite Markov chain, reachability probability, decisiveness} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 1-672, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 0:i-0:xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, and Nobuko Yoshida. CONCUR Test-Of-Time Award 2021 (Invited Paper). In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 1:1-1:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Vojtěch Havlena and Ondřej Lengál. Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 2:1-2:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Kyveli Doveri, Pierre Ganty, Francesco Parolini, and Francesco Ranzato. Inclusion Testing of Büchi Automata Based on Well-Quasiorders. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 3:1-3:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Henning Urbat, Daniel Hausmann, Stefan Milius, and Lutz Schröder. Nominal Büchi Automata with Name Allocation. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 4:1-4:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Javier Esparza, Stefan Kiefer, Jan Křetínský, and Maximilian Weininger. Enforcing ω-Regular Properties in Markov Chains by Restarting. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 5:1-5:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Stefan Kiefer, Pavel Semukhin, and Cas Widdershoven. Linear-Time Model Checking Branching Processes. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Jakob Piribauer, Christel Baier, Nathalie Bertrand, and Ocan Sankur. Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Léonard Brice, Jean-François Raskin, and Marie van den Bogaard. Subgame-Perfect Equilibria in Mean-Payoff Games. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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.} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Mrudula Balachander, Shibashis Guha, and Jean-François Raskin. Fragility and Robustness in Mean-Payoff Adversarial Stackelberg Games. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Alexander Kozachinskiy. Continuous Positional Payoffs. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke. Transience in Countable MDPs. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@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} }
Feedback for Dagstuhl Publishing