LIPIcs, Volume 243
CONCUR 2022, September 12-16, 2022, Warsaw, Poland
Editors: Bartek Klin, Sławomir Lasota, and Anca Muscholl
LIPIcs, Volume 152
CSL 2020, January 13-16, 2020, Barcelona, Spain
Editors: Maribel Fernández and Anca Muscholl
LIPIcs, Volume 80
ICALP 2017, July 10-14, 2017, Warsaw, Poland
Editors: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl
LIPIcs, Volume 58
MFCS 2016, August 22-26, 2016, Kraków, Poland
Editors: Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier
Published in: Dagstuhl Reports, Volume 13, Issue 5 (2023)
Rajeev Alur, Mikołaj Bojańczyk, Emmanuel Filiot, Anca Muscholl, and Sarah Winter. Regular Transformations (Dagstuhl Seminar 23202). In Dagstuhl Reports, Volume 13, Issue 5, pp. 96-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{alur_et_al:DagRep.13.5.96, author = {Alur, Rajeev and Boja\'{n}czyk, Miko{\l}aj and Filiot, Emmanuel and Muscholl, Anca and Winter, Sarah}, title = {{Regular Transformations (Dagstuhl Seminar 23202)}}, pages = {96--113}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {5}, editor = {Alur, Rajeev and Boja\'{n}czyk, Miko{\l}aj and Filiot, Emmanuel and Muscholl, Anca and Winter, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.5.96}, URN = {urn:nbn:de:0030-drops-193663}, doi = {10.4230/DagRep.13.5.96}, annote = {Keywords: transducers; (poly-)regular functions; linguistic transformations} }
Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Corto Mascle, Anca Muscholl, and Igor Walukiewicz. Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 24:1-24:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{mascle_et_al:LIPIcs.CONCUR.2023.24, author = {Mascle, Corto and Muscholl, Anca and Walukiewicz, Igor}, title = {{Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {24:1--24: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.24}, URN = {urn:nbn:de:0030-drops-190184}, doi = {10.4230/LIPIcs.CONCUR.2023.24}, annote = {Keywords: Parametric systems, Locks, Model-checking} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 1-712, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{klin_et_al:LIPIcs.CONCUR.2022, title = {{LIPIcs, Volume 243, CONCUR 2022, Complete Volume}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {1--712}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022}, URN = {urn:nbn:de:0030-drops-170623}, doi = {10.4230/LIPIcs.CONCUR.2022}, annote = {Keywords: LIPIcs, Volume 243, CONCUR 2022, Complete Volume} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{klin_et_al:LIPIcs.CONCUR.2022.0, author = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {0:i--0:x}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.0}, URN = {urn:nbn:de:0030-drops-170631}, doi = {10.4230/LIPIcs.CONCUR.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Ilaria Castellani, Paul Gastin, Orna Kupferman, Mickael Randour, and Davide Sangiorgi. CONCUR Test-Of-Time Award 2022 (Invited Paper). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 1:1-1:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{castellani_et_al:LIPIcs.CONCUR.2022.1, author = {Castellani, Ilaria and Gastin, Paul and Kupferman, Orna and Randour, Mickael and Sangiorgi, Davide}, title = {{CONCUR Test-Of-Time Award 2022}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {1:1--1:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.1}, URN = {urn:nbn:de:0030-drops-170644}, doi = {10.4230/LIPIcs.CONCUR.2022.1}, annote = {Keywords: CONCUR Test-of-Time Award} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Philippa Gardner. Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gardner:LIPIcs.CONCUR.2022.2, author = {Gardner, Philippa}, title = {{Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.2}, URN = {urn:nbn:de:0030-drops-170659}, doi = {10.4230/LIPIcs.CONCUR.2022.2}, annote = {Keywords: Concurrent separation logic} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Sergio Rajsbaum. Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations (Invited Talk). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 3:1-3:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{rajsbaum:LIPIcs.CONCUR.2022.3, author = {Rajsbaum, Sergio}, title = {{Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {3:1--3:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.3}, URN = {urn:nbn:de:0030-drops-170660}, doi = {10.4230/LIPIcs.CONCUR.2022.3}, annote = {Keywords: Distributed decision tasks, simplicial complex, linearizability, interval-linearizability, Arrow’s impossibility, Speedup theorems} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Jiarui Gan, Rupak Majumdar, Goran Radanovic, and Adish Singla. Sequential Decision Making With Information Asymmetry (Invited Talk). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 4:1-4:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{gan_et_al:LIPIcs.CONCUR.2022.4, author = {Gan, Jiarui and Majumdar, Rupak and Radanovic, Goran and Singla, Adish}, title = {{Sequential Decision Making With Information Asymmetry}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {4:1--4:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.4}, URN = {urn:nbn:de:0030-drops-170673}, doi = {10.4230/LIPIcs.CONCUR.2022.4}, annote = {Keywords: Bayesian persuasion, Automated mechanism design, Markov persuasion processes, Markov mechanism processes, Myopic agents} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Wojciech Czerwiński. Involved VASS Zoo (Invited Talk). In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{czerwinski:LIPIcs.CONCUR.2022.5, author = {Czerwi\'{n}ski, Wojciech}, title = {{Involved VASS Zoo}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.5}, URN = {urn:nbn:de:0030-drops-170681}, doi = {10.4230/LIPIcs.CONCUR.2022.5}, annote = {Keywords: vector addition systems, reachability problem, low dimensions, examples} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, and Bas Luttik. On the Axiomatisation of Branching Bisimulation Congruence over CCS. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2022.6, author = {Aceto, Luca and Castiglioni, Valentina and Ing\'{o}lfsd\'{o}ttir, Anna and Luttik, Bas}, title = {{On the Axiomatisation of Branching Bisimulation Congruence over CCS}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.6}, URN = {urn:nbn:de:0030-drops-170692}, doi = {10.4230/LIPIcs.CONCUR.2022.6}, annote = {Keywords: Equational basis, Weak semantics, CCS, Parallel composition} }
Published in: LIPIcs, Volume 243, 33rd International Conference on Concurrency Theory (CONCUR 2022)
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, and Alan Schmitt. Non-Deterministic Abstract Machines. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 7:1-7:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{biernacka_et_al:LIPIcs.CONCUR.2022.7, author = {Biernacka, Ma{\l}gorzata and Biernacki, Dariusz and Lenglet, Sergue\"{i} and Schmitt, Alan}, title = {{Non-Deterministic Abstract Machines}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {7:1--7:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-246-4}, ISSN = {1868-8969}, year = {2022}, volume = {243}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.7}, URN = {urn:nbn:de:0030-drops-170705}, doi = {10.4230/LIPIcs.CONCUR.2022.7}, annote = {Keywords: Abstract machines, non-determinism, lambda-calculus, process calculi} }
Feedback for Dagstuhl Publishing