Lorenzo Clemente

According to our database, Lorenzo Clemente authored at least 36 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Weighted Basic Parallel Processes and Combinatorial Enumeration.

Lorenzo Clemente

Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023

On Rational Recursive Sequences.

Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Multiplicity Problems on Algebraic Series and Context-Free Grammars.

Nikhil Balaji, Lorenzo Clemente, Klara Nosan, Mahsa Shirmohammadi, James Worrell

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Determinisability of register and timed automata.

Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski

Log. Methods Comput. Sci., 2022

Cost Automata, Safe Schemes, and Downward Closures.

David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys

Fundam. Informaticae, 2022

2021

Reachability relations of timed pushdown automata.

Lorenzo Clemente, Slawomir Lasota

J. Comput. Syst. Sci., 2021

Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata.

Corentin Barloy, Lorenzo Clemente

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Deterministic and Game Separability for Regular Languages of Infinite Trees.

Lorenzo Clemente, Michal Skrzypczak

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars.

Lorenzo Clemente

Proceedings of the Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis, 2020

On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report).

Lorenzo Clemente

CoRR, 2020

Timed Games and Deterministic Separability.

Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Determinisability of One-Clock Timed Automata.

Lorenzo Clemente, Slawomir Lasota, Radoslaw Piórkowski

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki

ACM Trans. Comput. Log., 2019

Efficient reduction of nondeterministic automata with application to language inclusion testing.

Lorenzo Clemente, Richard Mayr

Log. Methods Comput. Sci., 2019

Timed Basic Parallel Processes.

Lorenzo Clemente, Piotr Hofman, Patrick Totzke

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Decidability of Timed Communicating Automata.

Lorenzo Clemente

CoRR, 2018

Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms.

Lorenzo Clemente, Slawomir Lasota

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Separability of Reachability Sets of Vector Addition Systems.

Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Timed pushdown automata and branching vector addition systems.

Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Regular Separability of Parikh Automata.

Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.

Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Non-Zero Sum Games for Reactive Synthesis.

Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives.

Lorenzo Clemente, Jean-François Raskin

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Timed Pushdown Automata Revisited.

Lorenzo Clemente, Slawomir Lasota

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Ordered Tree-Pushdown Systems.

Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Reachability Analysis of First-order Definable Pushdown Systems.

Lorenzo Clemente, Slawomir Lasota

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting.

Lorenzo Clemente

CoRR, 2014

Stochastic Parity Games on Lossy Channel Systems.

Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg

Log. Methods Comput. Sci., 2014

Decidable Topologies for Communicating Automata with FIFO and Bag Channels.

Lorenzo Clemente, Frédéric Herbreteau, Grégoire Sutre

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

Advanced automata minimization.

Richard Mayr, Lorenzo Clemente

Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Reachability of Communicating Timed Processes.

Lorenzo Clemente, Frédéric Herbreteau, Amélie Stainer, Grégoire Sutre

Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012

Generalized simulation relations with applications in automata theory.

Lorenzo Clemente

PhD thesis, 2012

2011

Büchi Automata Can Have Smaller Quotients.

Lorenzo Clemente

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Advanced Ramsey-Based Büchi Automata Inclusion Testing.

Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

Multipebble Simulations for Alternating Automata - (Extended Abstract).

Lorenzo Clemente, Richard Mayr

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.

Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar

Proceedings of the Computer Aided Verification, 22nd International Conference, 2010