Genetic Algorithms for Optimal Reactive Power Compensation of a Power System with Wind Generators based on Artificial Neural Networks

In this paper, we develop a method to maintain an acceptable voltages profile and minimization of active losses of a power system including wind generators in real time. These tasks are ensured by acting on capacitor and inductance benches implemented in the consuming nodes. To solve this problem, we minimize an objective function associated to active losses under constraints imposed on the voltages and the reactive productions of the various benches. The minimization procedure was realised by the use of genetic algorithms (GA). The major disadvantage of this technique is that it requires a significant computing time thus not making it possible to deal with the problem in real time. After a training phase, a neural model has the capacity to provide a good estimation of the voltages, the reactive productions and the losses for forecast curves of the load and the wind speed, in real time

A test generation framework for quiescent real-time systems

We present an extension of Tretmans theory and algorithm for test generation for input-output transition systems to real-time systems. Our treatment is based on an operational interpretation of the notion of quiescence in the context of real-time behaviour. This gives rise to a family of implementation relations parameterized by observation durations for quiescence. We define a nondeterministic (parameterized) test generation algorithm that generates test cases that are sound with respect to the corresponding implementation relation. Also, the test generation is exhaustive in the sense that for each non-conforming implementation a test case can be generated that detects the non-conformance

Bounded Determinization of Timed Automata with Silent Transitions

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.Comment: 25 page

Comparative analysis of traditional and modern apricot breeding programs: A case of study with Spanish and Tunisian apricot breeding germplasm

Traditional plant breeding is based on the observation of variation and the selection of the best phenotypes, whereas modern breeding is characterised by the use of controlled mating and the selection of descendants using molecular markers. In this work, a comparative analysis of genetic diversity in a traditional (Tunisian) and a modern (Spanish) apricot breeding programme was performed at the phenotypic and molecular level using simple sequence repeat (SSR) markers. Seven phenotypic traits were evaluated in 42 Tunisian apricot accessions and 30 genotypes from the Spanish apricot programme. In addition, 20 SSR markers previously described as linked to specific phenotypic traits were assayed. Results showed that modern breeding using controlled crosses increases the size of the fruit. The fruit weight average observed in the Tunisian cultivars was of 20.15 g. In the case of traditional Spanish cultivars the average weight was 47.12 g, whereas the average weight of the other progenitors from France, USA and South Africa was 72.85 g. Finally, in the new releases from the CEBAS-CSIC breeding programme, the average weight was 72.82 g. In addition, modern bred cultivars incorporate desirable traits such as self-compatibility and firmness. Cluster and structural analysis based on SSR data clearly differentiates the genotypes according to their geographic origin and pedigree. Finally, results showed an association between some alleles of PaCITA7 and UDP96003 SSR markers with apricot fruit weight, one allele of UDAp407 marker with fruit firmness and one allele of UDP98406 marker with fruit ripening

Model-Based Testing of Safety Critical Real-Time Control Logic Software

The paper presents the experience of the authors in model based testing of safety critical real-time control logic software. It describes specifics of the corresponding industrial settings and discusses technical details of usage of UniTESK model based testing technology in these settings. Finally, we discuss possible future directions of safety critical software development processes and a place of model based testing techniques in it.Comment: In Proceedings MBT 2012, arXiv:1202.582

Testing real-time systems using TINA

The paper presents a technique for model-based black-box conformance testing of real-time systems using the Time Petri Net Analyzer TINA. Such test suites are derived from a prioritized time Petri net composed of two concurrent sub-nets specifying respectively the expected behaviour of the system under test and its environment.We describe how the toolbox TINA has been extended to support automatic generation of time-optimal test suites. The result is optimal in the sense that the set of test cases in the test suite have the shortest possible accumulated time to be executed. Input/output conformance serves as the notion of implementation correctness, essentially timed trace inclusion taking environment assumptions into account. Test cases selection is based either on using manually formulated test purposes or automatically from various coverage criteria specifying structural criteria of the model to be fulfilled by the test suite. We discuss how test purposes and coverage criterion are specified in the linear temporal logic SE-LTL, derive test sequences, and assign verdicts

Grafting versus seed propagated apricot populations: two main gene pools in Tunisia evidenced by SSR markers and model-based Bayesian clustering

Apricot was introduced into the Mediterranean Basin from China and Asian mountains through the Middle-East and the Central Europe. Traditionally present in Tunisia, we were interested in accessing the origin of apricot species in the country, and in particular in the number and the location of its introductions. A set of 82 representative apricot accessions including 49 grafted cultivars and 33 seed propagated ‘Bargougs’ were genotyped using 24 microsatellite loci revealing a total of 135 alleles. The model-based Bayesian clustering analysis using both Structure and InStruct programs as well as the multivariate method revealed five distinct genetic clusters. The genetic differentiation among clusters showed that cluster 1, with only four cultivars, was the most differentiated from the four remaining genetic clusters, which constituted the largest part of the studied germplasm. According to their geographic origin, the five identified groups (north, centre, south, Gafsa oasis and other oases groups) enclosed a similar variation within group, with a low level of differentiation. Overall results highlighted the distinction of two apricot gene pools in Tunisia related to the different mode of propagation of the cultivars: grafted and seed propagated apricot, which enclosed a narrow genetic basis. Our findings support the assumption that grafting and seed propagated apricots shared the same origin

Testing finite state machines presenting stochastic time and timeouts

In this paper we define a formal framework to test implementations that can be represented by the class of finite state machines introduced in [10]. First, we introduce an appropriate notion of test. Next, we provide an algorithm to derive test suites from specifications such that the constructed test suites are sound and complete with respect to two of the conformance relations introduced in [10]. In fact, the current paper together with [10] constitute a complete formal theory to specify and test the class of systems covered by the before mentioned stochastic finite state machines

An implementation relation for cyclic systems with refusals and discrete time

This paper explores a particular type of model, a cyclic model, in which there are sequences of observable actions separated by discrete time intervals, introduces a novel implementation relation and studies some properties of this relation. Implementation relations formalise what it means for an unknown model of the system under test (SUT) to be a correct implementation of a specification. Many implementation relations are variants of the well known ioco implementation relation, and this includes several timed versions of ioco. It transpires that the timed variants of ioco are not suitable for cyclic models. Our implementation relation encapsulates the discrete nature of time in cyclic models and takes into account not only the actions that models can perform but also the ones that they can refuse at each point of time. We prove that our implementation relation is a conservative extension of trace containment and present two alternative characterisations