Lorenzo Clemente

According to our database1, Lorenzo Clemente
  • authored at least 33 papers between 2010 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Efficient reduction of nondeterministic automata with application to language inclusion testing.
CoRR, 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.
CoRR, 2016

Regular Separability of Parikh Automata.
CoRR, 2016

Separability of Reachability Sets of Vector Addition Systems.
CoRR, 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.
CoRR, 2015

Ordered Tree-Pushdown Systems.
CoRR, 2015

Reachability analysis of first-order definable pushdown systems.
CoRR, 2015

Timed pushdown automata revisited.
CoRR, 2015

Non-Zero Sum Games for Reactive Synthesis.
CoRR, 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.
Logical Methods in Computer Science, 2014

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

2013
Stochastic Parity Games on Lossy Channel Systems
CoRR, 2013

Stochastic Parity Games on Lossy Channel Systems.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 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

Advanced Automata Minimization
CoRR, 2012

Reachability of Communicating Timed Processes
CoRR, 2012

2011
Büchi Automata can have Smaller Quotients
CoRR, 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...