LIPIcs, Volume 311
CONCUR 2024, September 9-13, 2024, Calgary, Canada
Editors: Rupak Majumdar and Alexandra Silva
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Published in: LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024)
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} }
Feedback for Dagstuhl Publishing