Parameter Synthesis for Markov Models: Covering the Parameter Space

S Junges, E Ábrahám, C Hensel, N Jansen… - arxiv preprint arxiv …, 2019 - arxiv.org
Markov chain analysis is a key technique in formal verification. A practical obstacle is that all
probabilities in Markov models need to be known. However, system quantities such as …

[HTML][HTML] Identifying the parametric occurrence of multiple steady states for some biological networks

R Bradford, JH Davenport, M England, H Errami… - Journal of Symbolic …, 2020 - Elsevier
We consider a problem from biological network analysis of determining regions in a
parameter space over which there are multiple steady states for positive real values of …

Algorithmic reduction of biological networks with multiple time scales

N Kruff, C Lüders, O Radulescu, T Sturm… - Mathematics in Computer …, 2021 - Springer
We present a symbolic algorithmic approach that allows to compute invariant manifolds and
corresponding reduced systems for differential equations modeling biological networks …

[PDF][PDF] Uncertainty intervals/regions for the stress intensity factors at crack tips under uncertain loading by using the ellipsoidal model and numerical integration

N Ioakimidis - 2021 - researchgate.net
Quantifier elimination constitutes an interesting computational approach in computer
algebra already successfully applied to several disciplines. Here we apply this approach to …

[PDF][PDF] Quantifier-elimination-based interval computations in beam problems studied by using the approximate methods of finite differences and of finite elements

N Ioakimidis - 2020 - researchgate.net
The rather recent interesting computational method of quantifier elimination already
implemented in four computer algebra systems has been already used in many problems of …

SMT-Solving Induction Proofs of Inequalities

AK Uncu, JH Davenport, M England - arxiv preprint arxiv:2307.16761, 2023 - arxiv.org
This paper accompanies a new dataset of non-linear real arithmetic problems for the SMT-
LIB benchmark collection. The problems come from an automated proof procedure of …

[PDF][PDF] Application of quantifier elimination to robust reliability under severe uncertainty conditions by using the info-gap decision theory (IGDT)

N Ioakimidis - 2021 - researchgate.net
Ben-Haim's info-gap (or information-gap) decision theory (IGDT) constitutes a very
interesting and popular method for the study of problems in engineering and in many other …

[PDF][PDF] Robust reliability under uncertainty conditions by using modified info-gap models with two to four horizons of uncertainty and quantifier elimination

N Ioakimidis - 2021 - researchgate.net
Quantifier elimination for real variables constitutes an interesting computational tool with
efficient implementations in some popular computer algebra systems and many applications …

[PDF][PDF] Quantifier elimination and quantifier-free formulae for universally–existentially (AE) quantified formulae in Ben-Haim's info-gap model of uncertainty

N Ioakimidis - 2021 - researchgate.net
The method of quantifier elimination with implementations in some computer algebra
systems already proved useful for the computation of both the robustness and the …

[PDF][PDF] Problems under uncertainty: quantifier elimination to universally–existentially (AE) quantified formulae related to two or more horizons of uncertainty

N Ioakimidis - 2022 - researchgate.net
Problems under uncertainty appear frequently in practical applications. Ben-Haim's IGDT
(info-gap decision theory) constitutes a very efficient method for the study of such problems …