Lorenzo Clemente

ORCID

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 46

Top Venues

University of Edinburgh, UK (PHD)

Education History

University of Edinburgh, UK

PHD

Publications

Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell
Multiplicity Problems on Algebraic Series and Context-Free Grammars. CoRR (2023)
Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell
Multiplicity Problems on Algebraic Series and Context-Free Grammars. LICS (2023)
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
On Rational Recursive Sequences. STACS (2023)
David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae 188 (3) (2022)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of register and timed automata. Log. Methods Comput. Sci. 18 (2) (2022)
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk
On Rational Recursive Sequences. CoRR (2022)
Lorenzo Clemente, Michal Skrzypczak
Deterministic and game separability for regular languages of infinite trees. CoRR (2021)
Corentin Barloy, Lorenzo Clemente
Bidimensional linear recursive sequences and universality of unambiguous register automata. CoRR (2021)
Lorenzo Clemente, Slawomir Lasota
Reachability relations of timed pushdown automata. J. Comput. Syst. Sci. 117 (2021)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of register and timed automata. CoRR (2021)
Lorenzo Clemente, Michal Skrzypczak
Deterministic and Game Separability for Regular Languages of Infinite Trees. ICALP (2021)
Corentin Barloy, Lorenzo Clemente
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. STACS (2021)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Timed Games and Deterministic Separability. ICALP (2020)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of One-Clock Timed Automata. CONCUR (2020)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Determinisability of one-clock timed automata. CoRR (2020)
Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski
Timed games and deterministic separability. CoRR (2020)
David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. ICALP (2020)
Lorenzo Clemente
On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars. VPT/HCVS@ETAPS (2020)
David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. CoRR (2020)
Lorenzo Clemente
On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report). CoRR (2020)
Lorenzo Clemente, Slawomir Lasota
Reachability relations of timed pushdown automata. CoRR (2020)
Lorenzo Clemente, Richard Mayr
Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15 (1) (2019)
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Trans. Comput. Log. 20 (3) (2019)
Lorenzo Clemente, Piotr Hofman, Patrick Totzke
Timed Basic Parallel Processes. CONCUR (2019)
Lorenzo Clemente, Piotr Hofman, Patrick Totzke
Timed Basic Parallel Processes. CoRR (2019)
Lorenzo Clemente
Decidability of Timed Communicating Automata. CoRR (2018)
Lorenzo Clemente, Slawomir Lasota
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms. CoRR (2018)
Lorenzo Clemente, Slawomir Lasota
Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms. ICALP (2018)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Regular Separability of Parikh Automata. ICALP (2017)
Lorenzo Clemente, Richard Mayr
Efficient reduction of nondeterministic automata with application to language inclusion testing. CoRR (2017)
Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Timed pushdown automata and branching vector addition systems. LICS (2017)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Separability of Reachability Sets of Vector Addition Systems. STACS (2017)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. CoRR (2016)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Regular Separability of Parikh Automata. CoRR (2016)
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
Non-Zero Sum Games for Reactive Synthesis. LATA (2016)
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman
Separability of Reachability Sets of Vector Addition Systems. CoRR (2016)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. LICS (2016)
Lorenzo Clemente, Jean-François Raskin
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives. LICS (2015)
Lorenzo Clemente, Slawomir Lasota
Reachability analysis of first-order definable pushdown systems. CoRR (2015)
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
Non-Zero Sum Games for Reactive Synthesis. CoRR (2015)
Lorenzo Clemente, Slawomir Lasota
Timed Pushdown Automata Revisited. LICS (2015)
Lorenzo Clemente, Slawomir Lasota
Reachability Analysis of First-order Definable Pushdown Systems. CSL (2015)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
Ordered Tree-Pushdown Systems. FSTTCS (2015)
Lorenzo Clemente, Slawomir Lasota
Timed pushdown automata revisited. CoRR (2015)
Lorenzo Clemente, Jean-François Raskin
Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives. CoRR (2015)
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz
Ordered Tree-Pushdown Systems. CoRR (2015)
Lorenzo Clemente
Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting. CoRR (2014)
Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre
Decidable Topologies for Communicating Automata with FIFO and Bag Channels. CONCUR (2014)
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
Stochastic Parity Games on Lossy Channel Systems. Log. Methods Comput. Sci. 10 (4) (2014)
Richard Mayr, Lorenzo Clemente
Advanced automata minimization. POPL (2013)
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
Stochastic Parity Games on Lossy Channel Systems. QEST (2013)
Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg
Stochastic Parity Games on Lossy Channel Systems CoRR (2013)
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre
Reachability of Communicating Timed Processes. FoSSaCS (2013)
Lorenzo Clemente, Richard Mayr
Advanced Automata Minimization CoRR (2012)
Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre
Reachability of Communicating Timed Processes CoRR (2012)
Lorenzo Clemente
Büchi Automata Can Have Smaller Quotients. ICALP (2) (2011)
Lorenzo Clemente
Büchi Automata can have Smaller Quotients CoRR (2011)
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR (2011)
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV (2010)
Lorenzo Clemente, Richard Mayr
Multipebble Simulations for Alternating Automata - (Extended Abstract). CONCUR (2010)

Lorenzo Clemente.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Lorenzo Clemente