Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/concur/concur2020.bht:"
download as .bib file
@inproceedings{DBLP:conf/concur/0001KJSB20,
author = {Nils Jansen and
Bettina K{\"{o}}nighofer and
Sebastian Junges and
Alex Serban and
Roderick Bloem},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Safe Reinforcement Learning Using Probabilistic Shields (Invited Paper)},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {3:1--3:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.3},
doi = {10.4230/LIPICS.CONCUR.2020.3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/0001KJSB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/0001S20,
author = {Florian Horn and
Arnaud Sangnier},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {46:1--46:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.46},
doi = {10.4230/LIPICS.CONCUR.2020.46},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/0001S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/0009Y20,
author = {Xinxin Liu and
Tingting Yu},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Canonical Solutions to Recursive Equations and Completeness of Equational
Axiomatisations},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {35:1--35:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.35},
doi = {10.4230/LIPICS.CONCUR.2020.35},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/0009Y20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AbdullaADK20,
author = {Parosh Aziz Abdulla and
Mohamed Faouzi Atig and
Vrunda Dave and
Shankara Narayanan Krishna},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {On the Separability Problem of String Constraints},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {16:1--16:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.16},
doi = {10.4230/LIPICS.CONCUR.2020.16},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AbdullaADK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AcetoBBH020,
author = {Luca Aceto and
Jos C. M. Baeten and
Patricia Bouyer{-}Decitre and
Holger Hermanns and
Alexandra Silva},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {{CONCUR} Test-Of-Time Award 2020 Announcement (Invited Paper)},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {5:1--5:3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.5},
doi = {10.4230/LIPICS.CONCUR.2020.5},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AcetoBBH020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AcetoCILP20,
author = {Luca Aceto and
Valentina Castiglioni and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Bas Luttik and
Mathias Ruggaard Pedersen},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {On the Axiomatisability of Parallel Composition: {A} Journey in the
Spectrum},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {18:1--18:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.18},
doi = {10.4230/LIPICS.CONCUR.2020.18},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AcetoCILP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AdsulGSW20,
author = {Bharat Adsul and
Paul Gastin and
Saptarshi Sarkar and
Pascal Weil},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Wreath/Cascade Products and Related Decomposition Results for the
Concurrent Setting of Mazurkiewicz Traces},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {19:1--19:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.19},
doi = {10.4230/LIPICS.CONCUR.2020.19},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AdsulGSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AlmagorBHT20,
author = {Shaull Almagor and
Udi Boker and
Piotr Hofman and
Patrick Totzke},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Parametrized Universality Problems for One-Counter Nets},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {47:1--47:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.47},
doi = {10.4230/LIPICS.CONCUR.2020.47},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AlmagorBHT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AlmagorCPS020,
author = {Shaull Almagor and
Nathann Cohen and
Guillermo A. P{\'{e}}rez and
Mahsa Shirmohammadi and
James Worrell},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Coverability in 1-VASS with Disequality Tests},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {38:1--38:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.38},
doi = {10.4230/LIPICS.CONCUR.2020.38},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AlmagorCPS020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AlvimFMN20,
author = {M{\'{a}}rio S. Alvim and
Natasha Fernandes and
Annabelle McIver and
Gabriel Henrique Nunes},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {On Privacy and Accuracy in Data Releases (Invited Paper)},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {1:1--1:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.1},
doi = {10.4230/LIPICS.CONCUR.2020.1},
timestamp = {Wed, 09 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AlvimFMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AubertC20,
author = {Cl{\'{e}}ment Aubert and
Ioana Cristescu},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {How Reversibility Can Solve Traditional Questions: The Example of
Hereditary History-Preserving Bisimulation},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {7:1--7:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.7},
doi = {10.4230/LIPICS.CONCUR.2020.7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/AubertC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AvniH20,
author = {Guy Avni and
Thomas A. Henzinger},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {A Survey of Bidding Games on Graphs (Invited Paper)},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {2:1--2:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.2},
doi = {10.4230/LIPICS.CONCUR.2020.2},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/AvniH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Balasubramanian20,
author = {A. R. Balasubramanian and
Igor Walukiewicz},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Characterizing Consensus in the Heard-Of Model},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {9:1--9:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.9},
doi = {10.4230/LIPICS.CONCUR.2020.9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/Balasubramanian20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Baldan0P20,
author = {Paolo Baldan and
Barbara K{\"{o}}nig and
Tommaso Padoan},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {25:1--25:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.25},
doi = {10.4230/LIPICS.CONCUR.2020.25},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Baldan0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BellS20,
author = {Paul C. Bell and
Pavel Semukhin},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Decidability of Cutpoint Isolation for Probabilistic Finite Automata
on Letter-Bounded Inputs},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {22:1--22:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.22},
doi = {10.4230/LIPICS.CONCUR.2020.22},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BellS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BolligFS20,
author = {Benedikt Bollig and
Alain Finkel and
Amrita Suresh},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Bounded Reachability Problems Are Decidable in {FIFO} Machines},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {49:1--49:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.49},
doi = {10.4230/LIPICS.CONCUR.2020.49},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/BolligFS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Bouyer0ORV20,
author = {Patricia Bouyer and
St{\'{e}}phane Le Roux and
Youssouf Oualhadj and
Mickael Randour and
Pierre Vandenhove},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Games Where You Can Play Optimally with Arena-Independent Finite Memory},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {24:1--24:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.24},
doi = {10.4230/LIPICS.CONCUR.2020.24},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Bouyer0ORV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Busatto-Gaston020,
author = {Damien Busatto{-}Gaston and
Debraj Chakraborty and
Jean{-}Fran{\c{c}}ois Raskin},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Monte Carlo Tree Search Guided by Symbolic Advice for MDPs},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {40:1--40:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.40},
doi = {10.4230/LIPICS.CONCUR.2020.40},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Busatto-Gaston020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/ChatterjeeHO20,
author = {Krishnendu Chatterjee and
Thomas A. Henzinger and
Jan Otop},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Multi-Dimensional Long-Run Average Problems for Vector Addition Systems
with States},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.23},
doi = {10.4230/LIPICS.CONCUR.2020.23},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/ChatterjeeHO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/ChistikovKMP20,
author = {Dmitry Chistikov and
Stefan Kiefer and
Andrzej S. Murawski and
David Purser},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {The Big-O Problem for Labelled Markov Chains and Weighted Automata},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {41:1--41:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.41},
doi = {10.4230/LIPICS.CONCUR.2020.41},
timestamp = {Sat, 26 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/ChistikovKMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Clemente0P20,
author = {Lorenzo Clemente and
Slawomir Lasota and
Radoslaw Pi{\'{o}}rkowski},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Determinisability of One-Clock Timed Automata},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {42:1--42:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.42},
doi = {10.4230/LIPICS.CONCUR.2020.42},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Clemente0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Czerwinski0LLM20,
author = {Wojciech Czerwinski and
Slawomir Lasota and
Ranko Lazic and
J{\'{e}}r{\^{o}}me Leroux and
Filip Mazowiecki},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Reachability in Fixed Dimension Vector Addition Systems with States},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {48:1--48:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.48},
doi = {10.4230/LIPICS.CONCUR.2020.48},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Czerwinski0LLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/CzerwinskiFH20,
author = {Wojciech Czerwinski and
Diego Figueira and
Piotr Hofman},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Universality Problem for Unambiguous {VASS}},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {36:1--36:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.36},
doi = {10.4230/LIPICS.CONCUR.2020.36},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/CzerwinskiFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/DOsualdoS20,
author = {Emanuele D'Osualdo and
Felix Stutz},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Decidable Inductive Invariants for Verification of Cryptographic Protocols
with Unbounded Sessions},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {31:1--31:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.31},
doi = {10.4230/LIPICS.CONCUR.2020.31},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/DOsualdoS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/DasP20,
author = {Ankush Das and
Frank Pfenning},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Session Types with Arithmetic Refinements},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.13},
doi = {10.4230/LIPICS.CONCUR.2020.13},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/DasP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/DaveFKL20,
author = {Vrunda Dave and
Emmanuel Filiot and
Shankara Narayanan Krishna and
Nathan Lhote},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Synthesis of Computable Regular Functions of Infinite Words},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {43:1--43:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.43},
doi = {10.4230/LIPICS.CONCUR.2020.43},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/DaveFKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/DoumaneP20,
author = {Amina Doumane and
Damien Pous},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Non Axiomatisability of Positive Relation Algebras with Constants,
via Graph Homomorphisms},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.29},
doi = {10.4230/LIPICS.CONCUR.2020.29},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/DoumaneP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/EsparzaR20,
author = {Javier Esparza and
Fabian Reiter},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {A Classification of Weak Asynchronous Models of Distributed Computing},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {10:1--10:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.10},
doi = {10.4230/LIPICS.CONCUR.2020.10},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/EsparzaR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/FiliotMR0020,
author = {Emmanuel Filiot and
Nicolas Mazzocchi and
Jean{-}Fran{\c{c}}ois Raskin and
Sriram Sankaranarayanan and
Ashutosh Trivedi},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Weighted Transducers for Robustness Verification},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {17:1--17:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.17},
doi = {10.4230/LIPICS.CONCUR.2020.17},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/FiliotMR0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Glabbeek20,
author = {Rob van Glabbeek},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Reactive Bisimulation Semantics for a Process Algebra with Time-Outs},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {6:1--6:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.6},
doi = {10.4230/LIPICS.CONCUR.2020.6},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Glabbeek20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/GutsfeldMO20,
author = {Jens Oliver Gutsfeld and
Markus M{\"{u}}ller{-}Olm and
Christoph Ohrem},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Propositional Dynamic Logic for Hyperproperties},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {50:1--50:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.50},
doi = {10.4230/LIPICS.CONCUR.2020.50},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/GutsfeldMO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/HahnPSS0W20,
author = {Ernst Moritz Hahn and
Mateo Perez and
Sven Schewe and
Fabio Somenzi and
Ashutosh Trivedi and
Dominik Wojtczak},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Model-Free Reinforcement Learning for Stochastic Parity Games},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {21:1--21:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.21},
doi = {10.4230/LIPICS.CONCUR.2020.21},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/HahnPSS0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/HirschkoffPS20,
author = {Daniel Hirschkoff and
Enguerrand Prebet and
Davide Sangiorgi},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {On the Representation of References in the Pi-Calculus},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {34:1--34:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.34},
doi = {10.4230/LIPICS.CONCUR.2020.34},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/HirschkoffPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Horne20,
author = {Ross Horne},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Session Subtyping and Multiparty Compatibility Using Circular Sequents},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {12:1--12:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.12},
doi = {10.4230/LIPICS.CONCUR.2020.12},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Horne20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/InversoMPTT20,
author = {Omar Inverso and
Hern{\'{a}}n C. Melgratti and
Luca Padovani and
Catia Trubiani and
Emilio Tuosto},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Probabilistic Analysis of Binary Sessions},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {14:1--14:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.14},
doi = {10.4230/LIPICS.CONCUR.2020.14},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/InversoMPTT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/JansenGTY20,
author = {David N. Jansen and
Jan Friso Groote and
Ferry Timmers and
Pengfei Yang},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.8},
doi = {10.4230/LIPICS.CONCUR.2020.8},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/JansenGTY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KieferMST20,
author = {Stefan Kiefer and
Richard Mayr and
Mahsa Shirmohammadi and
Patrick Totzke},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Strategy Complexity of Parity Objectives in Countable MDPs},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {39:1--39:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.39},
doi = {10.4230/LIPICS.CONCUR.2020.39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/KieferMST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/LaneseM20,
author = {Ivan Lanese and
Doriana Medic},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {A General Approach to Derive Uncontrolled Reversible Semantics},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {33:1--33:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.33},
doi = {10.4230/LIPICS.CONCUR.2020.33},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/LaneseM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/LerouxS20,
author = {J{\'{e}}r{\^{o}}me Leroux and
Gr{\'{e}}goire Sutre},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Reachability in Two-Dimensional Vector Addition Systems with States:
One Test Is for Free},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {37:1--37:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.37},
doi = {10.4230/LIPICS.CONCUR.2020.37},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/LerouxS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/MajumdarOP020,
author = {Rupak Majumdar and
Jo{\"{e}}l Ouaknine and
Amaury Pouly and
James Worrell},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Algebraic Invariants for Linear Hybrid Automata},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {32:1--32:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.32},
doi = {10.4230/LIPICS.CONCUR.2020.32},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/MajumdarOP020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/MioV20,
author = {Matteo Mio and
Valeria Vignudelli},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Monads and Quantitative Equational Theories for Nondeterminism and
Probability},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {28:1--28:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.28},
doi = {10.4230/LIPICS.CONCUR.2020.28},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/MioV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/MoermanS20,
author = {Joshua Moerman and
Matteo Sammartino},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Residual Nominal Automata},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {44:1--44:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.44},
doi = {10.4230/LIPICS.CONCUR.2020.44},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/MoermanS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/MonmegePR20,
author = {Benjamin Monmege and
Julie Parreaux and
Pierre{-}Alain Reynier},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Reaching Your Goal Optimally by Playing at Random with No Memory},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {26:1--26:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.26},
doi = {10.4230/LIPICS.CONCUR.2020.26},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/MonmegePR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/NeumannO020,
author = {Eike Neumann and
Jo{\"{e}}l Ouaknine and
James Worrell},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {On Ranking Function Synthesis and Termination for Polynomial Programs},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {15:1--15:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.15},
doi = {10.4230/LIPICS.CONCUR.2020.15},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/NeumannO020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Palamidessi020,
author = {Catuscia Palamidessi and
Marco Romanelli},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Modern Applications of Game-Theoretic Principles (Invited Paper)},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {4:1--4:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.4},
doi = {10.4230/LIPICS.CONCUR.2020.4},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Palamidessi020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/PlyukhinA20,
author = {Dan Plyukhin and
Gul Agha},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Scalable Termination Detection for Distributed Actor Systems},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {11:1--11:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.11},
doi = {10.4230/LIPICS.CONCUR.2020.11},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/PlyukhinA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Ranzato20,
author = {Francesco Ranzato},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Decidability and Synthesis of Abstract Inductive Invariants},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {30:1--30:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.30},
doi = {10.4230/LIPICS.CONCUR.2020.30},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/Ranzato20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/RaskinWE20,
author = {Mikhail A. Raskin and
Chana Weil{-}Kennedy and
Javier Esparza},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Flatness and Complexity of Immediate Observation Petri Nets},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {45:1--45:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.45},
doi = {10.4230/LIPICS.CONCUR.2020.45},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/RaskinWE20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/WagemakerBDKR020,
author = {Jana Wagemaker and
Paul Brunet and
Simon Docherty and
Tobias Kapp{\'{e}} and
Jurriaan Rot and
Alexandra Silva},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Partially Observable Concurrent Kleene Algebra},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {20:1--20:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.20},
doi = {10.4230/LIPICS.CONCUR.2020.20},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/WagemakerBDKR020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/WildS20,
author = {Paul Wild and
Lutz Schr{\"{o}}der},
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Characteristic Logics for Behavioural Metrics via Fuzzy Lax Extensions},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {27:1--27:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.27},
doi = {10.4230/LIPICS.CONCUR.2020.27},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/WildS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/X20,
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
pages = {0:1--0:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CONCUR.2020.0},
doi = {10.4230/LIPICS.CONCUR.2020.0},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/concur/X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/concur/2020,
editor = {Igor Konnov and
Laura Kov{\'{a}}cs},
title = {31st International Conference on Concurrency Theory, {CONCUR} 2020,
September 1-4, 2020, Vienna, Austria (Virtual Conference)},
series = {LIPIcs},
volume = {171},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-160-3},
isbn = {978-3-95977-160-3},
timestamp = {Mon, 21 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/concur/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-05 01:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
