2019
DOI: 10.1007/978-3-030-17297-8_6
|View full text |Cite
|
Sign up to set email alerts
|

Set-Based Analysis for Biological Modeling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 84 publications
0
3
0
Order By: Relevance
“…We noticed a similar situation for the minimum. Our algorithm finds in 0.015 ms in only one subdivision step (ℎ = 1) the lower bound 0.976190 attained at (6,4,12,6) for the minimum of 𝑓 . Since this bound is attained at a vertex index, the vertex condition in Theorem 2 holds, and we know that we already have found the minimum of 𝑓 .…”
Section: Theoremmentioning
confidence: 90%
“…We noticed a similar situation for the minimum. Our algorithm finds in 0.015 ms in only one subdivision step (ℎ = 1) the lower bound 0.976190 attained at (6,4,12,6) for the minimum of 𝑓 . Since this bound is attained at a vertex index, the vertex condition in Theorem 2 holds, and we know that we already have found the minimum of 𝑓 .…”
Section: Theoremmentioning
confidence: 90%
“…Let p and q be bivariate polynomials of degree (4,2) and (3,2), respectively, with Bernstein matrices over u…”
Section: A Example For the Performance Of Algorithmmentioning
confidence: 99%
“…Signal Temporal Logic (STL [55,56]) has been introduced for specifying properties of dense-time real-valued signals. It is particularly suitable for monitoring both industrial case studies (e.g., see [47,46,23]) and biological systems (e.g., see [25,67,20]). It has also been used in the study of parametric systems (e.g., see [7,43]) where parametric disturbance rejection properties are formalized in STL and then verified.…”
Section: Introductionmentioning
confidence: 99%