A New Linear Logic for Deadlock-Free Session-Typed Processes

The π -calculus, viewed as a core concurrent programming language, has been used as the target of much research on type systems for concurrency. In this paper we propose a new type system for deadlock-free session-typed π -calculus processes, by integrating two separate lines of work. The first is the propositions-as-types approach by Caires and Pfenning, which provides a linear logic foundation for session types and guarantees deadlock-freedom by forbidding cyclic process connections. The second is Kobayashi’s approach in which types are annotated with priorities so that the type system can check whether or not processes contain genuine cyclic dependencies between communication operations. We combine these two techniques for the first time, and define a new and more expressive variant of classical linear logic with a proof assignment that gives a session type system with Kobayashi-style priorities. This can be seen in three ways: (i) as a new linear logic in which cyclic structures can be derived and a CYCLE -elimination theorem generalises CUT -elimination; (ii) as a logically-based session type system, which is more expressive than Caires and Pfenning’s; (iii) as a logical foundation for Kobayashi’s system, bringing it into the sphere of the propositions-as-types paradigm

On the relative expressiveness of higher-order session processes

By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOπ, the higher-order π-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOπ which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. By exploring a new bisimulation for HO, we show that HO can encode HOπ fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session π-calculus (π). Overall, under session types, HOπ, HO, and π are equally expressive; however, HOπ and HO are more tightly related than HOπ and π

Imaging-guided chest biopsies: techniques and clinical results

Background This article aims to comprehensively describe indications, contraindications, technical aspects, diagnostic accuracy and complications of percutaneous lung biopsy. Methods Imaging-guided biopsy currently represents one of the predominant methods for obtaining tissue specimens in patients with lung nodules; in many cases treatment protocols are based on histological information; thus, biopsy is frequently performed, when technically feasible, or in case other techniques (such as bronchoscopy with lavage) are inconclusive. Results Although a coaxial system is suitable in any case, two categories of needles can be used: fine-needle aspiration biopsy (FNAB) and core-needle biopsy (CNB), with the latter demonstrated to have a slightly higher overall sensitivity, specificity and accuracy. Conclusion Percutaneous lung biopsy is a safe procedure even though a few complications are possible: pneumothorax, pulmonary haemorrhage and haemoptysis are common complications, while air embolism and seeding are rare, but potentially fatal complications

Distributed Supervisory Control of Discrete-Event Systems with Communication Delay

This paper identifies a property of delay-robustness in distributed supervisory control of discrete-event systems (DES) with communication delays. In previous work a distributed supervisory control problem has been investigated on the assumption that inter-agent communications take place with negligible delay. From an applications viewpoint it is desirable to relax this constraint and identify communicating distributed controllers which are delay-robust, namely logically equivalent to their delay-free counterparts. For this we introduce inter-agent channels modeled as 2-state automata, compute the overall system behavior, and present an effective computational test for delay-robustness. From the test it typically results that the given delay-free distributed control is delay-robust with respect to certain communicated events, but not for all, thus distinguishing events which are not delay-critical from those that are. The approach is illustrated by a workcell model with three communicating agents

Elemental spatial and temporal association formation in left temporal lobe epilepsy

The mesial temporal lobe (MTL) is typically understood as a memory structure in clinical settings, with the sine qua non of MTL damage in epilepsy being memory impairment. Recent models, however, understand memory as one of a number of higher cognitive functions that recruit the MTL through their reliance on more fundamental processes, such as “self-projection” or “association formation”. We examined how damage to the left MTL influences these fundamental processes through the encoding of elemental spatial and temporal associations. We used a novel fMRI task to image the encoding of simple visual stimuli, either rich or impoverished, in spatial or spatial plus temporal information. Participants included 14 typical adults (36.4 years, sd. 10.5 years) and 14 patients with left mesial temporal lobe damage as evidenced by a clinical diagnosis of left temporal lobe epilepsy (TLE) and left MTL impairment on imaging (34.3 years, sd. 6.6 years). In-scanner behavioral performance was equivalent across groups. In the typical group whole-brain analysis revealed highly significant bilateral parahippocampal activation (right > left) during spatial associative processing and left hippocampal/parahippocampal deactivation in joint spatial-temporal associative processing. In the left TLE group identical analyses indicated patients used MTL structures contralateral to the seizure focus differently and relied on extra-MTL regions to a greater extent. These results are consistent with the notion that epileptogenic MTL damage is followed by reorganization of networks underlying elemental associative processes. In addition, they provide further evidence that task-related fMRI deactivation can meaningfully index brain function. The implications of these findings for clinical and cognitive neuropsychological models of MTL function in TLE are discussed

Observed communication semantics for classical processes

Classical Linear Logic (CLL) has long inspired readings of its proofs as communicating processes. Wadler's CP calculus is one of these readings. Wadler gave CP an operational semantics by selecting a subset of the cut-elimination rules of CLL to use as reduction rules. This semantics has an appealing close connection to the logic, but does not resolve the status of the other cut-elimination rules, and does not admit an obvious notion of observational equivalence. We propose a new operational semantics for CP based on the idea of observing communication, and use this semantics to define an intuitively reasonable notion of observational equivalence. To reason about observational equivalence, we use the standard relational denotational semantics of CLL. We show that this denotational semantics is adequate for our operational semantics. This allows us to deduce that, for instance, all the cut-elimination rules of CLL are observational equivalences

Keep an eye on your hands: on the role of visual mechanisms in processing of haptic space

The present paper reviews research on a haptic orientation processing. Central is a task in which a test bar has to be set parallel to a reference bar at another location. Introducing a delay between inspecting the reference bar and setting the test bar leads to a surprising improvement. Moreover, offering visual background information also elevates performance. Interestingly, (congenitally) blind individuals do not or to a weaker extent show the improvement with time, while in parallel to this, they appear to benefit less from spatial imagery processing. Together this strongly points to an important role for visual processing mechanisms in the perception of haptic inputs

A hierarchical algorithm for predicting the linear viscoelastic properties of polymer melts with long-chain branching

The “hierarchical model” proposed earlier [Larson in Macromolecules 34:4556–4571, 2001] is herein modified by inclusion of early time fluctuations and other refinements drawn from the theories of Milner and McLeish for more quantitative prediction. The hierarchical model predictions are then compared with experimental linear viscoelastic data of well-defined long chain branched 1,4-polybutadienes and 1,4-polyisoprenes using a single set of parameter values for each polymer, which are obtained from experimental data for monodisperse linear and star polymers. For a wide range of monodisperse branched polymer melts, the predictions of the hierarchical model for monodisperse melts are very similar to those of the Milner–McLeish theories, and agree well with experimental data for many, but not all, of the branched polymer samples. Since the modified hierarchical model accounts for arbitrary polydispersity in molecular weight and branching distributions, which is not accounted for in the Milner–McLeish theories, the hierarchical algorithm is a promising one for predicting the relaxation of general mixtures of branched polymers.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47217/1/397_2004_Article_415.pd