Follow
Lorenzo Clemente
Lorenzo Clemente
University of Warsaw
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
Advanced automata minimization
R Mayr, L Clemente
ACM SIGPLAN Notices 48 (1), 63-74, 2013
652013
Advanced Ramsey-based Büchi automata inclusion testing
PA Abdulla, YF Chen, L Clemente, L Holík, CD Hong, R Mayr, T Vojnar
CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011
622011
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
CAV 6174, 132-147, 2010
522010
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: 10th International Conference …, 2016
482016
Timed pushdown automata revisited
L Clemente, S Lasota
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 738-749, 2015
402015
Decidable topologies for communicating automata with FIFO and bag channels
L Clemente, F Herbreteau, G Sutre
CONCUR 2014–Concurrency Theory: 25th International Conference, CONCUR 2014 …, 2014
302014
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
292016
Efficient reduction of nondeterministic automata with application to language inclusion testing
L Clemente, R Mayr
Logical Methods in Computer Science 15, 2019
282019
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
262015
Regular separability of Parikh automata
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1612.06233, 2016
212016
Reachability of Communicating Timed Processes.
L Clemente, F Herbreteau, A Stainer, G Sutre
FoSSaCS 7794, 81-96, 2013
212013
Reachability analysis of first-order definable pushdown systems
L Clemente, S Lasota
arXiv preprint arXiv:1504.02651, 2015
182015
Separability of reachability sets of vector addition systems
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1609.00214, 2016
172016
Ordered tree-pushdown systems
L Clemente, P Parys, S Salvati, I Walukiewicz
arXiv preprint arXiv:1510.03278, 2015
172015
B\" uchi Automata can have Smaller Quotients
L Clemente
arXiv preprint arXiv:1102.3285, 2011
162011
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
112017
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
Determinisability of one-clock timed automata
L Clemente, S Lasota, R Piórkowski
arXiv preprint arXiv:2007.09340, 2020
62020
On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report)
L Clemente
arXiv preprint arXiv:2006.05275, 2020
62020
The system can't perform the operation now. Try again later.
Articles 1–20