Lorenzo Clemente

Orcid: 0000-0003-0578-9103

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Weighted Basic Parallel Processes and Combinatorial Enumeration.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023
On Rational Recursive Sequences.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Multiplicity Problems on Algebraic Series and Context-Free Grammars.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022
Determinisability of register and timed automata.
Log. Methods Comput. Sci., 2022

Cost Automata, Safe Schemes, and Downward Closures.
Fundam. Informaticae, 2022

2021
Reachability relations of timed pushdown automata.
J. Comput. Syst. Sci., 2021

Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Deterministic and Game Separability for Regular Languages of Infinite Trees.
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.
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).
CoRR, 2020

Timed Games and Deterministic Separability.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Determinisability of One-Clock Timed Automata.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.
ACM Trans. Comput. Log., 2019

Efficient reduction of nondeterministic automata with application to language inclusion testing.
Log. Methods Comput. Sci., 2019

Timed Basic Parallel Processes.
Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018
Decidability of Timed Communicating Automata.
CoRR, 2018

Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Separability of Reachability Sets of Vector Addition Systems.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Timed pushdown automata and branching vector addition systems.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Regular Separability of Parikh Automata.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Non-Zero Sum Games for Reactive Synthesis.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Timed Pushdown Automata Revisited.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Ordered Tree-Pushdown Systems.
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.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

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

Stochastic Parity Games on Lossy Channel Systems.
Log. Methods Comput. Sci., 2014

Decidable Topologies for Communicating Automata with FIFO and Bag Channels.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

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

Reachability of Communicating Timed Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Generalized simulation relations with applications in automata theory.
PhD thesis, 2012

2011
Büchi Automata Can Have Smaller Quotients.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Advanced Ramsey-Based Büchi Automata Inclusion Testing.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Multipebble Simulations for Alternating Automata - (Extended Abstract).
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010


  Loading...