Lorenzo Clemente

68 papers A* 13A 3B 8C 1Journal 37Unranked 4

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