L
Lorenzo Clemente
Researcher at University of Warsaw
Publications - 59
Citations - 688
Lorenzo Clemente is an academic researcher from University of Warsaw. The author has contributed to research in topics: Decidability & Reachability. The author has an hindex of 14, co-authored 57 publications receiving 623 citations. Previous affiliations of Lorenzo Clemente include University of Bordeaux & University of Edinburgh.
Papers
More filters
Book ChapterDOI
Advanced Ramsey-based Büchi automata inclusion testing
Parosh Aziz Abdulla,Yu-Fang Chen,Lorenzo Clemente,Lukáš Holík,Chih-Duo Hong,Richard Mayr,Tomáš Vojnar +6 more
TL;DR: The basic Ramsey-based approach to checking language inclusion between two nondeterministic Buchi automata A and B is built on, with the following new techniques: a larger subsumption relation based on a combination of backward and forward simulations, and abstraction techniques that can speed up the computation and lead to early detection of counterexamples.
Proceedings ArticleDOI
Advanced automata minimization
Richard Mayr,Lorenzo Clemente +1 more
TL;DR: In this paper, a transition pruning algorithm is proposed to reduce the size of Buchi automata while retaining their language, which can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories.
Book ChapterDOI
Simulation subsumption in ramsey-based büchi automata universality and inclusion testing
Parosh Aziz Abdulla,Yu-Fang Chen,Lorenzo Clemente,Lukáš Holík,Chih-Duo Hong,Richard Mayr,Tomáš Vojnar +6 more
TL;DR: This work presents a much more general subsumption technique for the Ramsey-based method, which is based on using simulation preorder on the states of the Buchi-automata, yielding a substantial performance gain over the previous simple subsumption approach.
Book ChapterDOI
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 +7 more
TL;DR: New solution concepts useful for the synthesis of reactive systems that are developed in the context of non-zero sum games played on graphs are summarized.
Posted Content
Advanced Automata Minimization
Lorenzo Clemente,Richard Mayr +1 more
TL;DR: An efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language is presented, and methods to solve PSPACE-complete automata problems like universality, equivalence and inclusion for much larger instances than before are described.