An Intensional Concurrent Faithful Encoding of Turing Machines

The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary computation. However, these encodings are usually by simulating the entire Turing Machine within the language, or by encoding a language that does an encoding or simulation itself. This second category is typical for process calculi that show an encoding of lambda-calculus (often with restrictions) that in turn simulates a Turing Machine. Such approaches lead to indirect encodings of Turing Machines that are complex, unclear, and only weakly equivalent after computation. This paper presents an approach to encoding Turing Machines into intensional process calculi that is faithful, reduction preserving, and structurally equivalent. The encoding is demonstrated in a simple asymmetric concurrent pattern calculus before generalised to simplify infinite terms, and to show encodings into Concurrent Pattern Calculus and Psi Calculi.Comment: In Proceedings ICE 2014, arXiv:1410.701

On the Expressiveness of Intensional Communication

The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality). Here pattern-matching is generalised to account for terms with internal structure such as in recent calculi like Spi calculi, Concurrent Pattern Calculus and Psi calculi. This paper explores intensionality upon terms, in particular communication primitives that can match upon both names and structures. By means of possibility/impossibility of encodings, this paper shows that intensionality alone can encode synchronism, arity, communication-medium, and pattern-matching, yet no combination of these without intensionality can encode any intensional language.Comment: In Proceedings EXPRESS/SOS 2014, arXiv:1408.127

On the Expressiveness of Joining

The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality vs intensionality). Here another dimension coordination is considered that accounts for the number of processes required for an interaction to occur. Coordination generalises binary languages such as pi-calculus to joining languages that combine inputs such as the Join Calculus and general rendezvous calculus. By means of possibility/impossibility of encodings, this paper shows coordination is unrelated to the other features. That is, joining languages are more expressive than binary languages, and no combination of the other features can encode a joining language into a binary language. Further, joining is not able to encode any of the other features unless they could be encoded otherwise.Comment: In Proceedings ICE 2015, arXiv:1508.04595. arXiv admin note: substantial text overlap with arXiv:1408.145

Expressiveness via Intensionality and Concurrency

International audienceComputation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the lambda-calculus. However, recent work shows that there are more expressive intensional calculi such as SF-calculus. Traditionally process calculi capture computation by encoding the lambda-calculus, such as in the pi-calculus. Following this increased expressiveness via intensionality, other recent work has shown that concurrent pattern calculus is more expressive than pi-calculus. This paper formalises the relative expressiveness of all four of these calculi by placing them on a square whose edges are irreversible encodings. This square is representative of a more general result: that expressiveness increases with both intensionality and concurrency

A Concurrent Pattern Calculus

International audienceConcurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. CPC provides a natural language to express trade where information exchange is pivotal to interaction. The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns. Many popular process calculi can be encoded in CPC; this allows for a gain in expressiveness, formalised through encodings

Surface flashover of oil-immersed dielectric materials in uniform and non-uniform fields

The applied electrical fields required to initiate surface flashover of different types of dielectric material immersed in insulating oil have been investigated, by applying impulses of increasing peak voltage until surface flashover occurred. The behavior of the materials in repeatedly over-volted gaps was also analyzed in terms of breakdown mode (some bulk sample breakdown behaviour was witnessed in this regime), time to breakdown, and breakdown voltage. Cylindrical samples of polypropylene, low-density polyethylene, ultra-high molecular weight polyethylene, and Rexolite, were held between two electrodes immersed in insulating oil, and subjected to average applied electrical fields up to 870 kV/cm. Tests were performed in both uniform- and non-uniform-fields, and with different sample topologies. In applied field measurements, polypropylene required the highest levels of average applied field to initiate flashover in all electrode configurations tested, settling at similar to 600 kV/cm in uniform fields, and similar to 325 kV/cm in non-uniform fields. In over-volted point-plane gaps, ultra-high molecular weight polyethylene exhibited the longest pre-breakdown delay times. The results will provide comparative data for system designers for the appropriate choice of dielectric materials to act as insulators for high-voltage, pulsed-power machines

The suitability of N2 to replace SF6 in a triggered spark-gap switch for pulsed power applications

The high dielectric strength of sulphur hexafluoride (SF6) when compared with other gases, coupled with safety benefits such as non-flammability and non-toxicity, has seen the widespread use of SF6 for the insulation of switching components. However, SF6 is now widely recognised as a highly damaging greenhouse gas, and investigations of the switching properties of alternative gases to replace SF6 within the bounds of existing system topologies are required. In the present paper, a comparative study has been carried out on a triggered spark-gap of type presently deployed in industrial pulsed-power machines, to determine the suitability of nitrogen (N2) to replace SF6 as the switching medium, without compromising on functionality. Experiments were performed with fast-rising trigger pulses to minimise the delay time to breakdown and jitter, and three distinct operational regimes have been identified for both gases as the pressure inside the switch is increased. The static breakdown characteristics and upper pressure boundaries of operation have been determined for both gases at a range of dc charging voltages. Measurements of the time to breakdown have shown jitters as low as 1.3 ns when operating in N2, highlighting the potential of N2 to replace SF6 without the need for re-design or replacement of the presently used switch

Impulse-driven surface breakdown data : a Weibull statistical analysis

Surface breakdown of oil-immersed solids chosen to insulate high-voltage, pulsed-power systems is a problem that can lead to catastrophic failure. Statistical analysis of the breakdown voltages, or times, associated with such liquid-solid interfaces can reveal useful information to aid system designers in the selection of solid materials. Described in this paper are the results of a Weibull statistical analysis, applied to both breakdown-voltage data and time-to-breakdown data generated in gaps consisting of five different solid polymers immersed in mineral oil. Values of the location parameter γ provide an estimate of the applied voltage below which breakdown will not occur, and under uniform-field conditions, γ varied from 192 kV (480 kV/cm) for polypropylene to zero for ultra-high molecular weight polyethylene. Longer times to breakdown were measured for UHMWPE when compared with the other materials. However, high values of the shape parameter β reported in the present paper suggest greater sensitivity to an increase in applied voltage – that is, the probability of breakdown increases more sharply with increasing applied voltage for UHMWPE compared to the other materials. Analysing peak-applied-voltage data, only PP consistently reflected a low value of β across the different sets of test conditions. In general, longer mean times to breakdown were found for solid materials of εr more closely matched to that of the surrounding mineral oi

Universal Optimality of Apollonian Cell Encoders

Preserving privacy of private communication against an attacker is a fundamental concern of computer science security. Unconditional encryption considers the case where an attacker has unlimited computational power, hence no complexity result can be relied upon for encryption. Optimality criteria are defined for the best possible encryption over a general collection of entropy measures. This paper introduces Apollonian cell encoders, a class of shared-key cryptosystems that are proven to be universally optimal. In addition to the highest possible security for the message, Apollonian cell encoders prove to have perfect secrecy on their key allowing unlimited key reuse. Conditions for the existence of Apollonian cell encoders are presented, as well as a constructive proof. Further, a compact representation of Apollonian cell encoders is presented, allowing for practical implementation

Attainable Unconditional Security for Shared-Key Cryptosystems

Preserving the privacy of private communication is a fundamental concern of computing addressed by encryption. Information-theoretic reasoning models unconditional security where the strength of the results does not depend on computational hardness or unproven results. Usually the information leaked on the message by the ciphertext is used to measure the privacy of a communication, with perfect secrecy when the leakage is zero. However this is hard to achieve in practice. An alternative measure is the equivocation, intuitively the average number of message/key pairs that could have produced a given ciphertext. We show a theoretical bound on equivocation called max-equivocation and show that this generalizes perfect secrecy when achievable, and provides an alternative measure when perfect secrecy is not. We derive bounds for max-equivocation for symmetric encoder functions and show that max-equivocation is achievable when the entropy of the ciphertext is minimized. We show that max-equivocation easily accounts for key re-use scenarios, and that large keys relative to the message perform very poorly under equivocation. We study encoders under this new perspective, deriving results on their achievable maximal equivocation and showing that some popular approaches such as Latin squares are not optimal. We show how unicity attacks can be naturally modeled, and how breaking encoder symmetry improves equivocation. We present some algorithms for generating encryption functions that are practical and achieve 90-95% of the theoretical best, improving with larger message spaces