Record link: 
http://hdl.handle.net/20.500.12708/56776
-
Title: 
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries
en
Citation: 
Bertrand, N., Konnov, I., Lazić, M., & Widder, J. (2019). Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. In W. Fokkink & R. van Glabbeek (Eds.), 30th International Conference on Concurrency Theory (pp. 33:1-33:15). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/LIPIcs.CONCUR.2019.33
-
Publisher DOI: 
10.4230/LIPIcs.CONCUR.2019.33
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Bertrand, Nathalie 
Konnov, Igor 
Lazić, Marijana 
Widder, Josef 
-
Organisational Unit: 
E192-04 - Forschungsbereich Formal Methods in Systems Engineering 
E191-02 - Forschungsbereich Embedded Computing Systems 
-
Published in: 
30th International Conference on Concurrency Theory 
-
ISBN: 
978-3-95977-121-4
-
Volume: 
140
-
Date (published): 
2019
-
Event name: 
CONCUR 2019 - The 30th International Conference on Concurrency Theory 
en
Event date: 
26-Aug-2019 - 31-Aug-2019
-
Event place: 
Amsterdam, Netherlands (the)
-
Number of Pages: 
15
-
Publisher: 
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
-
Publisher: 
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl
-
Peer reviewed: 
Yes
-
Research Areas: 
Computer Engineering and Software-Intensive Systems: 30%
Logic and Computation: 70%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

236
checked on Nov 23, 2023

Download(s)

3
checked on Nov 23, 2023

Google ScholarTM

Check