Algebra, Coalgebra, and Minimization in Polynomial Differential Equations

@inproceedings{Boreale2017AlgebraCA,
  title={Algebra, Coalgebra, and Minimization in Polynomial Differential Equations},
  author={Michele Boreale},
  booktitle={Foundations of Software Science and Computation Structure},
  year={2017}
}
  • Michele Boreale
  • Published in
    Foundations of Software…
    22 April 2017
  • Mathematics, Computer Science
We consider reasoning and minimization in systems of polynomial ordinary differential equations odes. The ring of multivariate polynomials is employed as a syntax for denoting system behaviours. We endow polynomials with a transition system structure based on the concept of Lie derivative, thus inducing a notion of [InlineEquation not available: see fulltext.]-bisimulation. Two states variables are proven [InlineEquation not available: see fulltext.]-bisimilar if and only if they correspond to… 

Figures from this paper

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

Algebra and coalgebra of stream products

This work introduces the class of (F,G)-products on streams, those where the stream derivative of a product can be expressed as a polynomial of the streams themselves and their derivatives, and shows how to obtain closed forms of algebraic generating functions of combinatorial sequences, as well as solutions of nonlinear ordinary differential equations.

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.

Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE'S

Algorithms for exact and approximate linear abstractions of polynomial continuous systems

This work gives necessary and sufficient syntactic conditions under which a full linear abstraction exists, that is one capable of representing the behaviour of the individual variables in the original system, and proposes an approximate linearization and dimension-reduction technique.

On the Coalgebra of Partial Differential Equations

A clean coinductive proof of existence and uniqueness of solutions of initial value problems for PDEs is obtained.

Guaranteed Error Bounds on Approximate Model Abstractions through Reachability Analysis

This paper introduces approximate differential equivalence as a more permissive variant of a recently developed exact counterpart, allowing ODE variables to be related even when they are governed by nearby derivatives.

Backward Invariance for Linear Differential Algebraic Equations

Backward invariance is presented, which relates DAE variables that have equal solutions at all time points (thus requiring them to start with equal initial conditions), and applied to the electrical engineering domain, showing that backward invariance can explain symmetries in certain networks as well as analyze DAEs which could not be originally treated due to their size.

Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective

This work uses a categorical framework to extend and relate model-comparison approaches based on structural and dynamical properties of a CRN to prove their equivalence, and provides an algorithm to compare CRNs, running linearly in time with respect to the cardinality of all possible comparisons.

Bisimulation and Coinduction Enhancements: A Historical Perspective

The origins and the developments of the topic are reviewed and techniques to make proofs shorter and simpler have become a research topic on its own.

References

SHOWING 1-10 OF 59 REFERENCES

A coalgebraic perspective on linear weighted automata

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.

Weighted Bisimulation in Linear Algebraic Form

It is shown that the largest bisimulation coincides with weighted language equivalence, can be computed by a geometrical version of partition refinement and that the corresponding quotient gives rise to the minimal weighted-language equivalence automaton.

Automatic invariant generation for hybrid systems using ideal fixed points

It is shown that the monotone operator on bounded degree pseudo ideals is convergent and generates fixed points that can be used to generate useful algebraic invariants for non-linear systems.

Algorithms for exact and approximate linear abstractions of polynomial continuous systems

This work gives necessary and sufficient syntactic conditions under which a full linear abstraction exists, that is one capable of representing the behaviour of the individual variables in the original system, and proposes an approximate linearization and dimension-reduction technique.

Polynomial approximations of the relational semantics of imperativeprograms

Non-linear loop invariant generation using Gröbner bases

A technique is demonstrated that encodes the conditions for a given template assertion being an invariant into a set of constraints, such that all the solutions to these constraints correspond to non-linear (algebraic) loop invariants of the program.

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

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.
...