Existence of weak solutions for the generalized Navier-Stokes equations with damping

In this work we consider the generalized Navier-Stokes equations with the presence of a damping term in the momentum equation. The problem studied here derives from the set of equations which govern isothermal flows of incompressible and homogeneous non-Newtonian fluids. For the generalized Navier-Stokes problem with damping, we prove the existence of weak solutions by using regularization techniques, the theory of monotone operators and compactness arguments together with the local decomposition of the pressure and the Lipschitz-truncation method. The existence result proved here holds for any and any sigma > 1, where q is the exponent of the diffusion term and sigma is the exponent which characterizes the damping term.MCTES, Portugal [SFRH/BSAB/1058/2010]; FCT, Portugal [PTDC/MAT/110613/2010]info:eu-repo/semantics/publishedVersio

Approximate probabilistic verification of hybrid systems

Hybrid systems whose mode dynamics are governed by non-linear ordinary differential equations (ODEs) are often a natural model for biological processes. However such models are difficult to analyze. To address this, we develop a probabilistic analysis method by approximating the mode transitions as stochastic events. We assume that the probability of making a mode transition is proportional to the measure of the set of pairs of time points and value states at which the mode transition is enabled. To ensure a sound mathematical basis, we impose a natural continuity property on the non-linear ODEs. We also assume that the states of the system are observed at discrete time points but that the mode transitions may take place at any time between two successive discrete time points. This leads to a discrete time Markov chain as a probabilistic approximation of the hybrid system. We then show that for BLTL (bounded linear time temporal logic) specifications the hybrid system meets a specification iff its Markov chain approximation meets the same specification with probability $1$. Based on this, we formulate a sequential hypothesis testing procedure for verifying -approximately- that the Markov chain meets a BLTL specification with high probability. Our case studies on cardiac cell dynamics and the circadian rhythm indicate that our scheme can be applied in a number of realistic settings

Hybrid modeling of biological networks: mixing temporal and qualitative biological properties

<p>Abstract</p> <p>Background</p> <p>Modeling a dynamical biological system is often a difficult task since the a <it>priori </it>unknown parameters of such models are not always directly given by the experiments. Despite the lack of experimental quantitative knowledge, one can see a dynamical biological system as (i) the combined evolution tendencies (increase or decrease) of the biological compound concentrations, and: (ii) the temporal features, such as delays between two concentration peaks (i.e. the times when one of the components completes an increase (resp. decrease) phase and starts a decrease (resp. increase) phase).</p> <p>Results</p> <p>We propose herein a new hybrid modeling framework that follows such biological assumptions. This hybrid approach deals with both a qualitative structure of the system and a quantitative structure. From a theoretical viewpoint, temporal specifications are expressed as equality or inequality constraints between delay parameters, while the qualitative specifications are expressed as an ordered pattern of the concentrations peaks of the components. Using this new hybrid framework, the temporal specifications of a biological system can be obtained from incomplete experimental data. The model may be processed by a hybrid model-checker (e.g. Phaver) which is able to give some new constraints on the delay parameters (e.g. the delay for a given transition is exactly 5 hours after the later peak of a gene product concentration). Furthermore, by using a constraint solver on the previous results, it becomes possible to get the set of parameters settings which are consistent with given specifications. Such a modeling approach is particularly accurate for modeling oscillatory biological behaviors like those observed in the Drosophila circadian cycles. The achieved results concerning the parameters of this oscillatory system formally confirm the several previous studies made by numerical simulations. Moreover, our analysis makes it possible to propose an automatic investigation of the respective impact of per and tim on the circadian cycle.</p> <p>Conclusions</p> <p>A new hybrid technique for an automatic formal analysis of biological systems is developed with a special emphasis on their oscillatory behaviors. It allows the use of incomplete and empirical biological data.</p

Application of uniform distribution to homogenization of a thin obstacle problem with p-Laplacian

In this paper we study the homogenization of p-Laplacian with thin obstacle in a perforated domain. The obstacle is defined on the intersection between a hyperplane and a periodic perforation. We construct the family of correctors for this problem and show that the solutions for the epsilon-problem converge to a solution of a minimization problem of similar form but with an extra term involving the mean capacity of the obstacle. The novelty of our approach is based on the employment of quasi-uniform convergence. As an application we obtain Poincare's inequality for perforated domains.QC 20140919. Updated from accepted to published.</p

LNCS

We address the problem of analyzing the reachable set of a polynomial nonlinear continuous system by over-approximating the flowpipe of its dynamics. The common approach to tackle this problem is to perform a numerical integration over a given time horizon based on Taylor expansion and interval arithmetic. However, this method results to be very conservative when there is a large difference in speed between trajectories as time progresses. In this paper, we propose to use combinations of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse box which is big enough to contain the segment is constructed using sampled simulation and then in the box we compute by linear programming a set of barrier functions (called barrier tube or BT for short) which work together to form a tube surrounding the flowpipe. The benefit of using PBT is that (1) BT is independent of time and hence can avoid being stretched and deformed by time; and (2) a small number of BTs can form a tight over-approximation for the flowpipe, which means that the computation required to decide whether the BTs intersect the unsafe set can be reduced significantly. We implemented a prototype called PBTS in C++. Experiments on some benchmark systems show that our approach is effective

Towards Efficient Exact Synthesis for Linear Hybrid Systems

We study the problem of automatically computing the controllable region of a Linear Hybrid Automaton, with respect to a safety objective. We describe the techniques that are needed to effectively and efficiently implement a recently-proposed solution procedure, based on polyhedral abstractions of the state space. Supporting experimental results are presented, based on an implementation of the proposed techniques on top of the tool PHAVer.Comment: In Proceedings GandALF 2011, arXiv:1106.081

Locally Optimal Reach Set Over-approximation for Nonlinear Systems

Safety verification of embedded systems modeled as hybrid systems can be scaled up by employing simulation-guided reach set over-approximation techniques. Existing methods are applicable only to restricted classes of systems, overly conservative, or computationally expensive. We present new techniques to compute a locally optimal bloating factor based on discrepancy functions, which allow construction of reach set over-approximations from simulation traces for general nonlinear systems. The discrepancy functions are critical for tools like C2E2 to verify bounded time safety properties for complex hybrid systems with nonlinear continuous dynamics. The new discrepancy function is computed using local bounds on a matrix measure under an optimal metric such that the exponential change rate of the discrepancy function is minimized. The new technique is less time consuming and less conservative than existing techniques and does not incur significant computational overhead. We demonstrate the effectiveness of our approach by comparing the performance of a prototype implementation with the state-of-the-art reachability analysis tool Flow*.National Science Foundation/CCF 1422798Ope