Water temperature modeling in the Garonne River (France)

Stream water temperature is one of the most important parameters for water quality and ecosystem studies. Temperature can influence many chemical and biological processes and therefore impacts on the living conditions and distribution of aquatic ecosystems. Simplified models such as statistical models can be very useful for practitioners and water resource management. The present study assessed two statistical models – an equilibrium-based model and stochastic autoregressive model with exogenous inputs – in modeling daily mean water temperatures in the Garonne River from 1988 to 2005. The equilibrium temperature-based model is an approach where net heat flux at the water surface is expressed as a simpler form than in traditional deterministic models. The stochastic autoregressive model with exogenous inputs consists of decomposing the water temperature time series into a seasonal component and a short-term component (residual component). The seasonal component was modeled by Fourier series and residuals by a second-order autoregressive process (Markov chain) with use of short-term air temperatures as exogenous input. The models were calibrated using data of the first half of the period 1988–2005 and validated on the second half. Calibration of the models was done using temperatures above 20 ◦C only to ensure better prediction of high temperatures that are currently at stake for the aquatic conditions of the Garonne River, and particularly for freshwater migrating fishes such as Atlantic Salmon (Salmo salar L.). The results obtained for both approaches indicated that both models performed well with an average root mean square error for observed temperatures above 20 ◦C that varied on an annual basis from 0.55 ◦C to 1.72 ◦C on validation, and good predictions of temporal occurrences and durations of three temperature threshold crossings linked to the conditions of migration and survival of Atlantic Salmon

Ductile Damage Material Parameter Identification: Numerical Investigation

International audienceCalibration of damage parameters is an important issue for the use of damage laws, and particularly for industrial manufacturing processes. This paper deals with an adapted procedure to identify Lemaitre damage parameters using tensile tests. An adapted objective function is built, and Efficient Global Optimisation (EGO) algorithm is chosen to solve the minimisation problem. This procedure is investigated by constructing a landscape of the objective function. This global sensitivity analysis enables to compare different solutions. The sensitivity analysis exhibits some pathological identification issues: multiple extrema and weak gradient. This sensitivity analysis shows some limitations of identification using load-displacement curves: In particularly the non-uniqueness of the set of parameters. The identification procedure is finally validated for an HSS S355MC steel material used in industrial joining application

Formal Methods for Systems Engineering Behavior Models

International audienceSafety analysis in Systems Engineering (SE) processes, as usually implemented, rarely relies on formal methods such as model checking since such techniques, however powerful and mature, are deemed too complex for efficient use. This paper thus aims at improving the verification practice in SE design: considering the widely-used model of EFFBDs (Enhanced Function Flow Block Diagrams), it formally establishes its syntax and behavioral semantics. It also proposes a structural translation of EFFBDs to transition time Petri nets (TPNs); this translation is then proved to preserve the behavioral semantics (i.e. timed bisimilarity). After proving results on the boundedness of the resulting TPNs, it was possible to extend a number of fundamental properties (such as the decidability of liveness, state-access, etc.) from bounded TPNs to so-called \emph{bounded EFFBDs}. Finally, these results led to implement and integrate an operational formal verification tool within a development platform, used in systems design for defense applications, where the underlying complexity is totally concealed from the end-us

On the compared expressiveness of arc, place and transition time Petri nets

International audienceIn this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (TPPN), arcs (TAPN) or transitions (TTPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are : (i) with strong semantics, TAPN is strictly more expressive than TPPN and TTPN ; (ii) with strong semantics TPPN and TTPN are incomparable ; (iii) TTPN with strong semantics and TTPN with weak semantics are incomparable. Moreover, we give a complete classification by a set of 9 relations explained in a figure

Numerical investigation of ductile damage parameters identification: benefit of local measurements

International audienceIdentification of material parameters is an important issue to improve the accuracy of finite element computations. Identification of these parameters by inverse analysis is based on experimental observables coming from mechanical experiments. In this paper, a simple tensile test is used. Two types of observables are investigated to identify ductile damage law parameters. The first one is a global measurement, such as the load-displacement curve. The second is a local observable based on full field measurements. Our approach, based on response surfaces, allows an efficient analysis of identification issues. Ill conditioned problems and multi-minima can be obtained using only a global observable. Full field measurements are a good way to improve the identification of plastic hardening and damage law parameters. In fact, local measurements combined with global ones, lead to a better formulation of the inverse problem

Structural Translation of Time Petri Nets into Timed Automata

International audienceIn this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like KRONOS or UPPAAL or CMC) to analyse TPNs

Formal Verification of Real-time Systems with Preemptive Scheduling

International audienceIn this paper, we propose a method for the verification of timed properties for real-time systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time Petri net, is first translated into a linear hybrid automaton to which it is time-bisimilar. Timed properties can then be verified using HyTech. The efficiency of this approach leans on two major points: first, the translation features a minimization of the number of variables (clocks) of the resulting automaton, which is a critical parameter for the efficiency of the ensuing verification. Second, the translation is performed by an over-approximating algorithm, which is based on Difference Bound Matrix and therefore efficient, that nonetheless produces a time-bisimilar automaton despite the over-approximation. The proposed modeling and verification method are generic enough to account for many scheduling policies. In this paper, we specifically show how to deal with Fixed Priority and Earliest Deadline First policies, with the possibility of using Round-Robin for tasks with the same priority. We have implemented the method and give some experimental results illustrating its efficiency

Structural translation from time petri nets to timed automata

International audienceIn this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioral semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical appli- cations of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analyzing timed automata (like Kronos, Uppaal or Cmc) to analyze TPNs. In this paper we describe the new feature of the tool Romeo that implements our translation of TPNs in the Uppaal input format. We also report on experiments carried out on various examples and compare the result of our method to state-of-the-art tool for analyzing TPNs