Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
DOI10.1006/JSCO.1999.0353zbMATH Open0965.65137OpenAlexW2119763521WikidataQ29012983 ScholiaQ29012983MaRDI QIDQ1582300FDOQ1582300
Authors: M'hammed El Kahoui, Andreas Weber
Publication date: 6 February 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1999.0353
Recommendations
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- scientific article; zbMATH DE number 2144103
- Bounded analysis and decomposition for behavioural descriptions of components
- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
- From hierarchical BIP to Petri calculus
- On the Complexity of Quantifier Elimination: the Structural Approach
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Algorithms for verifying conditions under which Hopf bifurcation occurs in systems of ordinary differential equations
Hopf bifurcationquantifier eliminationsymbolic methodssymmetry methodsGroebner basis methodsHurwitz determinants criterionJava-based software architectureODEs with polynomial vector fields
Symbolic computation and algebraic computation (68W30) Computational methods for bifurcation problems in dynamical systems (37M20) Numerical bifurcation problems (65P30)
Cites Work
- Title not available (Why is that?)
- Deterministic Nonperiodic Flow
- Galois groups of second and third order linear differential equations
- Title not available (Why is that?)
- Partial cylindrical algebraic decomposition for quantifier elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perturbation methods, bifurcation theory and computer algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal solutions of differential equations
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Testing stability by quantifier elimination
- Title not available (Why is that?)
- Nonlinear control system design by quantifier elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Epidemiological models with varying population size and dose-dependent latent period
Cited In (21)
- Algorithmic methods for investigating equilibria in epidemic modeling
- Better answers to real questions
- Birational properties of the gap subresultant varieties
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Symbolic computation for the qualitative theory of differential equations
- Subresultants and locally nilpotent derivations.
- Analysis of Snapback Repellers Using Methods of Symbolic Computation
- Hopf bifurcations on invariant manifolds of a modified FitzHugh-Nagumo model
- Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
- Algebraic Analysis of Bifurcation and Limit Cycles for Biological Systems
- Algorithmic global criteria for excluding oscillations
- On the existence of Hopf bifurcations in the sequential and distributive double phosphorylation cycle
- Discovering polynomial Lyapunov functions for continuous dynamical systems
- Computing Hopf bifurcations in chemical reaction networks using reaction coordinates
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
- Stability analysis for discrete biological models using algebraic methods
- Hopf Bifurcations of Reaction Networks with Zero-One Stoichiometric Coefficients
- Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods
Uses Software
This page was built for publication: Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582300)