Daniele Toller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Daniele Toller has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Dikran Dikranjan
Department of Mathematics Computer Science and Physics University of Udine
5 shared publications - Andrea Vandin
Sant’Anna School of Advanced Studies
3 shared publications D. Dikranjan
Dipartimento di Matematica e Informatica, Universitá di Udine, Udine, Italy
3 shared publications- Mirco Tribastone
IMT School for Advanced Studies Lucca
3 shared publications W. Xi
3 shared publications- Wenfei Xi
School of Applied Mathematics , Nanjing University of Finance & Economics , Wenyuan Road No. 3, 210046 Nanjing , P. R. China
3 shared publications
Latest Publications
- 11 November 2026
- Published by Springer Nature
- p. 90-108
Computing Fixed Points Using Dependency Oracles
- 11 November 2026
- Published by Springer Nature
- p. 90-108
Computing Fixed Points Using Dependency Oracles
- Open Access
- 1 April 2026
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 28 (2) , 131-145
Optimality-preserving reduction of controlled chemical reaction networks
Chemical reaction networks (CRNs) are an established population model defined as a system of coupled nonlinear ordinary differential equations across many disciplines. In many applications, for example, in systems biology and epidemiology, CRN parameters such as the kinetic reaction rates can be used as control inputs to steer the system toward a given target. Unfortunately, the resulting optimal control problem is nonlinear, therefore, computationally very challenging. We address this issue by introducing an optimality-preserving reduction algorithm for CRNs. The algorithm partitions the original state variables into a reduced set of macro-variables for which one can define a reduced optimal control problem with provably identical optimal values. The reduction algorithm runs with polynomial time complexity in the size of the CRN. We use this result to reduce verification and control problems of large-scale vaccination models over real-world networks.
- 1 April 2026
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 28 (2) , 131-145
Open AccessOptimality-preserving reduction of controlled chemical reaction networks
Chemical reaction networks (CRNs) are an established population model defined as a system of coupled nonlinear ordinary differential equations across many disciplines. In many applications, for example, in systems biology and epidemiology, CRN parameters such as the kinetic reaction rates can be used as control inputs to steer the system toward a given target. Unfortunately, the resulting optimal control problem is nonlinear, therefore, computationally very challenging. We address this issue by introducing an optimality-preserving reduction algorithm for CRNs. The algorithm partitions the original state variables into a reduced set of macro-variables for which one can define a reduced optimal control problem with provably identical optimal values. The reduction algorithm runs with polynomial time complexity in the size of the CRN. We use this result to reduce verification and control problems of large-scale vaccination models over real-world networks.
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 1169-1175
Coarse-Graining Complex Networks for Control Equivalence
The ability to control complex networks is of crucial importance across a wide range of applications in natural and engineering sciences. However, issues of both theoretical and numerical nature introduce fundamental limitations to controlling large-scale networks. In this article, we cope with this problem by introducing a coarse-graining algorithm. It leads to an aggregated network which satisfies control equivalence, i.e., such that the optimal control values for the original network can be exactly recovered from those of the aggregated one. The algorithm is based on a partition refinement method originally devised for systems of ordinary differential equations, here extended and applied to linear dynamics on complex networks. Using a number of benchmarks from the literature we show considerable reductions across a variety of networks from biology, ecology, engineering, and social sciences.
- 22 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 1169-1175
Coarse-Graining Complex Networks for Control Equivalence
The ability to control complex networks is of crucial importance across a wide range of applications in natural and engineering sciences. However, issues of both theoretical and numerical nature introduce fundamental limitations to controlling large-scale networks. In this article, we cope with this problem by introducing a coarse-graining algorithm. It leads to an aggregated network which satisfies control equivalence, i.e., such that the optimal control values for the original network can be exactly recovered from those of the aggregated one. The algorithm is based on a partition refinement method originally devised for systems of ordinary differential equations, here extended and applied to linear dynamics on complex networks. Using a number of benchmarks from the literature we show considerable reductions across a variety of networks from biology, ecology, engineering, and social sciences.
- 5 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (11) , 8120-8127
Proper Lumping for Positive Bilinear Control Systems
Positive systems naturally arise in situations where the model tracks physical quantities. Although the linear case is well understood, analysis and controller design for nonlinear positive systems remain challenging. Model reduction methods can help tame this problem. Here, we propose a notion of model reduction for a class of positive bilinear systems with (bounded) matrix and exogenous controls. Our reduction, called proper positive lumping, aggregates the original system such that states of the corresponding reduced model represent nonnegative linear combinations of original state variables. In this article, we prove a characterization result showing that the reductions by proper positive lumping are exactly those preserving the optimality of a suitable class of value functions. Moreover, we provide an efficient polynomial-time algorithm for the computation of the minimal lumping. We numerically evaluate our approach by applying it to a number of benchmark case studies.
- 5 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (11) , 8120-8127
Proper Lumping for Positive Bilinear Control Systems
Positive systems naturally arise in situations where the model tracks physical quantities. Although the linear case is well understood, analysis and controller design for nonlinear positive systems remain challenging. Model reduction methods can help tame this problem. Here, we propose a notion of model reduction for a class of positive bilinear systems with (bounded) matrix and exogenous controls. Our reduction, called proper positive lumping, aggregates the original system such that states of the corresponding reduced model represent nonnegative linear combinations of original state variables. In this article, we prove a characterization result showing that the reductions by proper positive lumping are exactly those preserving the optimality of a suitable class of value functions. Moreover, we provide an efficient polynomial-time algorithm for the computation of the minimal lumping. We numerically evaluate our approach by applying it to a number of benchmark case studies.
- Open Access
The algebraic entropy of one-dimensional finitary linear cellular automata
The aim of this paper is to present one-dimensional finitary linear cellular automata $S$ on $\mathbb Z_m$ from an algebraic point of view. Among various other results, we: (i) show that the Pontryagin dual $\widehat S$ of $S$ is a classical one-dimensional linear cellular automaton $T$ on $\mathbb Z_m$; (ii) give several equivalent conditions for $S$ to be invertible with inverse a finitary linear cellular automaton; (iii) compute the algebraic entropy of $S$, which coincides with the topological entropy of $T=\widehat S$ by the so-called Bridge Theorem. In order to better understand and describe the entropy we introduce the degree $\mathrm{deg}(S)$ and $\mathrm{deg}(T)$ of $S$ and $T$.Open AccessThe algebraic entropy of one-dimensional finitary linear cellular automata
The aim of this paper is to present one-dimensional finitary linear cellular automata $S$ on $\mathbb Z_m$ from an algebraic point of view. Among various other results, we: (i) show that the Pontryagin dual $\widehat S$ of $S$ is a classical one-dimensional linear cellular automaton $T$ on $\mathbb Z_m$; (ii) give several equivalent conditions for $S$ to be invertible with inverse a finitary linear cellular automaton; (iii) compute the algebraic entropy of $S$, which coincides with the topological entropy of $T=\widehat S$ by the so-called Bridge Theorem. In order to better understand and describe the entropy we introduce the degree $\mathrm{deg}(S)$ and $\mathrm{deg}(T)$ of $S$ and $T$. - Open Access
- 22 May 2023
- Published by Qeios Ltd
Review of: "Integer topological proof of Dirichlet's theorem"
The topic is interesting, but I could not read follow the exposition of the paper for the following reasons: * I advise the author to spellcheck it, and correct some obvious typos (e.g. “it's” in place of “its”, the author appears to be called "Dan...
- 22 May 2023
- Published by Qeios Ltd
Open AccessReview of: "Integer topological proof of Dirichlet's theorem"
The topic is interesting, but I could not read follow the exposition of the paper for the following reasons: * I advise the author to spellcheck it, and correct some obvious typos (e.g. “it's” in place of “its”, the author appears to be called "Dan...
- 20 January 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 21 (10)
Intrinsic entropy for generalized quasimetric semilattices
We introduce the notion of intrinsic semilattice entropy [ ] in the category [ ] of generalized quasimetric semilattices and contractive homomorphisms. By using appropriate categories [ ] and functors [ ], we find specific known entropies [ ] on [ ] as intrinsic functorial entropies, that is, as [ ]. These entropies are the intrinsic algebraic entropy, the algebraic and the topological entropies for locally linearly compact vector spaces, the topological entropy for totally disconnected locally compact groups and the algebraic entropy for compactly covered locally compact abelian groups.
- 20 January 2022
- Published by World Scientific Pub Co Pte Ltd in Journal of Algebra and Its Applications
- Vol. 21 (10)
Intrinsic entropy for generalized quasimetric semilattices
We introduce the notion of intrinsic semilattice entropy [ ] in the category [ ] of generalized quasimetric semilattices and contractive homomorphisms. By using appropriate categories [ ] and functors [ ], we find specific known entropies [ ] on [ ] as intrinsic functorial entropies, that is, as [ ]. These entropies are the intrinsic algebraic entropy, the algebraic and the topological entropies for locally linearly compact vector spaces, the topological entropy for totally disconnected locally compact groups and the algebraic entropy for compactly covered locally compact abelian groups.
- 1 December 2020
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 224 (12)
Corrigendum to “Intrinsic alegebraic entropy” [J. Pure Appl. Algebra 219 (7) (2015) 2933–2961]
- 1 December 2020
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 224 (12)
Corrigendum to “Intrinsic alegebraic entropy” [J. Pure Appl. Algebra 219 (7) (2015) 2933–2961]
- 1 March 2020
- Published by Elsevier in Topology and its Applications
- Vol. 272
Algebraic entropy on topologically quasihamiltonian groups
- 1 March 2020
- Published by Elsevier in Topology and its Applications
- Vol. 272
Algebraic entropy on topologically quasihamiltonian groups
- 13 November 2019
- Published by Taylor & Francis in Communications in Algebra
- Vol. 48 (3) , 1340-1355
Some applications of algebraic entropy to the proof of Milnor-Wolf theorem
We discuss the growth function of a finitely generated cascade and its connection to the growth function of its related semi-direct product (Conjecture 1.9). The results is applied for simpler proof of well-known results in the realm of geometric group theory. We show that the finitely generated cascades on nilpotent groups obey the dichotomy rule (only polynomial and exponential growth are possible).
- 13 November 2019
- Published by Taylor & Francis in Communications in Algebra
- Vol. 48 (3) , 1340-1355
Some applications of algebraic entropy to the proof of Milnor-Wolf theorem
We discuss the growth function of a finitely generated cascade and its connection to the growth function of its related semi-direct product (Conjecture 1.9). The results is applied for simpler proof of well-known results in the realm of geometric group theory. We show that the finitely generated cascades on nilpotent groups obey the dichotomy rule (only polynomial and exponential growth are possible).