35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 1-752, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Proceedings{majumdar_et_al:LIPIcs.CONCUR.2024, title = {{LIPIcs, Volume 311, CONCUR 2024, Complete Volume}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {1--752}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024}, URN = {urn:nbn:de:0030-drops-207714}, doi = {10.4230/LIPIcs.CONCUR.2024}, annote = {Keywords: LIPIcs, Volume 311, CONCUR 2024, Complete Volume} }
35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{majumdar_et_al:LIPIcs.CONCUR.2024.0, author = {Majumdar, Rupak and Silva, Alexandra}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.0}, URN = {urn:nbn:de:0030-drops-207724}, doi = {10.4230/LIPIcs.CONCUR.2024.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Arie Gurfinkel. Constrained Horn Clauses for Program Verification and Synthesis (Invited Talk). In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gurfinkel:LIPIcs.CONCUR.2024.1, author = {Gurfinkel, Arie}, title = {{Constrained Horn Clauses for Program Verification and Synthesis}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.1}, URN = {urn:nbn:de:0030-drops-207734}, doi = {10.4230/LIPIcs.CONCUR.2024.1}, annote = {Keywords: Constrained Horn Clauses} }
Azalea Raad. Principles of Persistent Programming (Invited Talk). In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{raad:LIPIcs.CONCUR.2024.2, author = {Raad, Azalea}, title = {{Principles of Persistent Programming}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.2}, URN = {urn:nbn:de:0030-drops-207742}, doi = {10.4230/LIPIcs.CONCUR.2024.2}, annote = {Keywords: Persistent Programming} }
Thomas Wies. Verifying Concurrent Search Structures (Invited Talk). In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{wies:LIPIcs.CONCUR.2024.3, author = {Wies, Thomas}, title = {{Verifying Concurrent Search Structures}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.3}, URN = {urn:nbn:de:0030-drops-207754}, doi = {10.4230/LIPIcs.CONCUR.2024.3}, annote = {Keywords: Concurrent search structures} }
Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Daniele Gorla, and Jana Wagemaker. Centralized vs Decentralized Monitors for Hyperproperties. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2024.4, author = {Aceto, Luca and Achilleos, Antonis and Anastasiadi, Elli and Francalanza, Adrian and Gorla, Daniele and Wagemaker, Jana}, title = {{Centralized vs Decentralized Monitors for Hyperproperties}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.4}, URN = {urn:nbn:de:0030-drops-207763}, doi = {10.4230/LIPIcs.CONCUR.2024.4}, annote = {Keywords: Runtime Verification, hyperlogics, decentralization} }
S. Akshay, Paul Gastin, R. Govind, and B. Srivathsan. MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{akshay_et_al:LIPIcs.CONCUR.2024.5, author = {Akshay, S. and Gastin, Paul and Govind, R. and Srivathsan, B.}, title = {{MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.5}, URN = {urn:nbn:de:0030-drops-207774}, doi = {10.4230/LIPIcs.CONCUR.2024.5}, annote = {Keywords: MITL model checking, timed automata, zones, liveness} }
S. Akshay, Tobias Meggendorfer, and P. S. Thiagarajan. Causally Deterministic Markov Decision Processes. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 6:1-6:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{akshay_et_al:LIPIcs.CONCUR.2024.6, author = {Akshay, S. and Meggendorfer, Tobias and Thiagarajan, P. S.}, title = {{Causally Deterministic Markov Decision Processes}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {6:1--6:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.6}, URN = {urn:nbn:de:0030-drops-207781}, doi = {10.4230/LIPIcs.CONCUR.2024.6}, annote = {Keywords: MDPs, distribution, causal determinism} }
Jesús Aranda, Sebastián Betancourt, Juan Fco. Díaz, and Frank Valencia. Fairness and Consensus in an Asynchronous Opinion Model for Social Networks. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{aranda_et_al:LIPIcs.CONCUR.2024.7, author = {Aranda, Jes\'{u}s and Betancourt, Sebasti\'{a}n and D{\'\i}az, Juan Fco. and Valencia, Frank}, title = {{Fairness and Consensus in an Asynchronous Opinion Model for Social Networks}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.7}, URN = {urn:nbn:de:0030-drops-207794}, doi = {10.4230/LIPIcs.CONCUR.2024.7}, annote = {Keywords: Social networks, fairness, DeGroot, consensus, asynchrony} }
Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger, and Kaushik Mallik. Bidding Games with Charging. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{avni_et_al:LIPIcs.CONCUR.2024.8, author = {Avni, Guy and Kafshdar Goharshady, Ehsan and Henzinger, Thomas A. and Mallik, Kaushik}, title = {{Bidding Games with Charging}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.8}, URN = {urn:nbn:de:0030-drops-207807}, doi = {10.4230/LIPIcs.CONCUR.2024.8}, annote = {Keywords: Bidding games on graphs, \omega-regular objectives} }
Christel Baier, Jakob Piribauer, and Maximilian Starke. Risk-Averse Optimization of Total Rewards in Markovian Models Using Deviation Measures. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 9:1-9:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{baier_et_al:LIPIcs.CONCUR.2024.9, author = {Baier, Christel and Piribauer, Jakob and Starke, Maximilian}, title = {{Risk-Averse Optimization of Total Rewards in Markovian Models Using Deviation Measures}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {9:1--9:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.9}, URN = {urn:nbn:de:0030-drops-207816}, doi = {10.4230/LIPIcs.CONCUR.2024.9}, annote = {Keywords: Markov decision processes, risk-aversion, deviation measures, total reward} }
Mrudula Balachander, Emmanuel Filiot, and Raffaella Gentilini. Passive Learning of Regular Data Languages in Polynomial Time and Data. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balachander_et_al:LIPIcs.CONCUR.2024.10, author = {Balachander, Mrudula and Filiot, Emmanuel and Gentilini, Raffaella}, title = {{Passive Learning of Regular Data Languages in Polynomial Time and Data}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {10:1--10:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.10}, URN = {urn:nbn:de:0030-drops-207829}, doi = {10.4230/LIPIcs.CONCUR.2024.10}, annote = {Keywords: Register automata, passive learning, automata over infinite alphabets} }
Paolo Baldan, Davide Castelnovo, Andrea Corradini, and Fabio Gadducci. Left-Linear Rewriting in Adhesive Categories. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 11:1-11:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{baldan_et_al:LIPIcs.CONCUR.2024.11, author = {Baldan, Paolo and Castelnovo, Davide and Corradini, Andrea and Gadducci, Fabio}, title = {{Left-Linear Rewriting in Adhesive Categories}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {11:1--11:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.11}, URN = {urn:nbn:de:0030-drops-207835}, doi = {10.4230/LIPIcs.CONCUR.2024.11}, annote = {Keywords: Adhesive categories, double-pushout rewriting, left-linear rules, switch equivalence, local Church-Rosser property} }
Udi Boker, Thomas A. Henzinger, Karoliina Lehtinen, and Aditya Prakash. History-Determinism vs Fair Simulation. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{boker_et_al:LIPIcs.CONCUR.2024.12, author = {Boker, Udi and Henzinger, Thomas A. and Lehtinen, Karoliina and Prakash, Aditya}, title = {{History-Determinism vs Fair Simulation}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.12}, URN = {urn:nbn:de:0030-drops-207841}, doi = {10.4230/LIPIcs.CONCUR.2024.12}, annote = {Keywords: History-Determinism} }
Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, and Pierre Vandenhove. The Power of Counting Steps in Quantitative Games. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 13:1-13:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bose_et_al:LIPIcs.CONCUR.2024.13, author = {Bose, Sougata and Ibsen-Jensen, Rasmus and Purser, David and Totzke, Patrick and Vandenhove, Pierre}, title = {{The Power of Counting Steps in Quantitative Games}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.13}, URN = {urn:nbn:de:0030-drops-207852}, doi = {10.4230/LIPIcs.CONCUR.2024.13}, annote = {Keywords: Games on graphs, Markov strategies, quantitative objectives, infinite-state systems} }
Véronique Bruyère, Christophe Grandmont, and Jean-François Raskin. As Soon as Possible but Rationally. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 14:1-14:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bruyere_et_al:LIPIcs.CONCUR.2024.14, author = {Bruy\`{e}re, V\'{e}ronique and Grandmont, Christophe and Raskin, Jean-Fran\c{c}ois}, title = {{As Soon as Possible but Rationally}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {14:1--14:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.14}, URN = {urn:nbn:de:0030-drops-207869}, doi = {10.4230/LIPIcs.CONCUR.2024.14}, annote = {Keywords: Games played on graphs, rational verification, rational synthesis, Nash equilibrium, Pareto-optimality, quantitative reachability objectives} }
Valentina Castiglioni, Michele Loreti, and Simone Tini. RobTL: Robustness Temporal Logic for CPS. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 15:1-15:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{castiglioni_et_al:LIPIcs.CONCUR.2024.15, author = {Castiglioni, Valentina and Loreti, Michele and Tini, Simone}, title = {{RobTL: Robustness Temporal Logic for CPS}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {15:1--15:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.15}, URN = {urn:nbn:de:0030-drops-207870}, doi = {10.4230/LIPIcs.CONCUR.2024.15}, annote = {Keywords: Cyber-physical systems, robustness, temporal logic, uncertainty} }
Lorenzo Ceragioli, Fabio Gadducci, Giuseppe Lomurno, and Gabriele Tedeschi. Effect Semantics for Quantum Process Calculi. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 16:1-16:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ceragioli_et_al:LIPIcs.CONCUR.2024.16, author = {Ceragioli, Lorenzo and Gadducci, Fabio and Lomurno, Giuseppe and Tedeschi, Gabriele}, title = {{Effect Semantics for Quantum Process Calculi}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {16:1--16:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.16}, URN = {urn:nbn:de:0030-drops-207886}, doi = {10.4230/LIPIcs.CONCUR.2024.16}, annote = {Keywords: Quantum process calculi, probabilistic LTSs, effect LTSs} }
Dmitry Chistikov, Jérôme Leroux, Henry Sinclair-Banks, and Nicolas Waldburger. Invariants for One-Counter Automata with Disequality Tests. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 17:1-17:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chistikov_et_al:LIPIcs.CONCUR.2024.17, author = {Chistikov, Dmitry and Leroux, J\'{e}r\^{o}me and Sinclair-Banks, Henry and Waldburger, Nicolas}, title = {{Invariants for One-Counter Automata with Disequality Tests}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {17:1--17:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.17}, URN = {urn:nbn:de:0030-drops-207898}, doi = {10.4230/LIPIcs.CONCUR.2024.17}, annote = {Keywords: Inductive invariant, Vector addition system, One-counter automaton} }
Lorenzo Clemente. Weighted Basic Parallel Processes and Combinatorial Enumeration. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 18:1-18:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{clemente:LIPIcs.CONCUR.2024.18, author = {Clemente, Lorenzo}, title = {{Weighted Basic Parallel Processes and Combinatorial Enumeration}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {18:1--18:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.18}, URN = {urn:nbn:de:0030-drops-207903}, doi = {10.4230/LIPIcs.CONCUR.2024.18}, annote = {Keywords: weighted automata, combinatorial enumeration, shuffle, algebraic differential equations, process algebra, basic parallel processes, species of structures} }
Philipp Czerner, Javier Esparza, Valentin Krasotin, and Christoph Welzel-Mohr. Computing Inductive Invariants of Regular Abstraction Frameworks. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 19:1-19:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{czerner_et_al:LIPIcs.CONCUR.2024.19, author = {Czerner, Philipp and Esparza, Javier and Krasotin, Valentin and Welzel-Mohr, Christoph}, title = {{Computing Inductive Invariants of Regular Abstraction Frameworks}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.19}, URN = {urn:nbn:de:0030-drops-207919}, doi = {10.4230/LIPIcs.CONCUR.2024.19}, annote = {Keywords: Regular model checking, abstraction, inductive invariants} }
Keri D'Angelo, Sebastian Gurke, Johanna Maria Kirss, Barbara König, Matina Najafi, Wojciech Różowski, and Paul Wild. Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 20:1-20:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dangelo_et_al:LIPIcs.CONCUR.2024.20, author = {D'Angelo, Keri and Gurke, Sebastian and Kirss, Johanna Maria and K\"{o}nig, Barbara and Najafi, Matina and R\'{o}\.{z}owski, Wojciech and Wild, Paul}, title = {{Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {20:1--20:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.20}, URN = {urn:nbn:de:0030-drops-207921}, doi = {10.4230/LIPIcs.CONCUR.2024.20}, annote = {Keywords: behavioural metrics, coalgebra, Galois connections, quantales, Kantorovich lifting, up-to techniques} }
Luc Dartois, Paul Gastin, Loïc Germerie Guizouarn, R. Govind, and Shankaranarayanan Krishna. Reversible Transducers over Infinite Words. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 21:1-21:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dartois_et_al:LIPIcs.CONCUR.2024.21, author = {Dartois, Luc and Gastin, Paul and Germerie Guizouarn, Lo\"{i}c and Govind, R. and Krishna, Shankaranarayanan}, title = {{Reversible Transducers over Infinite Words}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {21:1--21:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.21}, URN = {urn:nbn:de:0030-drops-207932}, doi = {10.4230/LIPIcs.CONCUR.2024.21}, annote = {Keywords: Transducers, Regular functions, Reversibility, Composition, SSTs} }
Romain Delpy, Anca Muscholl, and Grégoire Sutre. An Automata-Based Approach for Synchronizable Mailbox Communication. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{delpy_et_al:LIPIcs.CONCUR.2024.22, author = {Delpy, Romain and Muscholl, Anca and Sutre, Gr\'{e}goire}, title = {{An Automata-Based Approach for Synchronizable Mailbox Communication}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {22:1--22:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.22}, URN = {urn:nbn:de:0030-drops-207947}, doi = {10.4230/LIPIcs.CONCUR.2024.22}, annote = {Keywords: Concurrent programming, Mailbox communication, Verification} }
Laurent Doyen and Thomas Soullard. Regular Games with Imperfect Information Are Not That Regular. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 23:1-23:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{doyen_et_al:LIPIcs.CONCUR.2024.23, author = {Doyen, Laurent and Soullard, Thomas}, title = {{Regular Games with Imperfect Information Are Not That Regular}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {23:1--23:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.23}, URN = {urn:nbn:de:0030-drops-207953}, doi = {10.4230/LIPIcs.CONCUR.2024.23}, annote = {Keywords: Imperfect-information games, randomized strategies, synthesis} }
Javier Esparza and Rubén Rubio. Validity of Contextual Formulas. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 24:1-24:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2024.24, author = {Esparza, Javier and Rubio, Rub\'{e}n}, title = {{Validity of Contextual Formulas}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {24:1--24:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.24}, URN = {urn:nbn:de:0030-drops-207965}, doi = {10.4230/LIPIcs.CONCUR.2024.24}, annote = {Keywords: \mu-calculus, temporal logic, contextual rules} }
Sergey Goncharov and Tarmo Uustalu. A Unifying Categorical View of Nondeterministic Iteration and Tests. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 25:1-25:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{goncharov_et_al:LIPIcs.CONCUR.2024.25, author = {Goncharov, Sergey and Uustalu, Tarmo}, title = {{A Unifying Categorical View of Nondeterministic Iteration and Tests}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {25:1--25:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.25}, URN = {urn:nbn:de:0030-drops-207979}, doi = {10.4230/LIPIcs.CONCUR.2024.25}, annote = {Keywords: Kleene iteration, Elgot iteration, Kleene algebra, coalgebraic resumptions} }
Lucie Guillou, Arnaud Sangnier, and Nathalie Sznajder. Phase-Bounded Broadcast Networks over Topologies of Communication. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{guillou_et_al:LIPIcs.CONCUR.2024.26, author = {Guillou, Lucie and Sangnier, Arnaud and Sznajder, Nathalie}, title = {{Phase-Bounded Broadcast Networks over Topologies of Communication}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.26}, URN = {urn:nbn:de:0030-drops-207987}, doi = {10.4230/LIPIcs.CONCUR.2024.26}, annote = {Keywords: Parameterized verification, Coverability, Broadcast Networks} }
Quentin Guilmant and Joël Ouaknine. Inaproximability in Weighted Timed Games. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{guilmant_et_al:LIPIcs.CONCUR.2024.27, author = {Guilmant, Quentin and Ouaknine, Jo\"{e}l}, title = {{Inaproximability in Weighted Timed Games}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.27}, URN = {urn:nbn:de:0030-drops-207998}, doi = {10.4230/LIPIcs.CONCUR.2024.27}, annote = {Keywords: Weighted timed games, approximation, undecidability} }
Daniel Hausmann and Nir Piterman. Faster and Smaller Solutions of Obliging Games. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hausmann_et_al:LIPIcs.CONCUR.2024.28, author = {Hausmann, Daniel and Piterman, Nir}, title = {{Faster and Smaller Solutions of Obliging Games}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {28:1--28:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.28}, URN = {urn:nbn:de:0030-drops-208008}, doi = {10.4230/LIPIcs.CONCUR.2024.28}, annote = {Keywords: Two-player games, reactive synthesis, Emerson-Lei games, parity games} }
Thomas A. Henzinger, Nicolas Mazzocchi, and N. Ege Saraç. Strategic Dominance: A New Preorder for Nondeterministic Processes. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 29:1-29:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{henzinger_et_al:LIPIcs.CONCUR.2024.29, author = {Henzinger, Thomas A. and Mazzocchi, Nicolas and Sara\c{c}, N. Ege}, title = {{Strategic Dominance: A New Preorder for Nondeterministic Processes}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {29:1--29:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.29}, URN = {urn:nbn:de:0030-drops-208011}, doi = {10.4230/LIPIcs.CONCUR.2024.29}, annote = {Keywords: quantitative automata, refinement relation, resolver, strategy, history-determinism} }
Juan C. Jaramillo, Dan Frumin, and Jorge A. Pérez. Around Classical and Intuitionistic Linear Processes. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jaramillo_et_al:LIPIcs.CONCUR.2024.30, author = {Jaramillo, Juan C. and Frumin, Dan and P\'{e}rez, Jorge A.}, title = {{Around Classical and Intuitionistic Linear Processes}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {30:1--30:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.30}, URN = {urn:nbn:de:0030-drops-208026}, doi = {10.4230/LIPIcs.CONCUR.2024.30}, annote = {Keywords: Process calculi, session types, linear logic} }
Łukasz Kamiński and Sławomir Lasota. Bi-Reachability in Petri Nets with Data. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kaminski_et_al:LIPIcs.CONCUR.2024.31, author = {Kami\'{n}ski, {\L}ukasz and Lasota, S{\l}awomir}, title = {{Bi-Reachability in Petri Nets with Data}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.31}, URN = {urn:nbn:de:0030-drops-208038}, doi = {10.4230/LIPIcs.CONCUR.2024.31}, annote = {Keywords: Petri nets, Petri nets with data, reachability, bi-reachability, reversible reachability, mutual reachability, orbit-finite sets} }
Stefan Kiefer and Qiyi Tang. Minimising the Probabilistic Bisimilarity Distance. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 32:1-32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kiefer_et_al:LIPIcs.CONCUR.2024.32, author = {Kiefer, Stefan and Tang, Qiyi}, title = {{Minimising the Probabilistic Bisimilarity Distance}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.32}, URN = {urn:nbn:de:0030-drops-208049}, doi = {10.4230/LIPIcs.CONCUR.2024.32}, annote = {Keywords: Markov decision processes, Markov chains} }
Aristotelis Koutsouridis, Michalis Kokologiannakis, and Viktor Vafeiadis. Automating Memory Model Metatheory with Intersections. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{koutsouridis_et_al:LIPIcs.CONCUR.2024.33, author = {Koutsouridis, Aristotelis and Kokologiannakis, Michalis and Vafeiadis, Viktor}, title = {{Automating Memory Model Metatheory with Intersections}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.33}, URN = {urn:nbn:de:0030-drops-208050}, doi = {10.4230/LIPIcs.CONCUR.2024.33}, annote = {Keywords: Kleene Algebra, Weak Memory Models} }
Guillermo A. Pérez and Shrisha Rao. On Continuous Pushdown VASS in One Dimension. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 34:1-34:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{perez_et_al:LIPIcs.CONCUR.2024.34, author = {P\'{e}rez, Guillermo A. and Rao, Shrisha}, title = {{On Continuous Pushdown VASS in One Dimension}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {34:1--34:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.34}, URN = {urn:nbn:de:0030-drops-208065}, doi = {10.4230/LIPIcs.CONCUR.2024.34}, annote = {Keywords: Vector addition systems, Pushdown automata, Reachability} }
Simon Prucker and Lutz Schröder. Nominal Tree Automata with Name Allocation. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 35:1-35:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{prucker_et_al:LIPIcs.CONCUR.2024.35, author = {Prucker, Simon and Schr\"{o}der, Lutz}, title = {{Nominal Tree Automata with Name Allocation}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {35:1--35:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.35}, URN = {urn:nbn:de:0030-drops-208071}, doi = {10.4230/LIPIcs.CONCUR.2024.35}, annote = {Keywords: Data languages, tree automata, nominal automata, inclusion checking} }
Gaspard Reghem and Rob J. van Glabbeek. Branching Bisimilarity for Processes with Time-Outs. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 36:1-36:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{reghem_et_al:LIPIcs.CONCUR.2024.36, author = {Reghem, Gaspard and van Glabbeek, Rob J.}, title = {{Branching Bisimilarity for Processes with Time-Outs}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {36:1--36:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.36}, URN = {urn:nbn:de:0030-drops-208082}, doi = {10.4230/LIPIcs.CONCUR.2024.36}, annote = {Keywords: Reactive Systems, Time-outs, Branching Bisimilarity, Modal Characterisation, Congruence, Axiomatisation} }
Timm Spork, Christel Baier, Joost-Pieter Katoen, Jakob Piribauer, and Tim Quatmann. A Spectrum of Approximate Probabilistic Bisimulations. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 37:1-37:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{spork_et_al:LIPIcs.CONCUR.2024.37, author = {Spork, Timm and Baier, Christel and Katoen, Joost-Pieter and Piribauer, Jakob and Quatmann, Tim}, title = {{A Spectrum of Approximate Probabilistic Bisimulations}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {37:1--37:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.37}, URN = {urn:nbn:de:0030-drops-208099}, doi = {10.4230/LIPIcs.CONCUR.2024.37}, annote = {Keywords: Markov chains, Approximate bisimulation, Abstraction, Model checking} }
Myrthe S. C. Spronck, Bas Luttik, and Tim A. C. Willemse. Progress, Justness and Fairness in Modal μ-Calculus Formulae. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 38:1-38:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{spronck_et_al:LIPIcs.CONCUR.2024.38, author = {Spronck, Myrthe S. C. and Luttik, Bas and Willemse, Tim A. C.}, title = {{Progress, Justness and Fairness in Modal \mu-Calculus Formulae}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {38:1--38:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.38}, URN = {urn:nbn:de:0030-drops-208102}, doi = {10.4230/LIPIcs.CONCUR.2024.38}, annote = {Keywords: Modal \mu-calculus, Property specification, Completeness criteria, Progress, Justness, Fairness, Liveness properties} }
Lara Stoltenow, Barbara König, Sven Schneider, Andrea Corradini, Leen Lambers, and Fernando Orejas. Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 39:1-39:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{stoltenow_et_al:LIPIcs.CONCUR.2024.39, author = {Stoltenow, Lara and K\"{o}nig, Barbara and Schneider, Sven and Corradini, Andrea and Lambers, Leen and Orejas, Fernando}, title = {{Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {39:1--39:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.39}, URN = {urn:nbn:de:0030-drops-208113}, doi = {10.4230/LIPIcs.CONCUR.2024.39}, annote = {Keywords: satisfiability, graph conditions, coinductive techniques, category theory} }
Marnix Suilen, Marck van der Vegt, and Sebastian Junges. A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs. In 35th International Conference on Concurrency Theory (CONCUR 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 311, pp. 40:1-40:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{suilen_et_al:LIPIcs.CONCUR.2024.40, author = {Suilen, Marnix and van der Vegt, Marck and Junges, Sebastian}, title = {{A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs}}, booktitle = {35th International Conference on Concurrency Theory (CONCUR 2024)}, pages = {40:1--40:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-339-3}, ISSN = {1868-8969}, year = {2024}, volume = {311}, editor = {Majumdar, Rupak and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.40}, URN = {urn:nbn:de:0030-drops-208120}, doi = {10.4230/LIPIcs.CONCUR.2024.40}, annote = {Keywords: Markov Decision Processes, partial observability, linear-time Objectives} }
Feedback for Dagstuhl Publishing