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

Diffeomorphism-invariant properties for quasi-linear elliptic operators

For quasi-linear elliptic equations we detect relevant properties which remain invariant under the action of a suitable class of diffeomorphisms. This yields a connection between existence theories for equations with degenerate and non-degenerate coerciveness.Comment: 16 page

\epsilon-regularity for systems involving non-local, antisymmetric operators

We prove an epsilon-regularity theorem for critical and super-critical systems with a non-local antisymmetric operator on the right-hand side. These systems contain as special cases, Euler-Lagrange equations of conformally invariant variational functionals as Rivi\`ere treated them, and also Euler-Lagrange equations of fractional harmonic maps introduced by Da Lio-Rivi\`ere. In particular, the arguments presented here give new and uniform proofs of the regularity results by Rivi\`ere, Rivi\`ere-Struwe, Da-Lio-Rivi\`ere, and also the integrability results by Sharp-Topping and Sharp, not discriminating between the classical local, and the non-local situations

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

Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces

peer reviewedThis work is aimed at developing an efficient data structure for representing symbolically convex polyhedra. We introduce an original data structure, the Decomposed Convex Polyhedron (DCP), that is closed under intersection and linear transformations, and allows to check inclusion, equality, and emptiness. The main feature of DCPs lies in their ability to represent concisely polyhedra that can be expressed as combinations of simpler sets, which can overcome combinatorial explosion in high dimensional spaces. DCPs also have the advantage of being reducible into a canonical form, which makes them efficient for representing simple sets constructed by long sequences of manipulations, such as those handled by state-space exploration tools. Their practical efficiency has been evaluated with the help of a prototype implementation, with promising results

a direct encoding for nnc polyhedra

We present an alternative Double Description representation for the domain of NNC (not necessarily closed) polyhedra, together with the corresponding Chernikova-like conversion procedure. The representation uses no slack variable at all and provides a solution to a few technical issues caused by the encoding of an NNC polyhedron as a closed polyhedron in a higher dimension space. A preliminary experimental evaluation shows that the new conversion algorithm is able to achieve significant efficiency improvements

Automated Formal Synthesis of Digital Controllers for State-Space Physical Plants

We present a sound and automated approach to synthesize safe digital feedback controllers for physical plants represented as linear, time-invariant models. Models are given as dynamical equations with inputs, evolving over a continuous state space and accounting for errors due to the digitization of signals by the controller. Our counterexample guided inductive synthesis (CEGIS) approach has two phases: We synthesize a static feedback controller that stabilizes the system but that may not be safe for all initial conditions. Safety is then verified either via BMC or abstract acceleration; if the verification step fails, a counterexample is provided to the synthesis engine and the process iterates until a safe controller is obtained. We demonstrate the practical value of this approach by automatically synthesizing safe controllers for intricate physical plant models from the digital control literature

Utilizing Dependencies to Obtain Subsets of Reachable Sets

Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few. In many of these applications, one requires to compute a reachable set starting within a previously computed reachable set. While it was previously required to re-compute the entire reachable set, we demonstrate that one can leverage the dependencies of states within the previously computed set. As a result, we almost instantly obtain an over-approximative subset of a previously computed reachable set by evaluating analytical maps. The advantages of our novel method are demonstrated for falsification of systems, optimization over reachable sets, and synthesizing safe maneuver automata. In all of these applications, the computation time is reduced significantly

Bounded Model Checking for Parametric Timed Automata

Abstract. The paper shows how bounded model checking can be ap-plied to parameter synthesis for parametric timed automata with con-tinuous time. While it is known that the general problem is undecidable even for reachability, we show how to synthesize a part of the set of all the parameter valuations under which the given property holds in a model. The results form a complete theory which can be easily applied to parametric verification of a wide range of temporal formulae – we present such an implementation for the existential part of CTL −X. 1 Introduction and related work The growing abundance of complex systems in real world, and their presence in critical areas fuels the research in formal specification and analysis. One of the established methods in systems verification is model checking, where the system is abstracted into the algebraic model (e.g. various versions of Kripke structures