A Branching Time Model of CSP

I present a branching time model of CSP that is finer than all other models of CSP proposed thus far. It is obtained by taking a semantic equivalence from the linear time - branching time spectrum, namely divergence-preserving coupled similarity, and showing that it is a congruence for the operators of CSP. This equivalence belongs to the bisimulation family of semantic equivalences, in the sense that on transition systems without internal actions it coincides with strong bisimilarity. Nevertheless, enough of the equational laws of CSP remain to obtain a complete axiomatisation for closed, recursion-free terms.Comment: Dedicated to Bill Roscoe, on the occasion of his 60th birthda

Preserving Liveness Guarantees from Synchronous Communication to Asynchronous Unstructured Low-Level Languages

In the implementation of abstract synchronous communication in asynchronous unstructured low-level languages, e.g. using shared variables, the preservation of safety and especially liveness properties is a hitherto open problem due to inherently different abstraction levels. Our approach to overcome this problem is threefold: First, we present our notion of handshake refinement with which we formally prove the correctness of the implementation relation of a handshake protocol. Second, we verify the soundness of our handshake refinement, i.e., all safety and liveness properties are preserved to the lower level. Third, we apply our handshake refinement to show the correctness of all implementations that realize the abstract synchronous communication with the handshake protocol. To this end, we employ an exemplary language with asynchronous shared variable communication. Our approach is scalable and closes the verification gap between different abstraction levels of communication

On CSP and the Algebraic Theory of Effects

We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors or effect deconstructors; it also provides a link with functional programming, being a refinement of Moggi's seminal monadic point of view. There is a natural algebraic theory of the constructors whose free algebra functor is Moggi's monad; we illustrate this by characterising free and initial algebras in terms of two versions of the stable failures model of CSP, one more general than the other. Deconstructors are dealt with as homomorphisms to (possibly non-free) algebras. One can view CSP's action and choice operators as constructors and the rest, such as concealment and concurrency, as deconstructors. Carrying this programme out results in taking deterministic external choice as constructor rather than general external choice. However, binary deconstructors, such as the CSP concurrency operator, provide unresolved difficulties. We conclude by presenting a combination of CSP with Moggi's computational {\lambda}-calculus, in which the operators, including concurrency, are polymorphic. While the paper mainly concerns CSP, it ought to be possible to carry over similar ideas to other process calculi

Compositional nonblocking verification with always enabled events and selfloop-only events

This paper proposes to improve compositional nonblocking verification through the use of always enabled and selfloop-only events. Compositional verification involves abstraction to simplify parts of a system during verification. Normally, this abstraction is based on the set of events not used in the remainder of the system, i.e., in the part of the system not being simplified. Here, it is proposed to exploit more knowledge about the system and abstract events even though they are used in the remainder of the system. Abstraction rules from previous work are generalised, and experimental results demonstrate the applicability of the resulting algorithm to verify several industrial-scale discrete event system models, while achieving better state-space reduction than before

Biological control of Diamondback moth—Increased efficacy with mixtures of Beauveria fungi

Diamondback moth (DBM) is an important horticultural pest worldwide as the larvae of these moths feed on the leaves of cruciferous vegetables. As DBM has developed resistance to more than 100 classes of synthetic insecticides, new biological control options are urgently required. Beauveria species are entomopathogenic fungi recognized as the most important fungal genus for controlling a wide range of agricultural, forestry, and veterinary arthropod pests. Previous research, aimed at developing new Beauveria-based biopesticides for DBM, has focused on screening single isolates of Beauveria bassiana. However, these fungal isolates have individual requirements, which may limit their effectiveness in some environments. This current study separately assessed 14 Beauveria isolates, from a range of habitats and aligned to four different species (Beauveria bassiana, B. caledonica, B. malawiensis, and B. pseudobassiana), to determine the most effective isolate for the control of DBM. Further assays then assessed whether selected combinations of these fungal isolates could increase the overall efficacy against DBM. Six Beauveria isolates (three B. bassiana and three B. pseudobassiana) achieved high DBM mortality at a low application rate with the first documented report of B. pseudobassiana able to kill 100% of DBM larvae. Further research determined that applications of low-virulent Beauveria isolates improved the control of DBM compared to mixtures containing high-virulent isolates. This novel approach increased the DBM pest mortality and shortened the time to kill

You are what you eat: Fungal metabolites and host plant affect the susceptibility of diamondback moth to entomopathogenic fungi

Background: Beauveria are entomopathogenic fungi of a broad range of arthropod pests. Many strains of Beauveria have been developed and marketed as biopesticides. Beauveria species are well-suited as the active ingredient within biopesticides because of their ease of mass production, ability to kill a wide range of pest species, consistency in different conditions, and safety with respect to human health. However, the efficacy of these biopesticides can be variable under field conditions. Two under-researched areas, which may limit the deployment of Beauveria-based biopesticides, are the type and amount of insecticidal compounds produced by these fungi and the influence of diet on the susceptibility of specific insect pests to these entomopathogens. Methods: To understand and remedy this weakness, we investigated the effect of insect diet and Beauveria-derived toxins on the susceptibility of diamondback moth larvae to Beauveria infection. Two New Zealand-derived fungal isolates, B. pseudobassiana I12 Damo and B. bassiana CTL20, previously identified with high virulence towards diamondback moth larvae, were selected for this study. Larvae of diamondback moth were fed on four different plant diets, based on different types of Brassicaceae, namely broccoli, cabbage, cauliflower, and radish, before their susceptibility to the two isolates of Beauveria was assessed. A second experiment assessed secondary metabolites produced from three genetically diverse isolates of Beauveria for their virulence towards diamondback moth larvae. Results: Diamondback moth larvae fed on broccoli were more susceptible to infection by B. pseudobassiana while larvae fed on radish were more susceptible to infection by B. bassiana. Furthermore, the supernatant from an isolate of B. pseudobassiana resulted in 55% and 65% mortality for half and full-strength culture filtrates, respectively, while the filtrates from two other Beauveria isolates, including a B. bassiana isolate, killed less than 50% of larvae. This study demonstrated different levels of susceptibility of the insects raised on different plant diets and the potential use of metabolites produced by Beauveria isolates in addition to their conidia

A mean field model for movement induced changes in the beta rhythm

In electrophysiological recordings of the brain, the transition from high amplitude to low amplitude signals are most likely caused by a change in the synchrony of underlying neuronal population firing patterns. Classic examples of such modulations are the strong stimulus-related oscillatory phenomena known as the movement related beta decrease (MRBD) and post-movement beta rebound (PMBR). A sharp decrease in neural oscillatory power is observed during movement (MRBD) followed by an increase above baseline on movement cessation (PMBR). MRBD and PMBR represent important neuroscientific phenomena which have been shown to have clinical relevance. Here, we present a parsimonious model for the dynamics of synchrony within a synaptically coupled spiking network that is able to replicate a human MEG power spectrogram showing the evolution from MRBD to PMBR. Importantly, the high-dimensional spiking model has an exact mean field description in terms of four ordinary differential equations that allows considerable insight to be obtained into the cause of the experimentally observed time-lag from movement termination to the onset of PMBR (~ 0.5 s), as well as the subsequent long duration of PMBR (~ 1-10 s). Our model represents the first to predict these commonly observed and robust phenomena and represents a key step in their understanding, in health and disease

Distributed Synthesis in Continuous Time

We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states is reached, or reached with at least a given probability. The flow of time is modelled explicitly based on continuous-time randomness, with two natural implications: First, the non-determinism stemming from interleaving disappears. Second, when we restrict to a subclass of non-urgent models, the quantitative value problem for two players can be solved in EXPTIME. Indeed, the explicit continuous time enables players to communicate their states by delaying synchronisation (which is unrestricted for non-urgent models). In general, the problems are undecidable already for two players in the quantitative case and three players in the qualitative case. The qualitative undecidability is shown by a reduction to decentralized POMDPs for which we provide the strongest (and rather surprising) undecidability result so far

Applications of Fair Testing

In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the specification and analysis of distributed systems. This pre-order combines some features of the standard testing pre-orders, viz. the possibility to refine a specification by the resolution of nondeterminism, with a powerful feature of standard observation congruence, viz. the fair abstraction from divergences. Moreover, it is a pre-congruence with respect to all standard process-algebraic combinators, thus allowing for the standard algebraic proof techniques by substitution and rewriting. In this paper we will demonstrate advantages of the fair testing pre-order by the application to a number of examples, including a scheduling problem, a version of the Alternating Bit-protocol, and fair communication channels