Synthesizing Finite-state Protocols from Scenarios and Requirements

Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite-state protocols using scenarios: we show that it is possible to automatically derive a distributed implementation from a set of scenarios augmented with a set of safety and liveness requirements, provided the given scenarios adequately \emph{cover} all the states of the desired implementation. We first derive incomplete state machines from the given scenarios, and then synthesis corresponds to completing the transition relation of individual processes so that the global product meets the specified requirements. This completion problem, in general, has the same complexity, PSPACE, as the verification problem, but unlike the verification problem, is NP-complete for a constant number of processes. We present two algorithms for solving the completion problem, one based on a heuristic search in the space of possible completions and one based on OBDD-based symbolic fixpoint computation. We evaluate the proposed methodology for protocol specification and the effectiveness of the synthesis algorithms using the classical alternating-bit protocol.Comment: This is the working draft of a paper currently in submission. (February 10, 2014

Effects of first aid training in the kindergarten - a pilot study

<p>Abstract</p> <p>Objective</p> <p>Children can be the only persons present in an emergency situation. Aim of the study was to evaluate the effects of a first aid course for 4-5-year-old kindergarten children given by a first aid instructor and kindergarten teachers.</p> <p>Methods</p> <p>A mixed methods approach using both quantitative and qualitative methods was used to investigate the effects of teaching first aid in the kindergarten in the present study. 10 kindergarten children at the age of 4-5 years were included in a pilot-study, 5 girls and 5 boys. Three of them were four years and seven were five years old. Two months after completion of the first aid course children were tested in a scenario where the children had to provide first aid to an unconscious victim after a cycle accident. The next seven months the children were followed by participant observation.</p> <p>Results</p> <p>The findings suggest that 4-5-year-old children are able to learn and apply basic first aid. Tested two months after course completion 70% of the children assessed consciousness correctly and knew the correct emergency telephone number; 60% showed correct assessment of breathing and 40% of the participants accomplished the other tasks (giving correct emergency call information, knowledge of correct recovery position, correct airway management) correctly. Many of the children showed their capabilities to do so in a first aid scenario although some participants showed fear of failure in the test scenario. In an informal group testing most of these children could perform first aid measures, too. Teaching first aid also lead to more active helping behaviour and increased empathy in the children.</p> <p>Conclusion</p> <p>Kindergarten children aged 4-5 years can learn basic fist aid. First aid training should start in the kindergarten.</p

Propositional Dynamic Logic for Message-Passing Systems

We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problem for CFMs and HMSCs turns out to be in PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with intersection, the semantics of a formula cannot be captured by a CFM anymore

Explicit connection actions in multiparty session types

This work extends asynchronous multiparty session types (MPST) with explicit connection actions to support protocols with op- tional and dynamic participants. The actions by which endpoints are connected and disconnected are a key element of real-world protocols that is not treated in existing MPST works. In addition, the use cases motivating explicit connections often require a more relaxed form of mul- tiparty choice: these extensions do not satisfy the conservative restric- tions used to ensure safety in standard syntactic MPST. Instead, we de- velop a modelling-based approach to validate MPST safety and progress for these enriched protocols. We present a toolchain implementation, for distributed programming based on our extended MPST in Java, and a core formalism, demonstrating the soundness of our approach. We discuss key implementation issues related to the proposed extensions: a practi- cal treatment of choice subtyping for MPST progress, and multiparty correlation of dynamic binary connections

Asynchronous Games over Tree Architectures

We consider the task of controlling in a distributed way a Zielonka asynchronous automaton. Every process of a controller has access to its causal past to determine the next set of actions it proposes to play. An action can be played only if every process controlling this action proposes to play it. We consider reachability objectives: every process should reach its set of final states. We show that this control problem is decidable for tree architectures, where every process can communicate with its parent, its children, and with the environment. The complexity of our algorithm is l-fold exponential with l being the height of the tree representing the architecture. We show that this is unavoidable by showing that even for three processes the problem is EXPTIME-complete, and that it is non-elementary in general

Towards Verifying Nonlinear Integer Arithmetic

We eliminate a key roadblock to efficient verification of nonlinear integer arithmetic using CDCL SAT solvers, by showing how to construct short resolution proofs for many properties of the most widely used multiplier circuits. Such short proofs were conjectured not to exist. More precisely, we give n^{O(1)} size regular resolution proofs for arbitrary degree 2 identities on array, diagonal, and Booth multipliers and quasipolynomial- n^{O(\log n)} size proofs for these identities on Wallace tree multipliers.Comment: Expanded and simplified with improved result

LiDAR for Atmosphere Research over Africa (LARA)

International audienceThis paper describes the LIDAR for atmosphere research over Africa and current initiatives being undertaken in South Africa. A mobile LIDAR system is being developed at the Council for Scientific and Industrial Research (CSIR) National Laser Centre (NLC), Pretoria (25°5 ′ S;28°2 ′ E), South Africa, for remote sensing the atmosphere. The initial results conclude that the system is capable of providing aerosol/cloud backscatter measurements for the height region from ground to 40 km with a 10 m vertical height resolution

The beginning of time? Evidence for catastrophic drought in Baringo in the early nineteenth century

New developments in the collection of palaeo-data over the past two decades have transformed our understanding of climate and environmental history in eastern Africa. This article utilises instrumental and proxy evidence of historical lake-level fluctuations from Baringo and Bogoria, along with other Rift Valley lakes, to document the timing and magnitude of hydroclimate variability at decadal to century time scales since 1750. These data allow us to construct a record of past climate variation not only for the Baringo basin proper, but also across a sizable portion of central and northern Kenya. This record is then set alongside historical evidence, from oral histories gathered amongst the peoples of northern Kenya and the Rift Valley and from contemporary observations recorded by travellers through the region, to offer a reinterpretation of human activity and its relationship to environmental history in the nineteenth century. The results reveal strong evidence of a catastrophic drought in the early nineteenth century, the effects of which radically alters our historical understanding of the character of settlement, mobility and identity within the Baringo–Bogoria basin

Extending Compositional Message Sequence Graphs

We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositional message sequence charts (ECMSCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs might be combined by means of choice and repetition towards (extended) compositional message sequence graphs. We show that - despite extended expressive power - model checking of monadic second-order logic (MSO) for this framework remains to be decidable. The key technique to achieve our results is to use an extended notion for linearizations