Disease control by sulphur induced resistance

As early as the 19th century, Justus von Liebig (1803 – 1873) identified the lack of vitality of soils and non-existent vigour of plants as relevant causes of increased infections of crops by fungal diseases. Organic farming requires alternative strategies for combating pests and diseases. Soil-applied sulphate fertilisation proved to significantly reduce infection rate and severity of crops by fungal diseases. The potential efficacy of socalled Sulphur Induced Resistance (SIR) expressed as a reduction of the disease index ranged from 5–50% and 17–35% in greenhouse and field experiments, respectively. Metabolic pathways involved in SIR imply, for instance, the synthesis of phytoalexins, glutathione, glucosinolates and the release of sulphur-containing volatiles

Structural Synthesis for GXW Specifications

We define the GXW fragment of linear temporal logic (LTL) as the basis for synthesizing embedded control software for safety-critical applications. Since GXW includes the use of a weak-until operator we are able to specify a number of diverse programmable logic control (PLC) problems, which we have compiled from industrial training sets. For GXW controller specifications, we develop a novel approach for synthesizing a set of synchronously communicating actor-based controllers. This synthesis algorithm proceeds by means of recursing over the structure of GXW specifications, and generates a set of dedicated and synchronously communicating sub-controllers according to the formula structure. In a subsequent step, 2QBF constraint solving identifies and tries to resolve potential conflicts between individual GXW specifications. This structural approach to GXW synthesis supports traceability between requirements and the generated control code as mandated by certification regimes for safety-critical software. Synthesis for GXW specifications is in PSPACE compared to 2EXPTIME-completeness of full-fledged LTL synthesis. Indeed our experimental results suggest that GXW synthesis scales well to industrial-sized control synthesis problems with 20 input and output ports and beyond.Comment: The long (including appendix) version being reviewed by CAV'16 program committee. Compared to the submitted version, one author (out of her wish) is moved to the Acknowledgement. (v2) Corrected typos. (v3) Add an additional remark over environment assumption and easy corner case

Teachers speak their minds about abortion during adolescence

Debates on abortion have escalated following the implementation in 1997 of the new law that legalises abortion from the age of twelve years in South Africa. Very often the person that opts for an abortion is merely an adolescent, who is still en route to adulthood. The adolescent's teacher shares the responsibility of the parent to accompany the adolescent to this procedure. The primary objective of the research was to determine from a socio-educational perspective what specific view teachers have of an abortion during adolescence. In order to achieve this, a qualitative method of research was used, with data being collected by means of focus-group interviews, through purposive sampling. The transcriptions were subjected to descriptive analysis. The findings of the research are presented and guidelines offered to teachers on more effectively accompanying the adolescent of our present-day society who plans to have an abortion or has had one. South African Journal of Education Vol.24(3) 2004: 177-18

Temporal Stream Logic: Synthesis beyond the Bools

Reactive systems that operate in environments with complex data, such as mobile apps or embedded controllers with many sensors, are difficult to synthesize. Synthesis tools usually fail for such systems because the state space resulting from the discretization of the data is too large. We introduce TSL, a new temporal logic that separates control and data. We provide a CEGAR-based synthesis approach for the construction of implementations that are guaranteed to satisfy a TSL specification for all possible instantiations of the data processing functions. TSL provides an attractive trade-off for synthesis. On the one hand, synthesis from TSL, unlike synthesis from standard temporal logics, is undecidable in general. On the other hand, however, synthesis from TSL is scalable, because it is independent of the complexity of the handled data. Among other benchmarks, we have successfully synthesized a music player Android app and a controller for an autonomous vehicle in the Open Race Car Simulator (TORCS.

Near-Optimal Scheduling for LTL with Future Discounting

We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the unit interval [0, 1]). The precise problem we study---it naturally arises e.g. in search for a scheduler that recovers from an internal error state as soon as possible---is the following: given a Kripke frame, a formula and a number in [0, 1] called a margin, find a path of the Kripke frame that is optimal with respect to the formula up to the prescribed margin (a truly optimal path may not exist). We present an algorithm for the problem; it works even in the extended setting with propositional quality operators, a setting where (threshold) model-checking is known to be undecidable

Synthesis of minimum-cost shields for multi-agent systems

In this paper, we propose a general approach to derive runtime enforcement implementations for multiagent systems, called shields, from temporal logical specifications. Each agent of the multi-agent system is monitored, and if needed corrected, by the shield, such that a global specification is always satisfied. The different ways of how a shield can interfere with each agent in the system in case of an error introduces the need for quantitative objectives. This work is the first to discuss the shield synthesis problem with quantitative objectives. We provide several cost functions that are utilized in the multi-agent setting and provide methods for the synthesis of cost-optimal shields and fair shields, under the given assumptions on the multi-agent system. We demonstrate the applicability of our approach via a detailed case study on UAV mission planning for warehouse logistics and simulating the shielded multi-agent system on ROS/Gazebo