Algebra, Coalgebra, and Minimization in Polynomial Differential Equations

DOI10.1007/978-3-662-54458-7_5zbMath1486.68109arXiv1710.08350OpenAlexW2613113977MaRDI QIDQ2988361

Michele Boreale

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.08350

zbMATH Keywords

Gröbner basesordinary differential equationspolynomialsminimizationbisimulationordinary differential euqtions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear ordinary differential equations and systems (34A34) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Derivations and commutative rings (13N15)

Related Items (10)

Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis ⋮ Formal lumping of polynomial differential equations through approximate equivalences ⋮ Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ A large-scale assessment of exact lumping of quantitative models in the biomodels repository ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Automatic pre- and postconditions for partial differential equations ⋮ Symbolic computation of differential equivalences ⋮ On the Coalgebra of Partial Differential Equations ⋮ Logical characterization of fluid equivalences

Uses Software

• Bio-PEPA
• BioNetGen
• ERODE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biochemical systems theory: a review
• A coalgebraic perspective on linear weighted automata
• Polynomial approximations of the relational semantics of imperative programs
• Differential dynamic logic for hybrid systems
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Bio-PEPA: A framework for the modelling and analysis of biological systems
• Computing polynomial program invariants
• Generating all polynomial invariants in simple loops
• On process rate semantics
• Automatic invariant generation for hybrid systems using ideal fixed points
• Logics of Dynamical Systems
• Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
• A Survey of Markovian Behavioral Equivalences
• Weighted Bisimulation in Linear Algebraic Form
• Analysis of Probabilistic Systems via Generating Functions and Padé Approximation
• Non-linear loop invariant generation using Gröbner bases
• Beyond Bisimulation: The “up-to” Techniques
• The Effect of Lumping and Expanding on Kinetic Differential Equations
• Algorithms for exact and approximate linear abstractions of polynomial continuous systems
• Comparing Chemical Reaction Networks
• Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases
• Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
• Forward and Backward Bisimulations for Chemical Reaction Networks
• Approximation of Large-Scale Dynamical Systems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Symbolic computation of differential equivalences
• Covarieties and complete covarieties

This page was built for publication: Algebra, Coalgebra, and Minimization in Polynomial Differential Equations