paves > journal | BibSonomy

bookmarks (hide)
display
all
bookmarks only
bookmarks per page
5
10
20
50
100
sort by
added at
title
RSS
BibTeX
XML

No matching posts.

⟨⟨
⟨
⟩
⟩⟩

publications (hide)13
display
all
publications only
publications per page
5
10
20
50
100
sort by
added at
title
author
publication date
entry type
help for advanced sorting...
RSS
BibTeX
RDF
more...

1From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
J. Esparza, J. Kret\'ınský, J. Raskin, and S. Sickert. International Journal on Software Tools for Technology Transfer, 24 (4): 635--659 (2022)
a year ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1Lower bounds on the state complexity of population protocols
P. Czerner, J. Esparza, and J. Leroux. Distributed Comput., 36 (3): 209--218 (2023)
a year ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
2Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
I. Konnov, M. Lazic, I. Stoilkovska, and J. Widder. Log. Methods Comput. Sci., (2023)
a year ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1Protocols with constant local storage and unreliable communication
M. Raskin. Theoretical Computer Science, (January 2023)
a year ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
2Parameterized verification of coverability in infinite state broadcast networks
A. Balasubramanian. Information and Computation, (June 2021)
2 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
2Population Protocols with Unreliable Communication
M. Raskin. Algorithms for Sensor Systems, Springer International Publishing, (2021)
2 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1Verification of randomized consensus algorithms under round-rigid adversaries
N. Bertrand, I. Konnov, M. Lazić, and J. Widder. International Journal on Software Tools for Technology Transfer, (Feb 2, 2021)
4 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
H. van Ditmarsch, É. Goubault, M. Lazić, J. Ledent, and S. Rajsbaum. Journal of Logical and Algebraic Methods in Programming, (2021)#journal.
4 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1A Unified Translation of Linear Temporal Logic to ω-Automata
J. Esparza, J. Kret\'ınský, and S. Sickert. J. ACM, (October 2020)
4 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1The Complexity of Verifying Population Protocols.
J. Esparza, S. Jaax, M. Raskin, and C. Weil-Kennedy. Distributed Computing, (2021)https://arxiv.org/abs/1912.06578.
4 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
2Practical synthesis of reactive systems from LTL specifications via parity games.
M. Luttenberger, P. Meyer, and S. Sickert. Acta Inf., 57 (1-2): 3-36 (2020)https://arxiv.org/abs/1903.12576.
4 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
1On defining linear orders by automata
I. Durand, B. Courcelle, and M. Raskin. Moscow Journal of Combinatorics and Number Theory, 9 (3): 253-291 (2020)Preprint: <a href="https://hal.archives-ouvertes.fr/hal-02397982/">Link</a><br>#journal.
5 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard
2Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead
M. Raskin, and M. Simkin. Lecture Notes in Computer Science, volume 11922 of Lecture Notes in Computer Science, Springer International Publishing, https://eprint.iacr.org/2018/268.(2019)
5 years ago by @paves
show all tags
journal
journal
(0)
copydeleteadd this publication to your clipboard

⟨⟨
⟨
1
⟩
⟩⟩

BibSonomy

bookmarks (hide)
display
all
bookmarks only
bookmarks per page
5
10
20
50
100
sort by
added at
title
RSS
BibTeX
XML

publications (hide)13
display
all
publications only
publications per page
5
10
20
50
100
sort by
added at
title
author
publication date
entry type
help for advanced sorting...
RSS
BibTeX
RDF
more...

1From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata

1Lower bounds on the state complexity of population protocols

2Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker

1Protocols with constant local storage and unreliable communication

2Parameterized verification of coverability in infinite state broadcast networks

2Population Protocols with Unreliable Communication

1Verification of randomized consensus algorithms under round-rigid adversaries

1A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks

1A Unified Translation of Linear Temporal Logic to ω-Automata

1The Complexity of Verifying Population Protocols.

2Practical synthesis of reactive systems from LTL specifications via parity games.

1On defining linear orders by automata

2Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

browse

related tags

concepts

tags

bookmarks (hide) displayallbookmarks onlybookmarks per page5102050100 sort byadded attitle RSSBibTeXXML

publications (hide)13 displayallpublications onlypublications per page5102050100 sort byadded attitleauthorpublication dateentry typehelp for advanced sorting... RSSBibTeXRDFmore...

browse

related tags

tags

bookmarks (hide)
display
all
bookmarks only
bookmarks per page
5
10
20
50
100
sort by
added at
title
RSS
BibTeX
XML

publications (hide)13
display
all
publications only
publications per page
5
10
20
50
100
sort by
added at
title
author
publication date
entry type
help for advanced sorting...
RSS
BibTeX
RDF
more...