Igor Konnov and Laura Kovács. LIPIcs, Volume 171, CONCUR 2020, Complete Volume. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 1-984, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@Proceedings{konnov_et_al:LIPIcs.CONCUR.2020, title = {{LIPIcs, Volume 171, CONCUR 2020, Complete Volume}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {1--984}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020}, URN = {urn:nbn:de:0030-drops-128115}, doi = {10.4230/LIPIcs.CONCUR.2020}, annote = {Keywords: LIPIcs, Volume 171, CONCUR 2020, Complete Volume} }
Igor Konnov and Laura Kovács. Front Matter, Table of Contents, Preface, Conference Organization. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 0:i-0:xvi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{konnov_et_al:LIPIcs.CONCUR.2020.0, author = {Konnov, Igor and Kov\'{a}cs, Laura}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.0}, URN = {urn:nbn:de:0030-drops-128125}, doi = {10.4230/LIPIcs.CONCUR.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Mário S. Alvim, Natasha Fernandes, Annabelle McIver, and Gabriel H. Nunes. On Privacy and Accuracy in Data Releases (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 1:1-1:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{alvim_et_al:LIPIcs.CONCUR.2020.1, author = {Alvim, M\'{a}rio S. and Fernandes, Natasha and McIver, Annabelle and Nunes, Gabriel H.}, title = {{On Privacy and Accuracy in Data Releases}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.1}, URN = {urn:nbn:de:0030-drops-128130}, doi = {10.4230/LIPIcs.CONCUR.2020.1}, annote = {Keywords: Privacy/utility trade-off, Quantitative Information Flow, inference attacks} }
Guy Avni and Thomas A. Henzinger. A Survey of Bidding Games on Graphs (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{avni_et_al:LIPIcs.CONCUR.2020.2, author = {Avni, Guy and Henzinger, Thomas A.}, title = {{A Survey of Bidding Games on Graphs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {2:1--2:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.2}, URN = {urn:nbn:de:0030-drops-128147}, doi = {10.4230/LIPIcs.CONCUR.2020.2}, annote = {Keywords: Bidding games, Richman bidding, poorman bidding, mean-payoff, parity} }
Nils Jansen, Bettina Könighofer, Sebastian Junges, Alex Serban, and Roderick Bloem. Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 3:1-3:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{jansen_et_al:LIPIcs.CONCUR.2020.3, author = {Jansen, Nils and K\"{o}nighofer, Bettina and Junges, Sebastian and Serban, Alex and Bloem, Roderick}, title = {{Safe Reinforcement Learning Using Probabilistic Shields}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.3}, URN = {urn:nbn:de:0030-drops-128155}, doi = {10.4230/LIPIcs.CONCUR.2020.3}, annote = {Keywords: Safe Reinforcement Learning, Formal Verification, Safe Exploration, Model Checking, Markov Decision Process} }
Catuscia Palamidessi and Marco Romanelli. Modern Applications of Game-Theoretic Principles (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 4:1-4:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{palamidessi_et_al:LIPIcs.CONCUR.2020.4, author = {Palamidessi, Catuscia and Romanelli, Marco}, title = {{Modern Applications of Game-Theoretic Principles}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {4:1--4:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.4}, URN = {urn:nbn:de:0030-drops-128167}, doi = {10.4230/LIPIcs.CONCUR.2020.4}, annote = {Keywords: Game theory, machine learning, privacy, security} }
Luca Aceto, Jos Baeten, Patricia Bouyer-Decitre, Holger Hermanns, and Alexandra Silva. CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 5:1-5:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2020.5, author = {Aceto, Luca and Baeten, Jos and Bouyer-Decitre, Patricia and Hermanns, Holger and Silva, Alexandra}, title = {{CONCUR Test-Of-Time Award 2020 Announcement}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {5:1--5:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.5}, URN = {urn:nbn:de:0030-drops-128172}, doi = {10.4230/LIPIcs.CONCUR.2020.5}, annote = {Keywords: Concurrency, CONCUR Test-of-Time Award} }
Rob van Glabbeek. Reactive Bisimulation Semantics for a Process Algebra with Time-Outs. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 6:1-6:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{vanglabbeek:LIPIcs.CONCUR.2020.6, author = {van Glabbeek, Rob}, title = {{Reactive Bisimulation Semantics for a Process Algebra with Time-Outs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {6:1--6:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.6}, URN = {urn:nbn:de:0030-drops-128181}, doi = {10.4230/LIPIcs.CONCUR.2020.6}, annote = {Keywords: Process algebra, time-outs, labelled transition systems, reactive bisimulation semantics, Hennessy-Milner logic, modal characterisations, recursion, complete axiomatisations} }
Clément Aubert and Ioana Cristescu. How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 7:1-7:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aubert_et_al:LIPIcs.CONCUR.2020.7, author = {Aubert, Cl\'{e}ment and Cristescu, Ioana}, title = {{How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {7:1--7:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.7}, URN = {urn:nbn:de:0030-drops-128196}, doi = {10.4230/LIPIcs.CONCUR.2020.7}, annote = {Keywords: Formal semantics, Process algebras and calculi, Distributed and reversible computation, Configuration structures, Reversible CCS, Bisimulation} }
David N. Jansen, Jan Friso Groote, Ferry Timmers, and Pengfei Yang. A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 8:1-8:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{jansen_et_al:LIPIcs.CONCUR.2020.8, author = {Jansen, David N. and Groote, Jan Friso and Timmers, Ferry and Yang, Pengfei}, title = {{A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.8}, URN = {urn:nbn:de:0030-drops-128209}, doi = {10.4230/LIPIcs.CONCUR.2020.8}, annote = {Keywords: Behavioural Equivalence, weak Bisimulation, Markov Chain} }
A. R. Balasubramanian and Igor Walukiewicz. Characterizing Consensus in the Heard-Of Model. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 9:1-9:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{balasubramanian_et_al:LIPIcs.CONCUR.2020.9, author = {Balasubramanian, A. R. and Walukiewicz, Igor}, title = {{Characterizing Consensus in the Heard-Of Model}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.9}, URN = {urn:nbn:de:0030-drops-128217}, doi = {10.4230/LIPIcs.CONCUR.2020.9}, annote = {Keywords: consensus problem, Heard-Of model, verification} }
Javier Esparza and Fabian Reiter. A Classification of Weak Asynchronous Models of Distributed Computing. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 10:1-10:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{esparza_et_al:LIPIcs.CONCUR.2020.10, author = {Esparza, Javier and Reiter, Fabian}, title = {{A Classification of Weak Asynchronous Models of Distributed Computing}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.10}, URN = {urn:nbn:de:0030-drops-128229}, doi = {10.4230/LIPIcs.CONCUR.2020.10}, annote = {Keywords: Asynchrony, Concurrency theory, Weak models of distributed computing} }
Dan Plyukhin and Gul Agha. Scalable Termination Detection for Distributed Actor Systems. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 11:1-11:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{plyukhin_et_al:LIPIcs.CONCUR.2020.11, author = {Plyukhin, Dan and Agha, Gul}, title = {{Scalable Termination Detection for Distributed Actor Systems}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {11:1--11:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.11}, URN = {urn:nbn:de:0030-drops-128231}, doi = {10.4230/LIPIcs.CONCUR.2020.11}, annote = {Keywords: actors, concurrency, termination detection, quiescence detection, garbage collection, distributed systems} }
Ross Horne. Session Subtyping and Multiparty Compatibility Using Circular Sequents. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 12:1-12:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{horne:LIPIcs.CONCUR.2020.12, author = {Horne, Ross}, title = {{Session Subtyping and Multiparty Compatibility Using Circular Sequents}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {12:1--12:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.12}, URN = {urn:nbn:de:0030-drops-128245}, doi = {10.4230/LIPIcs.CONCUR.2020.12}, annote = {Keywords: session types, subtyping, compatibility, linear logic, deadlock freedom} }
Ankush Das and Frank Pfenning. Session Types with Arithmetic Refinements. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 13:1-13:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{das_et_al:LIPIcs.CONCUR.2020.13, author = {Das, Ankush and Pfenning, Frank}, title = {{Session Types with Arithmetic Refinements}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {13:1--13:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.13}, URN = {urn:nbn:de:0030-drops-128252}, doi = {10.4230/LIPIcs.CONCUR.2020.13}, annote = {Keywords: Session Types, Refinement Types, Type Equality} }
Omar Inverso, Hernán Melgratti, Luca Padovani, Catia Trubiani, and Emilio Tuosto. Probabilistic Analysis of Binary Sessions. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 14:1-14:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{inverso_et_al:LIPIcs.CONCUR.2020.14, author = {Inverso, Omar and Melgratti, Hern\'{a}n and Padovani, Luca and Trubiani, Catia and Tuosto, Emilio}, title = {{Probabilistic Analysis of Binary Sessions}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {14:1--14:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.14}, URN = {urn:nbn:de:0030-drops-128264}, doi = {10.4230/LIPIcs.CONCUR.2020.14}, annote = {Keywords: Probabilistic choices, session types, static analysis, deadlock freedom} }
Eike Neumann, Joël Ouaknine, and James Worrell. On Ranking Function Synthesis and Termination for Polynomial Programs. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 15:1-15:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{neumann_et_al:LIPIcs.CONCUR.2020.15, author = {Neumann, Eike and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On Ranking Function Synthesis and Termination for Polynomial Programs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.15}, URN = {urn:nbn:de:0030-drops-128278}, doi = {10.4230/LIPIcs.CONCUR.2020.15}, annote = {Keywords: Semi-algebraic sets, Polynomial ranking functions, Polynomial programs} }
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Vrunda Dave, and Shankara Narayanan Krishna. On the Separability Problem of String Constraints. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 16:1-16:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{abdulla_et_al:LIPIcs.CONCUR.2020.16, author = {Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Dave, Vrunda and Krishna, Shankara Narayanan}, title = {{On the Separability Problem of String Constraints}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {16:1--16:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.16}, URN = {urn:nbn:de:0030-drops-128286}, doi = {10.4230/LIPIcs.CONCUR.2020.16}, annote = {Keywords: string constraints, separability, interpolants} }
Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin, Sriram Sankaranarayanan, and Ashutosh Trivedi. Weighted Transducers for Robustness Verification. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 17:1-17:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{filiot_et_al:LIPIcs.CONCUR.2020.17, author = {Filiot, Emmanuel and Mazzocchi, Nicolas and Raskin, Jean-Fran\c{c}ois and Sankaranarayanan, Sriram and Trivedi, Ashutosh}, title = {{Weighted Transducers for Robustness Verification}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {17:1--17:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.17}, URN = {urn:nbn:de:0030-drops-128290}, doi = {10.4230/LIPIcs.CONCUR.2020.17}, annote = {Keywords: Weighted transducers, Quantitative verification, Fault-tolerance} }
Luca Aceto, Valentina Castiglioni, Anna Ingólfsdóttir, Bas Luttik, and Mathias Ruggaard Pedersen. On the Axiomatisability of Parallel Composition: A Journey in the Spectrum. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 18:1-18:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aceto_et_al:LIPIcs.CONCUR.2020.18, author = {Aceto, Luca and Castiglioni, Valentina and Ing\'{o}lfsd\'{o}ttir, Anna and Luttik, Bas and Pedersen, Mathias Ruggaard}, title = {{On the Axiomatisability of Parallel Composition: A Journey in the Spectrum}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {18:1--18:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.18}, URN = {urn:nbn:de:0030-drops-128303}, doi = {10.4230/LIPIcs.CONCUR.2020.18}, annote = {Keywords: Axiomatisation, Parallel composition, Linear time-branching time spectrum} }
Bharat Adsul, Paul Gastin, Saptarshi Sarkar, and Pascal Weil. Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 19:1-19:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{adsul_et_al:LIPIcs.CONCUR.2020.19, author = {Adsul, Bharat and Gastin, Paul and Sarkar, Saptarshi and Weil, Pascal}, title = {{Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.19}, URN = {urn:nbn:de:0030-drops-128319}, doi = {10.4230/LIPIcs.CONCUR.2020.19}, annote = {Keywords: Mazurkiewicz traces, asynchronous automata, wreath product, cascade product, Krohn Rhodes decomposition theorem, local temporal logic over traces} }
Jana Wagemaker, Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, and Alexandra Silva. Partially Observable Concurrent Kleene Algebra. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 20:1-20:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{wagemaker_et_al:LIPIcs.CONCUR.2020.20, author = {Wagemaker, Jana and Brunet, Paul and Docherty, Simon and Kapp\'{e}, Tobias and Rot, Jurriaan and Silva, Alexandra}, title = {{Partially Observable Concurrent Kleene Algebra}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {20:1--20:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.20}, URN = {urn:nbn:de:0030-drops-128324}, doi = {10.4230/LIPIcs.CONCUR.2020.20}, annote = {Keywords: Concurrent Kleene algebra, Kleene algebra with tests, observations, axiomatisation, completeness, sequential consistency} }
Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, and Dominik Wojtczak. Model-Free Reinforcement Learning for Stochastic Parity Games. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 21:1-21:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hahn_et_al:LIPIcs.CONCUR.2020.21, author = {Hahn, Ernst Moritz and Perez, Mateo and Schewe, Sven and Somenzi, Fabio and Trivedi, Ashutosh and Wojtczak, Dominik}, title = {{Model-Free Reinforcement Learning for Stochastic Parity Games}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.21}, URN = {urn:nbn:de:0030-drops-128332}, doi = {10.4230/LIPIcs.CONCUR.2020.21}, annote = {Keywords: Reinforcement learning, Stochastic games, Omega-regular objectives} }
Paul C. Bell and Pavel Semukhin. Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 22:1-22:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bell_et_al:LIPIcs.CONCUR.2020.22, author = {Bell, Paul C. and Semukhin, Pavel}, title = {{Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.22}, URN = {urn:nbn:de:0030-drops-128344}, doi = {10.4230/LIPIcs.CONCUR.2020.22}, annote = {Keywords: Probabilistic finite automata, cutpoint isolation problem, letter-bounded context-free languages} }
Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 23:1-23:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2020.23, author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan}, title = {{Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {23:1--23:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.23}, URN = {urn:nbn:de:0030-drops-128359}, doi = {10.4230/LIPIcs.CONCUR.2020.23}, annote = {Keywords: vector addition systems, mean-payoff, multidimension, probabilistic semantics} }
Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 24:1-24:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bouyer_et_al:LIPIcs.CONCUR.2020.24, author = {Bouyer, Patricia and Le Roux, St\'{e}phane and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre}, title = {{Games Where You Can Play Optimally with Arena-Independent Finite Memory}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {24:1--24:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.24}, URN = {urn:nbn:de:0030-drops-128360}, doi = {10.4230/LIPIcs.CONCUR.2020.24}, annote = {Keywords: two-player games on graphs, finite-memory determinacy, optimal strategies} }
Paolo Baldan, Barbara König, and Tommaso Padoan. Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 25:1-25:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{baldan_et_al:LIPIcs.CONCUR.2020.25, author = {Baldan, Paolo and K\"{o}nig, Barbara and Padoan, Tommaso}, title = {{Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {25:1--25:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.25}, URN = {urn:nbn:de:0030-drops-128373}, doi = {10.4230/LIPIcs.CONCUR.2020.25}, annote = {Keywords: fixpoint equation systems, complete lattices, parity games, abstract interpretation, up-to techniques, \mu-calculus, bisimilarity} }
Benjamin Monmege, Julie Parreaux, and Pierre-Alain Reynier. Reaching Your Goal Optimally by Playing at Random with No Memory. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 26:1-26:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{monmege_et_al:LIPIcs.CONCUR.2020.26, author = {Monmege, Benjamin and Parreaux, Julie and Reynier, Pierre-Alain}, title = {{Reaching Your Goal Optimally by Playing at Random with No Memory}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {26:1--26:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.26}, URN = {urn:nbn:de:0030-drops-128381}, doi = {10.4230/LIPIcs.CONCUR.2020.26}, annote = {Keywords: Weighted games, Algorithmic game theory, Randomisation} }
Paul Wild and Lutz Schröder. Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 27:1-27:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{wild_et_al:LIPIcs.CONCUR.2020.27, author = {Wild, Paul and Schr\"{o}der, Lutz}, title = {{Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {27:1--27:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.27}, URN = {urn:nbn:de:0030-drops-128394}, doi = {10.4230/LIPIcs.CONCUR.2020.27}, annote = {Keywords: Modal logic, behavioural distance, coalgebra, bisimulation, lax extension} }
Matteo Mio and Valeria Vignudelli. Monads and Quantitative Equational Theories for Nondeterminism and Probability. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 28:1-28:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{mio_et_al:LIPIcs.CONCUR.2020.28, author = {Mio, Matteo and Vignudelli, Valeria}, title = {{Monads and Quantitative Equational Theories for Nondeterminism and Probability}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {28:1--28:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.28}, URN = {urn:nbn:de:0030-drops-128407}, doi = {10.4230/LIPIcs.CONCUR.2020.28}, annote = {Keywords: Computational Effects, Monads, Metric Spaces, Quantitative Algebras} }
Amina Doumane and Damien Pous. Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 29:1-29:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{doumane_et_al:LIPIcs.CONCUR.2020.29, author = {Doumane, Amina and Pous, Damien}, title = {{Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.29}, URN = {urn:nbn:de:0030-drops-128411}, doi = {10.4230/LIPIcs.CONCUR.2020.29}, annote = {Keywords: Relation algebra, graph homomorphisms, (in)equational theories} }
Francesco Ranzato. Decidability and Synthesis of Abstract Inductive Invariants. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 30:1-30:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ranzato:LIPIcs.CONCUR.2020.30, author = {Ranzato, Francesco}, title = {{Decidability and Synthesis of Abstract Inductive Invariants}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {30:1--30:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.30}, URN = {urn:nbn:de:0030-drops-128429}, doi = {10.4230/LIPIcs.CONCUR.2020.30}, annote = {Keywords: Inductive invariant, program verification, abstract interpretation} }
Emanuele D'Osualdo and Felix Stutz. Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 31:1-31:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dosualdo_et_al:LIPIcs.CONCUR.2020.31, author = {D'Osualdo, Emanuele and Stutz, Felix}, title = {{Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {31:1--31:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.31}, URN = {urn:nbn:de:0030-drops-128433}, doi = {10.4230/LIPIcs.CONCUR.2020.31}, annote = {Keywords: Security Protocols, Infinite-State Verification, Ideal Completions for WSTS} }
Rupak Majumdar, Joël Ouaknine, Amaury Pouly, and James Worrell. Algebraic Invariants for Linear Hybrid Automata. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 32:1-32:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{majumdar_et_al:LIPIcs.CONCUR.2020.32, author = {Majumdar, Rupak and Ouaknine, Jo\"{e}l and Pouly, Amaury and Worrell, James}, title = {{Algebraic Invariants for Linear Hybrid Automata}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.32}, URN = {urn:nbn:de:0030-drops-128443}, doi = {10.4230/LIPIcs.CONCUR.2020.32}, annote = {Keywords: Hybrid automata, algebraic invariants} }
Ivan Lanese and Doriana Medić. A General Approach to Derive Uncontrolled Reversible Semantics. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 33:1-33:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{lanese_et_al:LIPIcs.CONCUR.2020.33, author = {Lanese, Ivan and Medi\'{c}, Doriana}, title = {{A General Approach to Derive Uncontrolled Reversible Semantics}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {33:1--33:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.33}, URN = {urn:nbn:de:0030-drops-128457}, doi = {10.4230/LIPIcs.CONCUR.2020.33}, annote = {Keywords: Reversible computing, causality, process calculi, Erlang} }
Daniel Hirschkoff, Enguerrand Prebet, and Davide Sangiorgi. On the Representation of References in the Pi-Calculus. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 34:1-34:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hirschkoff_et_al:LIPIcs.CONCUR.2020.34, author = {Hirschkoff, Daniel and Prebet, Enguerrand and Sangiorgi, Davide}, title = {{On the Representation of References in the Pi-Calculus}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {34:1--34:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.34}, URN = {urn:nbn:de:0030-drops-128466}, doi = {10.4230/LIPIcs.CONCUR.2020.34}, annote = {Keywords: Process calculus, Bisimulation, Asynchrony, Imperative programming} }
Xinxin Liu and TingTing Yu. Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 35:1-35:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{liu_et_al:LIPIcs.CONCUR.2020.35, author = {Liu, Xinxin and Yu, TingTing}, title = {{Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {35:1--35:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.35}, URN = {urn:nbn:de:0030-drops-128479}, doi = {10.4230/LIPIcs.CONCUR.2020.35}, annote = {Keywords: Bisimulation, Congruence, Axiomatisation, Soundness and Completeness} }
Wojciech Czerwiński, Diego Figueira, and Piotr Hofman. Universality Problem for Unambiguous VASS. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 36:1-36:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{czerwinski_et_al:LIPIcs.CONCUR.2020.36, author = {Czerwi\'{n}ski, Wojciech and Figueira, Diego and Hofman, Piotr}, title = {{Universality Problem for Unambiguous VASS}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {36:1--36:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.36}, URN = {urn:nbn:de:0030-drops-128486}, doi = {10.4230/LIPIcs.CONCUR.2020.36}, annote = {Keywords: unambiguity, vector addition systems, universality problems} }
Jérôme Leroux and Grégoire Sutre. Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 37:1-37:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{leroux_et_al:LIPIcs.CONCUR.2020.37, author = {Leroux, J\'{e}r\^{o}me and Sutre, Gr\'{e}goire}, title = {{Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {37:1--37:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.37}, URN = {urn:nbn:de:0030-drops-128498}, doi = {10.4230/LIPIcs.CONCUR.2020.37}, annote = {Keywords: Counter machine, Vector addition system, Reachability problem, Formal verification, Infinite-state system} }
Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, and James Worrell. Coverability in 1-VASS with Disequality Tests. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 38:1-38:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2020.38, author = {Almagor, Shaull and Cohen, Nathann and P\'{e}rez, Guillermo A. and Shirmohammadi, Mahsa and Worrell, James}, title = {{Coverability in 1-VASS with Disequality Tests}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {38:1--38:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.38}, URN = {urn:nbn:de:0030-drops-128501}, doi = {10.4230/LIPIcs.CONCUR.2020.38}, annote = {Keywords: Reachability, Vector addition systems with states, Weighted graphs} }
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, and Patrick Totzke. Strategy Complexity of Parity Objectives in Countable MDPs. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 39:1-39:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kiefer_et_al:LIPIcs.CONCUR.2020.39, author = {Kiefer, Stefan and Mayr, Richard and Shirmohammadi, Mahsa and Totzke, Patrick}, title = {{Strategy Complexity of Parity Objectives in Countable MDPs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.39}, URN = {urn:nbn:de:0030-drops-128513}, doi = {10.4230/LIPIcs.CONCUR.2020.39}, annote = {Keywords: Markov decision processes, Parity objectives, Levy’s zero-one law} }
Damien Busatto-Gaston, Debraj Chakraborty, and Jean-Francois Raskin. Monte Carlo Tree Search Guided by Symbolic Advice for MDPs. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 40:1-40:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{busattogaston_et_al:LIPIcs.CONCUR.2020.40, author = {Busatto-Gaston, Damien and Chakraborty, Debraj and Raskin, Jean-Francois}, title = {{Monte Carlo Tree Search Guided by Symbolic Advice for MDPs}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {40:1--40:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.40}, URN = {urn:nbn:de:0030-drops-128523}, doi = {10.4230/LIPIcs.CONCUR.2020.40}, annote = {Keywords: Markov decision process, Monte Carlo tree search, symbolic advice, simulation} }
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski, and David Purser. The Big-O Problem for Labelled Markov Chains and Weighted Automata. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 41:1-41:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chistikov_et_al:LIPIcs.CONCUR.2020.41, author = {Chistikov, Dmitry and Kiefer, Stefan and Murawski, Andrzej S. and Purser, David}, title = {{The Big-O Problem for Labelled Markov Chains and Weighted Automata}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {41:1--41:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.41}, URN = {urn:nbn:de:0030-drops-128534}, doi = {10.4230/LIPIcs.CONCUR.2020.41}, annote = {Keywords: weighted automata, labelled Markov chains, probabilistic systems} }
Lorenzo Clemente, Sławomir Lasota, and Radosław Piórkowski. Determinisability of One-Clock Timed Automata. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 42:1-42:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{clemente_et_al:LIPIcs.CONCUR.2020.42, author = {Clemente, Lorenzo and Lasota, S{\l}awomir and Pi\'{o}rkowski, Rados{\l}aw}, title = {{Determinisability of One-Clock Timed Automata}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {42:1--42:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.42}, URN = {urn:nbn:de:0030-drops-128542}, doi = {10.4230/LIPIcs.CONCUR.2020.42}, annote = {Keywords: Timed automata, determinisation, deterministic membership problem} }
Vrunda Dave, Emmanuel Filiot, Shankara Narayanan Krishna, and Nathan Lhote. Synthesis of Computable Regular Functions of Infinite Words. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 43:1-43:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dave_et_al:LIPIcs.CONCUR.2020.43, author = {Dave, Vrunda and Filiot, Emmanuel and Krishna, Shankara Narayanan and Lhote, Nathan}, title = {{Synthesis of Computable Regular Functions of Infinite Words}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {43:1--43:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.43}, URN = {urn:nbn:de:0030-drops-128554}, doi = {10.4230/LIPIcs.CONCUR.2020.43}, annote = {Keywords: transducers, infinite words, computability, continuity, synthesis} }
Joshua Moerman and Matteo Sammartino. Residual Nominal Automata. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 44:1-44:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{moerman_et_al:LIPIcs.CONCUR.2020.44, author = {Moerman, Joshua and Sammartino, Matteo}, title = {{Residual Nominal Automata}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {44:1--44:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.44}, URN = {urn:nbn:de:0030-drops-128563}, doi = {10.4230/LIPIcs.CONCUR.2020.44}, annote = {Keywords: nominal automata, residual automata, derivative language, decidability, closure, exact learning, lattice theory} }
Mikhail Raskin, Chana Weil-Kennedy, and Javier Esparza. Flatness and Complexity of Immediate Observation Petri Nets. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 45:1-45:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{raskin_et_al:LIPIcs.CONCUR.2020.45, author = {Raskin, Mikhail and Weil-Kennedy, Chana and Esparza, Javier}, title = {{Flatness and Complexity of Immediate Observation Petri Nets}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {45:1--45:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.45}, URN = {urn:nbn:de:0030-drops-128574}, doi = {10.4230/LIPIcs.CONCUR.2020.45}, annote = {Keywords: Petri Nets, Reachability Analysis, Parameterized Verification, Flattability} }
Florian Horn and Arnaud Sangnier. Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 46:1-46:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{horn_et_al:LIPIcs.CONCUR.2020.46, author = {Horn, Florian and Sangnier, Arnaud}, title = {{Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {46:1--46:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.46}, URN = {urn:nbn:de:0030-drops-128581}, doi = {10.4230/LIPIcs.CONCUR.2020.46}, annote = {Keywords: Parameterized networks, Verification, Cut-offs} }
Shaull Almagor, Udi Boker, Piotr Hofman, and Patrick Totzke. Parametrized Universality Problems for One-Counter Nets. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 47:1-47:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{almagor_et_al:LIPIcs.CONCUR.2020.47, author = {Almagor, Shaull and Boker, Udi and Hofman, Piotr and Totzke, Patrick}, title = {{Parametrized Universality Problems for One-Counter Nets}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {47:1--47:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.47}, URN = {urn:nbn:de:0030-drops-128592}, doi = {10.4230/LIPIcs.CONCUR.2020.47}, annote = {Keywords: Counter net, VASS, Unambiguous Automata, Universality} }
Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Filip Mazowiecki. Reachability in Fixed Dimension Vector Addition Systems with States. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 48:1-48:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{czerwinski_et_al:LIPIcs.CONCUR.2020.48, author = {Czerwi\'{n}ski, Wojciech and Lasota, S{\l}awomir and Lazi\'{c}, Ranko and Leroux, J\'{e}r\^{o}me and Mazowiecki, Filip}, title = {{Reachability in Fixed Dimension Vector Addition Systems with States}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {48:1--48:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.48}, URN = {urn:nbn:de:0030-drops-128605}, doi = {10.4230/LIPIcs.CONCUR.2020.48}, annote = {Keywords: reachability problem, vector addition systems, Petri nets} }
Benedikt Bollig, Alain Finkel, and Amrita Suresh. Bounded Reachability Problems Are Decidable in FIFO Machines. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 49:1-49:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bollig_et_al:LIPIcs.CONCUR.2020.49, author = {Bollig, Benedikt and Finkel, Alain and Suresh, Amrita}, title = {{Bounded Reachability Problems Are Decidable in FIFO Machines}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {49:1--49:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.49}, URN = {urn:nbn:de:0030-drops-128615}, doi = {10.4230/LIPIcs.CONCUR.2020.49}, annote = {Keywords: FIFO machines, reachability, underapproximation, counter machines} }
Jens Oliver Gutsfeld, Markus Müller-Olm, and Christoph Ohrem. Propositional Dynamic Logic for Hyperproperties. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 50:1-50:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gutsfeld_et_al:LIPIcs.CONCUR.2020.50, author = {Gutsfeld, Jens Oliver and M\"{u}ller-Olm, Markus and Ohrem, Christoph}, title = {{Propositional Dynamic Logic for Hyperproperties}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {50:1--50:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.50}, URN = {urn:nbn:de:0030-drops-128628}, doi = {10.4230/LIPIcs.CONCUR.2020.50}, annote = {Keywords: Hyperlogics, Hyperproperties, Model Checking, Automata} }
Feedback for Dagstuhl Publishing