Fair Refinement for Asynchronous Session Types

International audienceSession types are widely used as abstractions of asynchronous message passing systems. Refinement for such abstractions is crucial as it allows improvements of a given component without compromising its compatibility with the rest of the system. In the context of session types, the most general notion of refinement is the asynchronous session subtyping, which allows to anticipate message emissions but only under certain conditions. In particular, asynchronous session subtyping rules out candidates subtypes that occur naturally in communication protocols where, e.g., two parties simultaneously send each other a finite but unspecified amount of messages before removing them from their respective buffers. To address this shortcoming, we study fair compliance over asynchronous session types and fair refinement as the relation that preserves it. This allows us to propose a novel variant of session subtyping that leverages the notion of controllability from service contract theory and that is a sound characterisation of fair refinement. In addition, we show that both fair refinement and our novel subtyping are undecidable. We also present a sound algorithm, and its implementation, which deals with examples that feature potentially unbounded buffering

A Session Subtyping Tool

International audienceSession types are becoming popular and have been integrated in several mainstream programming languages. Nevertheless, while many programming languages consider asynchronous fifo channel communication, the notion of subtyping used in session type implementations is the one defined by Gay and Hole for synchronous communication. This might be because there are several notions of asynchronous session subtyping, these notions are usually undecidable, and only recently sound (but not complete) algorithmic characterizations for these subtypings have been proposed. But the fact that the definition of asynchronous session subtyping and the theory behind related algorithms are not easily accessible to non-experts may also prevent further integration. The aim of this paper, and of the tool presented therein, is to make the growing body of knowledge about asynchronous session subtyping more accessible, thus promoting its integration in practical applications of session types

Aerosol emission in professional singing of classical music

In this study, emission rates of aerosols emitted by professional singers were measured with a laser particle counter under cleanroom conditions. The emission rates during singing varied between 753 and 6093 particles/sec with a median of 1537 particles/sec. Emission rates for singing were compared with data for breathing and speaking. Significantly higher emission rates were found for singing. The emission enhancements between singing and speaking were between 4.0 and 99.5 with a median of 17.4, largely due to higher sound pressure levels when singing. Further, significant effects of vocal loudness were found, whereas there were no significant differences between the investigated voice classifications. The present study supports the efforts to improve the risk management in cases of possible aerogenic virus transmission, especially for choir singing

A sound algorithm for asynchronous session subtyping and its implementation

Session types, types for structuring communication between endpoints in concurrent systems, are recently being integrated into mainstream programming languages. In practice, a very important notion for dealing with such types is that of subtyping, since it allows for typing larger classes of systems, where a program has not precisely the expected behavior but a similar one. Unfortunately, recent work has shown that subtyping for session types in an asynchronous setting is undecidable. To cope with this negative result, the only approaches we are aware of either restrict the syntax of session types or limit communication (by considering forms of bounded asynchrony). Both approaches are too restrictive in practice, hence we proceed differently by presenting an algorithm for checking subtyping which is sound, but not complete (in some cases it terminates without returning a decisive verdict). The algorithm is based on a tree representation of the coinductive definition of asynchronous subtyping; this tree could be infinite, and the algorithm checks for the presence of finite witnesses of infinite successful subtrees. Furthermore, we provide a tool that implements our algorithm. We use this tool to test our algorithm on many examples that cannot be managed with the previous approaches, and to provide an empirical evaluation of the time and space cost of the algorithm

Aerosol emission of adolescents voices during speaking, singing and shouting

Since the outbreak of the COVID-19 pandemic, singing activities for children and young people have been strictly regulated with far-reaching consequences for music education in schools and ensemble and choir singing in some places. This is also due to the fact, that there has been no reliable data available on aerosol emissions from adolescents speaking, singing, and shouting. By utilizing a laser particle counter in cleanroom conditions we show, that adolescents emit fewer aerosol particles during singing than what has been known so far for adults. In our data, the emission rates ranged from 16 P/s to 267 P/s for speaking, 141 P/s to 1240 P/s for singing, and 683 P/s to 4332 P/s for shouting. The data advocate an adaptation of existing risk management strategies and rules of conduct for groups of singing adolescents, like gatherings in an educational context, e.g. singing lessons or choir rehearsals

Fair Refinement for Asynchronous Session Types

International audienceSession types are widely used as abstractions of asynchronous message passing systems. Refinement for such abstractions is crucial as it allows improvements of a given component without compromising its compatibility with the rest of the system. In the context of session types, the most general notion of refinement is the asynchronous session subtyping, which allows to anticipate message emissions but only under certain conditions. In particular, asynchronous session subtyping rules out candidates subtypes that occur naturally in communication protocols where, e.g., two parties simultaneously send each other a finite but unspecified amount of messages before removing them from their respective buffers. To address this shortcoming, we study fair compliance over asynchronous session types and fair refinement as the relation that preserves it. This allows us to propose a novel variant of session subtyping that leverages the notion of controllability from service contract theory and that is a sound characterisation of fair refinement. In addition, we show that both fair refinement and our novel subtyping are undecidable. We also present a sound algorithm, and its implementation, which deals with examples that feature potentially unbounded buffering

Undecidability of asynchronous session subtyping

Session types are used to describe communication protocols in distributed systems and, as usual in type theories, session subtyping characterizes substitutability of the communicating processes. We investigate the (un)decidability of subtyping for session types in asynchronously communicating systems. We first devise a core undecidable subtyping relation that is obtained by imposing limitations on the structure of types. Then, as a consequence of this initial undecidability result, we show that (differently from what stated or conjectured in the literature) the three notions of asynchronous subtyping defined so far for session types are all undecidable. Namely, we consider the asynchronous session subtyping by Mostrous and Yoshida for binary sessions, the relation by Chen et al. for binary sessions under the assumption that every message emitted is eventually consumed, and the one by Mostrous et al. for multiparty session types. Finally, by showing that two fragments of the core subtyping relation are decidable, we evince that further restrictions on the structure of types make our core subtyping relation decidable.Comment: 36 page

A Session Subtyping Tool

International audienceSession types are becoming popular and have been integrated in several mainstream programming languages. Nevertheless, while many programming languages consider asynchronous fifo channel communication, the notion of subtyping used in session type implementations is the one defined by Gay and Hole for synchronous communication. This might be because there are several notions of asynchronous session subtyping, these notions are usually undecidable, and only recently sound (but not complete) algorithmic characterizations for these subtypings have been proposed. But the fact that the definition of asynchronous session subtyping and the theory behind related algorithms are not easily accessible to non-experts may also prevent further integration. The aim of this paper, and of the tool presented therein, is to make the growing body of knowledge about asynchronous session subtyping more accessible, thus promoting its integration in practical applications of session types

Moisture-driven shift in the climate sensitivity of white spruce xylem anatomical traits is coupled to large-scale oscillation patterns across northern treeline in northwest North America

Tree growth at northern treelines is generally temperature-limited due to cold and short growing seasons. However, temperature-induced drought stress was repeatedly reported for certain regions of the boreal forest in northwestern North America, provoked by a significant increase in temperature and possibly reinforced by a regime shift of the pacific decadal oscillation (PDO). The aim of this study is to better understand physiological growth reactions of white spruce, a dominant species of the North American boreal forest, to PDO regime shifts using quantitative wood anatomy and traditional tree-ring width (TRW) analysis. We investigated white spruce growth at latitudinal treeline across a >1,000\ua0km gradient in northwestern North America. Functionally important xylem anatomical traits (lumen area, cell-wall thickness, cell number) and TRW were correlated with the drought-sensitive standardized precipitation-evapotranspiration index of the growing season. Correlations were computed separately for complete phases of the PDO in the 20th century, representing alternating warm/dry (1925-1946), cool/wet (1947-1976) and again warm/dry (1977-1998) climate regimes. Xylem anatomical traits revealed water-limiting conditions in both warm/dry PDO regimes, while no or spatially contrasting associations were found for the cool/wet regime, indicating a moisture-driven shift in growth-limiting factors between PDO periods. TRW reflected only the last shift of 1976/1977, suggesting different climate thresholds and a higher sensitivity to moisture availability of xylem anatomical traits compared to TRW. This high sensitivity of xylem anatomical traits permits to identify first signs of moisture-driven growth in treeline white spruce at an early stage, suggesting quantitative wood anatomy being a powerful tool to study climate change effects in the northwestern North American treeline ecotone. Projected temperature increase might challenge growth performance of white spruce as a key component of the North American boreal forest biome in the future, when drier conditions are likely to occur with higher frequency and intensity