ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations

  title={ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations},
  author={Luca Cardelli and Mirco Tribastone and Max Tschaikowski and Andrea Vandin},
We present ERODE, a multi-platform tool for the solution and exact reduction of systems of ordinary differential equations ODEs. ERODE supports two recently introduced, complementary, equivalence relations over ODE variables: forward differential equivalence yields a self-consistent aggregate system where each ODE gives the cumulative dynamics of the sum of the original variables in the respective equivalence class. Backward differential equivalence identifies variables that have identical… 
Maximal aggregation of polynomial dynamical systems
An aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion).
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods
An algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial differential equations, a ubiquitous model of dynamical systems across science and engineering is developed.
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
  • M. Boreale
  • Mathematics, Computer Science
  • 2017
This work considers reasoning and minimization in systems of polynomial ordinary differential equations odes and develops a complete algorithm, based on building an ascending chain of ideals, for computing the largest system of odes containing all valid identities that are instances of a user-specified template.
Language-based Abstractions for Dynamical Systems
An overview of a recently proposed computer-science perspective to ODE reduction is recast to finding an appropriate equivalence relation over ODE variables, akin to classical models of computation based on labelled transition systems.
Minimization of Dynamical Systems over Monoids
Quantitative notions of bisimulation are well-known tools for the minimization of dynamical models such as Markov chains and differential equations. In a forward-type bisimulation, each state in the
Discretization of Continuous Dynamical Systems Using UPPAAL
This work shows how a continuous dynamical system can be translated into a discrete model of communicating timed automata that can be analyzed by the UPPAAL tool on the basis of the well-known Euler approach for solving differential equations.
Interpretable exact linear reductions via positivity
An algorithm is designed and implemented that, given an exact linear reduction of the smallest possible dimension, re-parametrizes it by performing an invertible transformation of the new coordinates to improve the interpretability of thenew variables.
CLUE: Exact maximal reduction of kinetic models by constrained lumping of differential equations
This work presents CLUE, an algorithm for exact model reduction of systems of polynomial differential equations by constrained linear lumping that computes the smallest dimensional reduction as a linear mapping of the state space such that the reduced model preserves the dynamics of user-specified linear combinations of the original variables.
Exact linear reduction for rational dynamical systems
Detailed dynamical systems models used in life sciences may include dozens or even hundreds of state variables. Models of large dimension are not only harder from the numerical perspective (e.g., for
Exact maximal reduction of stochastic reaction networks by species lumping
An exact lumping method for stochastic reaction networks with mass-action kinetics that hinges on an equivalence relation between the species, resulting in a reduced network where the dynamics of each macro-species is stochastically equivalent to the sum of the original species in each equivalence class.


Efficient Syntax-Driven Lumping of Differential Equations
Numerical experiments on real-world models from biochemistry, electrical engineering, and structural mechanics show that the prototype is able to handle ODEs with millions of variables and monomials, providing significant model reductions.
Differential Bisimulation for a Markovian Process Algebra
This work presents differential bisimulation, a behavioral equivalence developed as the ODE counterpart of bisimulations for languages with probabilistic or stochastic semantics, and provides an efficient partition-refinement algorithm to compute the coarsest ODE aggregation of a model according to differential bisIMulation.
A unified framework for differential aggregations in Markovian process algebra
Forward and Backward Bisimulations for Chemical Reaction Networks
A unified algorithm is provided that computes the coarsest refinement up to the authors' bisimulations in polynomial time and algorithms to compute quotient CRNs induced by a bisimulation are given.
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
A reduction method is constructed which generates (typically) far smaller systems of differential equations than the concrete/canonical one, and it is shown that the abstract/reduced differential system has solutions which are linear combinations of the canonical ones.
Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls
We present a model reduction technique for a class of nonlinear ordinary differential equation (ODE) models of heterogeneous systems, where heterogeneity is expressed in terms of classes of state
Quantitative Abstractions for Collective Adaptive Systems
This chapter treats the problem of efficiently analysing large-scale CAS for quantitative properties and reviews algorithms to automatically reduce the dimensionality of a CAS model preserving modeller-defined state variables, with focus on descriptions based on systems of ordinary differential equations.
Exact Fluid Lumpability for Markovian Process Algebra
We study behavioural relations for process algebra with a fluid semantics given in terms of a system of ordinary differential equations (ODEs). We introduce label equivalence, a relation which is
Exact Stochastic Simulation of Coupled Chemical Reactions
There are two formalisms for mathematically describing the time behavior of a spatially homogeneous chemical system: The deterministic approach regards the time evolution as a continuous, wholly
FERN – a Java framework for stochastic simulation and evaluation of reaction networks
FERN (Framework for Evaluation of Reaction Networks), a Java framework for the efficient simulation of chemical reaction networks, is presented, which provides efficient and accurate state-of-the-art stochastic simulation algorithms for well-mixed chemical systems and a powerful observer system which makes it possible to track and control the simulation progress on every level.