Lorenzo Clemente
Lorenzo Clemente
Dirección de correo verificada de mimuw.edu.pl - Página principal
Título
Citado por
Citado por
Año
Advanced automata minimization
R Mayr, L Clemente
ACM SIGPLAN Notices 48 (1), 63-74, 2013
442013
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
392011
Timed pushdown automata revisited
L Clemente, S Lasota
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 738-749, 2015
322015
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
302010
Decidable topologies for communicating automata with FIFO and bag channels
L Clemente, F Herbreteau, G Sutre
International Conference on Concurrency Theory, 281-296, 2014
262014
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
232015
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
222016
Reachability of communicating timed processes
L Clemente, F Herbreteau, A Stainer, G Sutre
International Conference on Foundations of Software Science and …, 2013
192013
The diagonal problem for higher-order recursion schemes is decidable
L Clemente, P Parys, S Salvati, I Walukiewicz
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
152016
Ordered tree-pushdown systems
L Clemente, P Parys, S Salvati, I Walukiewicz
arXiv preprint arXiv:1510.03278, 2015
132015
Büchi automata can have smaller quotients
L Clemente
International Colloquium on Automata, Languages, and Programming, 258-270, 2011
132011
Reachability analysis of first-order definable pushdown systems
L Clemente, S Lasota
arXiv preprint arXiv:1504.02651, 2015
122015
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
92017
Regular separability of Parikh automata
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1612.06233, 2016
82016
Separability of reachability sets of vector addition systems
L Clemente, W Czerwiński, S Lasota, C Paperman
arXiv preprint arXiv:1609.00214, 2016
82016
Type checking liveness for collaborative processes with bounded and unbounded recursion
S Debois, T Hildebrandt, T Slaats, N Yoshida
International Conference on Formal Techniques for Distributed Objects …, 2014
62014
Generalized simulation relations with applications in automata theory
L Clemente
The University of Edinburgh, 2012
62012
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
L Clemente, S Lasota
arXiv preprint arXiv:1804.10772, 2018
52018
Multipebble simulations for alternating automata
L Clemente, R Mayr
International Conference on Concurrency Theory, 297-312, 2010
52010
Efficient reduction of nondeterministic automata with application to language inclusion testing
L Clemente, R Mayr
arXiv preprint arXiv:1711.09946, 2017
42017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20