Concurrent strategies based on event structures are examined from the viewpoint of may and must testing in traditional process calculi. In their pure form concurrent strategies fail to expose the deadlocks and divergences that can arise in their comp
osition. This motivates an extension of the bicategory of concurrent strategies to treat the may and must behaviour of strategies under testing. One extension adjoins neutral moves to strategies but in so doing loses identities w.r.t. composition. This in turn motivates another extension in which concurrent strategies are accompanied by stopping configurations; the ensuing stopping strategies inherit the structure of a bicategory from that of strategies. The technical developments converge in providing characterisations of the may and must equivalences and preorders on strategies.
The Cholesky factorization of the moment matrix is considered for the generalized Charlier, generalized Meixner and generalized Hahn of type I discrete orthogonal polynomials. For the generalized Charlier we present an alternative derivation of the L
aguerre-Freud relations found by Smet and Van Assche. Third order and second order order nonlinear ordinary differential equations are found for the recursion coefficient $gamma_n$. Laguerre-Freud relations are also found for the generalized Meixner case, which are compared with those of Smet and Van Assche. Finally, the generalized Hahn of type I discrete orthogonal polynomials are studied as well, and Laguerre-Freud equations are found and the differences with the equations found by Dominici and by Filipuk and Van Assche are given.
The Cholesky factorization of the moment matrix is applied to discrete orthogonal polynomials on the homogeneous lattice. In particular, semiclassical discrete orthogonal polynomials, which are built in terms of a discrete Pearson equation, are studi
ed. The Laguerre-Freud structure semi-infinite matrix that models the shifts by $pm 1$ in the independent variable of the set of orthogonal polynomials is introduced. In the semiclassical case it is proven that this Laguerre-Freud matrix is banded. From the well known fact that moments of the semiclassical weights are logarithmic derivatives of generalized hypergeometric functions, it is shown how the contiguous relations for these hypergeometric functions translate as symmetries for the corresponding moment matrix. It is found that the 3D Nijhoff-Capel discrete Toda lattice describes the corresponding contiguous shifts for the squared norms of the orthogonal polynomials. The continuous Toda for these semiclassical discrete orthogonal polynomials is discussed and the compatibility equations are derived. It also shown that the Kadomtesev-Petvishvilii equation is connected to an adequate deformed semiclassical discrete weight, but in this case the deformation do not satisfy a Pearson equation.
It has been known that the Schwarzschild-de Sitter (Sch-dS) black hole may not be in thermal equilibrium and also be found to be thermodynamically unstable in the standard black hole thermodynamics. In the present work, we investigate the possibility
to realize the thermodynamical stability of the Sch-dS black hole as an effective system by using the R{e}nyi statistics, which includes the non-extensive nature of black holes. Our results indicate that the non-extensivity allows the black hole to be thermodynamically stable which gives rise to the lower bound on the non-extensive parameter. By comparing the results to ones in the separated system approach, we find that the effective temperature is always smaller than the black hole horizon temperature and the thermodynamically stable black hole in effective approach is always larger than one in separated approach at a certain temperature. There exists only the zeroth-order phase transition from the the hot gas phase to the black hole phase for the effective system while it is possible to have the transition of both the zeroth order and the first order for the separated system.
Recently, it has been found that, with the Renyi statistics, the asymptotically flat Schwarzschild black hole can be in thermal equilibrium with infinite heat reservior at a fixed temperature when its event horizon radius is larger than the character
istic length scale $L_lambda=1/sqrt{pi lambda}$, where $lambda$ is the nonextensivity parameter. In the Renyi extended phase space with the $PdV$ work term, an off-shell free energy in the canonical ensemble with the thermodynamic volume as an order parameter is considered to identify a first-order Hawking-Page (HP) phase transition as a solid/liquid phase transition. It has the latent heat of fusion from solid (corresponding to thermal radiation) to liquid (corresponding to black hole) in the form of $sim 1/sqrt{lambda}$; this is evident of the absence of the HP phase transition in the case of asymptotically flat Schwarzschild black hole from the GB statistics ($lambda=0$). Moreover, we investigate the generalized second law of black hole thermodynamics (GSL) in Renyi statistics by considering the black hole as a working substance in heat engine. Interestingly, an efficiency $eta$ of the black hole in a Carnot cycle takes the form $eta_c=1-T_text{C}/T_text{H}$. This confirms the validity of the GSL in the Renyi extended phase space.
Game semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a
variety of computational effects, in a single framework. This is known as the semantic cube or Abramskys cube, which for sequential deterministic programs establishes a correspondence between certain conditions on strategies (innocence, well-bracketing, visibility) and the absence of matching computational effects. Outside of the sequential deterministic realm, there are still a wealth of game semantics-based full abstraction results; but they no longer fit in a unified canvas. In particular, Ghica and Murawskis fully abstract model for shared state concurrency (IA) does not have a matching notion of pure parallel program-we say that parallelism and interference (i.e. state plus semaphores) are entangled. In this paper we construct a causal version of Ghica and Murawskis model, also fully abstract for IA. We provide compositional conditions parallel innocence and sequentiality, respectively banning interference and parallelism, and leading to four full abstraction results. To our knowledge, this is the first extension of Abramskys semantic cube programme beyond the sequential deterministic world.
The iterative conditional branchings appear in various sensitive algorithms, like the modular exponentiation in the RSA cryptosystem or the scalar multiplication in ellipticcurve cryptography. In this paper, we abstract away the desirable security pr
operties achieved by the Montgomery ladder, and formalize systems of equations necessary to obtain what we call the semi-interleaved and fully-interleaved ladder properties. This fruitful approach allows us to design novel fault-injection attacks, able to obtain some/all bits of the secret against different ladders, including the common Montgomery ladder. We also demonstrate the generality of our approach by applying the ladder equations to the modular exponentiation and the scalar multiplication, both in the semi-and fully-interleaved cases, thus proposing novel and more secure algorithms.
Control of surface functionalization of MXenes holds great potential, and in particular, may lead to tuning of magnetic and electronic order in the recently reported magnetic Cr2TiC2Tx. Here, vacuum annealing experiments of Cr2TiC2Tx are reported wit
h in situ electron energy loss spectroscopy and novel in situ Cr K-edge extended energy loss fine structure analysis, which directly tracks the evolution of the MXene surface coordination environment. These in situ probes are accompanied by benchmarking synchrotron X-ray absorption fine structure measurements and density functional theory calculations. With the etching method used here, the MXene has an initial termination chemistry of Cr2TiC2O1.3F0.8. Annealing to 600 C results in the complete loss of -F, but -O termination is thermally stable up to (at least) 700 C. These findings demonstrate thermal control of -F termination in Cr2TiC2Tx and offer a first step towards termination engineering this MXene for magnetic applications. Moreover, this work demonstrates high energy electron spectroscopy as a powerful approach for surface characterization in 2D materials.
Mass surveillance of the population by state agencies and corporate parties is now a well-known fact. Journalists and whistle-blowers still lack means to circumvent global spying for the sake of their investigations. With Spores, we propose a way for
journalists and their sources to plan a posteriori file exchanges when they physically meet. We leverage on the multiplication of personal devices per capita to provide a lightweight, robust and fully anonymous decentralised file transfer protocol between users. Spores hinges on our novel concept of e-squads: ones personal devices, rendered intelligent by gossip communication protocols, can provide private and dependable services to their user. Peoples e-squads are federated into a novel onion routing network, able to withstand the inherent unreliability of personal appliances while providing reliable routing. Spores performances are competitive, and its privacy properties of the communication outperform state of the art onion routing strategies.
It has recently been shown that, contrarily to a common belief, money transfer in the presence of faulty (Byzantine) processes does not require strong agreement such as consensus. This article goes one step further: namely, it first proposes a non-se
quential specification of the money-transfer object, and then presents a generic algorithm based on a simple FIFO order between each pair of processes that implements it. The genericity dimension lies in the underlying reliable broadcast abstraction which must be suited to the appropriate failure model. Interestingly, whatever the failure model, the money transfer algorithm only requires adding a single sequence number to its messages as control information. Moreover, as a side effect of the proposed algorithm, it follows that money transfer is a weaker problem than the construction of a safe/regular/atomic read/write register in the asynchronous message-passing crash-prone model.
