Follow
Lorenzo Clemente
Lorenzo Clemente
University of Warsaw
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
Advanced Ramsey-based Büchi automata inclusion testing
PA Abdulla, YF Chen, L Clemente, L Holík, CD Hong, R Mayr, T Vojnar
International Conference on Concurrency Theory, 187-202, 2011
662011
Advanced automata minimization
R Mayr, L Clemente
ACM SIGPLAN Notices 48 (1), 63-74, 2013
652013
Non-zero sum games for reactive synthesis
R Brenguier, L Clemente, P Hunter, GA Pérez, M Randour, JF Raskin, ...
Language and Automata Theory and Applications, 3-23, 2016
522016
Simulation subsumption in Ramsey-based Büchi automata universality and inclusion testing
PA Abdulla, YF Chen, L Clemente, L Holík, CD Hong, R Mayr, T Vojnar
International Conference on Computer Aided Verification, 132-147, 2010
522010
Timed pushdown automata revisited
L Clemente, S Lasota
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 738-749, 2015
382015
The diagonal problem for higher-order recursion schemes is decidable
L Clemente, P Parys, S Salvati, I Walukiewicz
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
332016
Decidable topologies for communicating automata with FIFO and bag channels
L Clemente, F Herbreteau, G Sutre
International Conference on Concurrency Theory, 281-296, 2014
322014
Efficient reduction of nondeterministic automata with application to language inclusion testing
L Clemente, R Mayr
Logical Methods in Computer Science 15, 2019
312019
Regular separability of Parikh automata
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1612.06233, 2016
252016
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
L Clemente, JF Raskin
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 257-268, 2015
252015
Separability of reachability sets of vector addition systems
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1609.00214, 2016
222016
Reachability of communicating timed processes
L Clemente, F Herbreteau, A Stainer, G Sutre
International Conference on Foundations of Software Science and …, 2013
212013
Ordered tree-pushdown systems
L Clemente, P Parys, S Salvati, I Walukiewicz
arXiv preprint arXiv:1510.03278, 2015
192015
Reachability analysis of first-order definable pushdown systems
L Clemente, S Lasota
arXiv preprint arXiv:1504.02651, 2015
192015
Büchi automata can have smaller quotients
L Clemente
International Colloquium on Automata, Languages, and Programming, 258-270, 2011
172011
Timed pushdown automata and branching vector addition systems
L Clemente, S Lasota, R Lazić, F Mazowiecki
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
122017
Bidimensional linear recursive sequences and universality of unambiguous register automata
C Barloy, L Clemente
arXiv preprint arXiv:2101.01033, 2021
102021
Timed games and deterministic separability
L Clemente, S Lasota, R Piórkowski
arXiv preprint arXiv:2004.12868, 2020
82020
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
L Clemente, S Lasota
arXiv preprint arXiv:1804.10772, 2018
72018
Cost automata, safe schemes, and downward closures
D Barozzini, L Clemente, T Colcombet, P Parys
Fundamenta Informaticae 188, 2023
62023
The system can't perform the operation now. Try again later.
Articles 1–20