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.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} }
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.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} }
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.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} }
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.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} }
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.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} }
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.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} }
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.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} }
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.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} }
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.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} }
Victor Khomenko, Maciej Koutny, and Alex Yakovlev. Slimming down Petri Boxes: Compact Petri Net Models of Control Flows. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 8:1-8:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{khomenko_et_al:LIPIcs.CONCUR.2022.8, author = {Khomenko, Victor and Koutny, Maciej and Yakovlev, Alex}, title = {{Slimming down Petri Boxes: Compact Petri Net Models of Control Flows}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {8:1--8:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.8}, URN = {urn:nbn:de:0030-drops-170710}, doi = {10.4230/LIPIcs.CONCUR.2022.8}, annote = {Keywords: Petri net, Petri box, cograph, edge clique cover, control flow, static construction, local construction, interface graph, Burst automata, composition} }
Oscar Darwin and Stefan Kiefer. On the Sequential Probability Ratio Test in Hidden Markov Models. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{darwin_et_al:LIPIcs.CONCUR.2022.9, author = {Darwin, Oscar and Kiefer, Stefan}, title = {{On the Sequential Probability Ratio Test in Hidden Markov Models}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {9:1--9:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.9}, URN = {urn:nbn:de:0030-drops-170728}, doi = {10.4230/LIPIcs.CONCUR.2022.9}, annote = {Keywords: Markov chains, hidden Markov models, probabilistic systems, verification} }
Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Markus A. Whiteland, and James Worrell. Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baier_et_al:LIPIcs.CONCUR.2022.10, author = {Baier, Christel and Funke, Florian and Jantsch, Simon and Karimov, Toghrul and Lefaucheux, Engel and Ouaknine, Jo\"{e}l and Purser, David and Whiteland, Markus A. and Worrell, James}, title = {{Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {10:1--10:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.10}, URN = {urn:nbn:de:0030-drops-170732}, doi = {10.4230/LIPIcs.CONCUR.2022.10}, annote = {Keywords: Model checking, parametric Markov chains, distribution transformer semantics} }
Kush Grover, Jan Křetínský, Tobias Meggendorfer, and Maximilian Weininger. Anytime Guarantees for Reachability in Uncountable Markov Decision Processes. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{grover_et_al:LIPIcs.CONCUR.2022.11, author = {Grover, Kush and K\v{r}et{\'\i}nsk\'{y}, Jan and Meggendorfer, Tobias and Weininger, Maximilian}, title = {{Anytime Guarantees for Reachability in Uncountable Markov Decision Processes}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {11:1--11:20}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.11}, URN = {urn:nbn:de:0030-drops-170743}, doi = {10.4230/LIPIcs.CONCUR.2022.11}, annote = {Keywords: Uncountable system, Markov decision process, discrete-time Markov control process, probabilistic verification, anytime guarantee} }
Frédéric Herbreteau, B. Srivathsan, and Igor Walukiewicz. Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 12:1-12:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{herbreteau_et_al:LIPIcs.CONCUR.2022.12, author = {Herbreteau, Fr\'{e}d\'{e}ric and Srivathsan, B. and Walukiewicz, Igor}, title = {{Checking Timed B\"{u}chi Automata Emptiness Using the Local-Time Semantics}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {12:1--12: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.12}, URN = {urn:nbn:de:0030-drops-170756}, doi = {10.4230/LIPIcs.CONCUR.2022.12}, annote = {Keywords: Timed B\"{u}chi automata, local-time semantics, zones, abstraction, partial-order reduction} }
S. Akshay, Paul Gastin, R. Govind, and B. Srivathsan. Simulations for Event-Clock Automata. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{akshay_et_al:LIPIcs.CONCUR.2022.13, author = {Akshay, S. and Gastin, Paul and Govind, R. and Srivathsan, B.}, title = {{Simulations for Event-Clock Automata}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {13:1--13: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.13}, URN = {urn:nbn:de:0030-drops-170766}, doi = {10.4230/LIPIcs.CONCUR.2022.13}, annote = {Keywords: Event-clock automata, verification, zones, simulations, reachability} }
Thomas A. Henzinger, Karoliina Lehtinen, and Patrick Totzke. History-Deterministic Timed Automata. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 14:1-14:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{henzinger_et_al:LIPIcs.CONCUR.2022.14, author = {Henzinger, Thomas A. and Lehtinen, Karoliina and Totzke, Patrick}, title = {{History-Deterministic Timed Automata}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {14:1--14:21}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.14}, URN = {urn:nbn:de:0030-drops-170778}, doi = {10.4230/LIPIcs.CONCUR.2022.14}, annote = {Keywords: Timed Automata, History-determinism, Good-for-games, fair simulation, synthesis} }
Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier. Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 15:1-15:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{monmege_et_al:LIPIcs.CONCUR.2022.15, author = {Monmege, Benjamin and Parreaux, Julie and Reynier, Pierre-Alain}, title = {{Decidability of One-Clock Weighted Timed Games with Arbitrary Weights}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {15:1--15:22}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.15}, URN = {urn:nbn:de:0030-drops-170786}, doi = {10.4230/LIPIcs.CONCUR.2022.15}, annote = {Keywords: Weighted timed games, Algorithmic game theory, Timed automata} }
Wojciech Czerwiński and Piotr Hofman. Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 16:1-16:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{czerwinski_et_al:LIPIcs.CONCUR.2022.16, author = {Czerwi\'{n}ski, Wojciech and Hofman, Piotr}, title = {{Language Inclusion for Boundedly-Ambiguous Vector Addition Systems Is Decidable}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {16:1--16:22}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.16}, URN = {urn:nbn:de:0030-drops-170796}, doi = {10.4230/LIPIcs.CONCUR.2022.16}, annote = {Keywords: vector addition systems, language inclusion, language equivalence, determinism, unambiguity, bounded ambiguity, Petri nets, well-structured transition systems} }
A. R. Balasubramanian. Complexity of Coverability in Depth-Bounded Processes. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 17:1-17:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{balasubramanian:LIPIcs.CONCUR.2022.17, author = {Balasubramanian, A. R.}, title = {{Complexity of Coverability in Depth-Bounded Processes}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {17:1--17:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.17}, URN = {urn:nbn:de:0030-drops-170809}, doi = {10.4230/LIPIcs.CONCUR.2022.17}, annote = {Keywords: \pi-calculus, Depth-bounded processes, Fast-growing complexity classes} }
Shaull Almagor and Asaf Yeshurun. Determinization of One-Counter Nets. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 18:1-18:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2022.18, author = {Almagor, Shaull and Yeshurun, Asaf}, title = {{Determinization of One-Counter Nets}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {18:1--18:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.18}, URN = {urn:nbn:de:0030-drops-170812}, doi = {10.4230/LIPIcs.CONCUR.2022.18}, annote = {Keywords: Determinization, One-Counter Net, Vector Addition System, Automata, Semilinear} }
Orna Kupferman and Naama Shamash Halevy. Energy Games with Resource-Bounded Environments. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 19:1-19:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kupferman_et_al:LIPIcs.CONCUR.2022.19, author = {Kupferman, Orna and Shamash Halevy, Naama}, title = {{Energy Games with Resource-Bounded Environments}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {19:1--19:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.19}, URN = {urn:nbn:de:0030-drops-170823}, doi = {10.4230/LIPIcs.CONCUR.2022.19}, annote = {Keywords: Energy Games, Infinite-State Systems, Decidability} }
Patricia Bouyer, Antonio Casares, Mickael Randour, and Pierre Vandenhove. Half-Positional Objectives Recognized by Deterministic Büchi Automata. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2022.20, author = {Bouyer, Patricia and Casares, Antonio and Randour, Mickael and Vandenhove, Pierre}, title = {{Half-Positional Objectives Recognized by Deterministic B\"{u}chi Automata}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {20:1--20: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.20}, URN = {urn:nbn:de:0030-drops-170833}, doi = {10.4230/LIPIcs.CONCUR.2022.20}, annote = {Keywords: two-player games on graphs, half-positionality, memoryless optimal strategies, B\"{u}chi automata, \omega-regularity} }
Emmanuel Filiot and Edwin Hamel-de le Court. Two-Player Boundedness Counter Games. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 21:1-21:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{filiot_et_al:LIPIcs.CONCUR.2022.21, author = {Filiot, Emmanuel and Hamel-de le Court, Edwin}, title = {{Two-Player Boundedness Counter Games}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {21:1--21:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.21}, URN = {urn:nbn:de:0030-drops-170841}, doi = {10.4230/LIPIcs.CONCUR.2022.21}, annote = {Keywords: Controller synthesis, Game theory, Counter Games, Boundedness objectives} }
James C. A. Main and Mickael Randour. Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem Under Finite-Memory Assumptions. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 22:1-22:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{main_et_al:LIPIcs.CONCUR.2022.22, author = {Main, James C. A. and Randour, Mickael}, title = {{Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem Under Finite-Memory Assumptions}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {22:1--22: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.22}, URN = {urn:nbn:de:0030-drops-170854}, doi = {10.4230/LIPIcs.CONCUR.2022.22}, annote = {Keywords: two-player games on graphs, stochastic games, Markov decision processes, finite-memory strategies, randomised strategies} }
Javier Esparza, Mikhail Raskin, and Christoph Welzel. Regular Model Checking Upside-Down: An Invariant-Based Approach. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 23:1-23:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2022.23, author = {Esparza, Javier and Raskin, Mikhail and Welzel, Christoph}, title = {{Regular Model Checking Upside-Down: An Invariant-Based Approach}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {23:1--23:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.23}, URN = {urn:nbn:de:0030-drops-170862}, doi = {10.4230/LIPIcs.CONCUR.2022.23}, annote = {Keywords: parameterized verification, structural analysis, regular languages, regular model-checking, traps} }
Marius Bozga, Lucas Bueri, and Radu Iosif. On an Invariance Problem for Parameterized Concurrent Systems. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bozga_et_al:LIPIcs.CONCUR.2022.24, author = {Bozga, Marius and Bueri, Lucas and Iosif, Radu}, title = {{On an Invariance Problem for Parameterized Concurrent Systems}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {24:1--24:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.24}, URN = {urn:nbn:de:0030-drops-170874}, doi = {10.4230/LIPIcs.CONCUR.2022.24}, annote = {Keywords: parameterized verification, invariant checking, resource logics, reconfigurable systems, tree automata} }
Ira Fesefeldt, Joost-Pieter Katoen, and Thomas Noll. Towards Concurrent Quantitative Separation Logic. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 25:1-25:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fesefeldt_et_al:LIPIcs.CONCUR.2022.25, author = {Fesefeldt, Ira and Katoen, Joost-Pieter and Noll, Thomas}, title = {{Towards Concurrent Quantitative Separation Logic}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {25:1--25: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.25}, URN = {urn:nbn:de:0030-drops-170881}, doi = {10.4230/LIPIcs.CONCUR.2022.25}, annote = {Keywords: Randomization, Pointers, Heap-Manipulating, Separation Logic, Concurrency} }
Damien Pous and Jana Wagemaker. Completeness Theorems for Kleene Algebra with Top. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 26:1-26:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{pous_et_al:LIPIcs.CONCUR.2022.26, author = {Pous, Damien and Wagemaker, Jana}, title = {{Completeness Theorems for Kleene Algebra with Top}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {26:1--26: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.26}, URN = {urn:nbn:de:0030-drops-170890}, doi = {10.4230/LIPIcs.CONCUR.2022.26}, annote = {Keywords: Kleene algebra, Hypotheses, Completeness, Closed languages} }
Laura Bozzelli, Adriano Peron, and César Sánchez. Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bozzelli_et_al:LIPIcs.CONCUR.2022.27, author = {Bozzelli, Laura and Peron, Adriano and S\'{a}nchez, C\'{e}sar}, title = {{Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {27:1--27:16}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.27}, URN = {urn:nbn:de:0030-drops-170905}, doi = {10.4230/LIPIcs.CONCUR.2022.27}, annote = {Keywords: Hyperproperties, Asynchronous hyperproperties, Temporal logics for hyperproperties, Expressiveness, Decidability, Model checking} }
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, and Pascal Weil. Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{adsul_et_al:LIPIcs.CONCUR.2022.28, author = {Adsul, Bharat and Gastin, Paul and Sarkar, Saptarshi and Weil, Pascal}, title = {{Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {28:1--28:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.28}, URN = {urn:nbn:de:0030-drops-170915}, doi = {10.4230/LIPIcs.CONCUR.2022.28}, annote = {Keywords: Mazurkiewicz traces, propositional dynamic logic, regular trace languages, asynchronous automata, cascade product, Krohn Rhodes theorem} }
Uli Fahrenberg, Christian Johansen, Georg Struth, and Krzysztof Ziemiański. A Kleene Theorem for Higher-Dimensional Automata. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 29:1-29:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fahrenberg_et_al:LIPIcs.CONCUR.2022.29, author = {Fahrenberg, Uli and Johansen, Christian and Struth, Georg and Ziemia\'{n}ski, Krzysztof}, title = {{A Kleene Theorem for Higher-Dimensional Automata}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {29:1--29: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.29}, URN = {urn:nbn:de:0030-drops-170925}, doi = {10.4230/LIPIcs.CONCUR.2022.29}, annote = {Keywords: higher-dimensional automata, interval posets, Kleene theorem, concurrency theory, labelled precube categories} }
Clément Aubert, Ross Horne, and Christian Johansen. Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 30:1-30:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{aubert_et_al:LIPIcs.CONCUR.2022.30, author = {Aubert, Cl\'{e}ment and Horne, Ross and Johansen, Christian}, title = {{Diamonds for Security: A Non-Interleaving Operational Semantics for the Applied Pi-Calculus}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {30:1--30:26}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.30}, URN = {urn:nbn:de:0030-drops-170930}, doi = {10.4230/LIPIcs.CONCUR.2022.30}, annote = {Keywords: Security, Processes, Structural operational semantics, Asynchronous transition systems, Applied pi-calculus} }
Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 31:1-31:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dongol_et_al:LIPIcs.CONCUR.2022.31, author = {Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, title = {{Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {31:1--31:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.31}, URN = {urn:nbn:de:0030-drops-170947}, doi = {10.4230/LIPIcs.CONCUR.2022.31}, annote = {Keywords: Strong Observational Refinement, Hyperproperties, Forward Simulation, Weak Progressiveness} }
Stefan Kiefer and Qiyi Tang. Strategies for MDP Bisimilarity Equivalence and Inequivalence. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kiefer_et_al:LIPIcs.CONCUR.2022.32, author = {Kiefer, Stefan and Tang, Qiyi}, title = {{Strategies for MDP Bisimilarity Equivalence and Inequivalence}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {32:1--32:22}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.32}, URN = {urn:nbn:de:0030-drops-170955}, doi = {10.4230/LIPIcs.CONCUR.2022.32}, annote = {Keywords: Markov decision processes, Markov chains} }
Véronique Bruyère, Jean-François Raskin, and Clément Tamines. Pareto-Rational Verification. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 33:1-33:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2022.33, author = {Bruy\`{e}re, V\'{e}ronique and Raskin, Jean-Fran\c{c}ois and Tamines, Cl\'{e}ment}, title = {{Pareto-Rational Verification}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {33:1--33:20}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.33}, URN = {urn:nbn:de:0030-drops-170968}, doi = {10.4230/LIPIcs.CONCUR.2022.33}, annote = {Keywords: Rational verification, Model-checking, Pareto-optimality, \omega-regular objectives} }
Shaull Almagor and Shai Guendelman. Concurrent Games with Multiple Topologies. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2022.34, author = {Almagor, Shaull and Guendelman, Shai}, title = {{Concurrent Games with Multiple Topologies}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {34:1--34: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.34}, URN = {urn:nbn:de:0030-drops-170973}, doi = {10.4230/LIPIcs.CONCUR.2022.34}, annote = {Keywords: Concurrent games, Nash Equilibrium, Symmetry, Partial information} }
Adam D. Barwell, Alceste Scalas, Nobuko Yoshida, and Fangyi Zhou. Generalised Multiparty Session Types with Crash-Stop Failures. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 35:1-35:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{barwell_et_al:LIPIcs.CONCUR.2022.35, author = {Barwell, Adam D. and Scalas, Alceste and Yoshida, Nobuko and Zhou, Fangyi}, title = {{Generalised Multiparty Session Types with Crash-Stop Failures}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {35:1--35:25}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.35}, URN = {urn:nbn:de:0030-drops-170982}, doi = {10.4230/LIPIcs.CONCUR.2022.35}, annote = {Keywords: Session Types, Concurrency, Failure Handling, Model Checking} }
Luca Ciccone and Luca Padovani. An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear π-Calculus. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 36:1-36:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{ciccone_et_al:LIPIcs.CONCUR.2022.36, author = {Ciccone, Luca and Padovani, Luca}, title = {{An Infinitary Proof Theory of Linear Logic Ensuring Fair Termination in the Linear \pi-Calculus}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {36:1--36: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.36}, URN = {urn:nbn:de:0030-drops-170990}, doi = {10.4230/LIPIcs.CONCUR.2022.36}, annote = {Keywords: Linear \pi-calculus, Linear Logic, Fixed Points, Fair Termination} }
Ugo Dal Lago and Giulia Giusti. On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 37:1-37:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dallago_et_al:LIPIcs.CONCUR.2022.37, author = {Dal Lago, Ugo and Giusti, Giulia}, title = {{On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments}}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, pages = {37:1--37: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.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2022.37}, URN = {urn:nbn:de:0030-drops-171000}, doi = {10.4230/LIPIcs.CONCUR.2022.37}, annote = {Keywords: Session Types, Probabilistic Computation, Bounded Linear Logic, Cryptographic Experiments} }