Structural Refinement for the Modal nu-Calculus

We introduce a new notion of structural refinement, a sound abstraction of logical implication, for the modal nu-calculus. Using new translations between the modal nu-calculus and disjunctive modal transition systems, we show that these two specification formalisms are structurally equivalent. Using our translations, we also transfer the structural operations of composition and quotient from disjunctive modal transition systems to the modal nu-calculus. This shows that the modal nu-calculus supports composition and decomposition of specifications.Comment: Accepted at ICTAC 201

Numerical simulation of flow over barriers in complex terrain

This paper presents some of the results of numerical simulations of flow in the proximity of significant artificial terrain obstacles. The Mathematical model is based on Reynolds averaged Navier-Stokes equations for incompressible flows. Turbulent closure of the model is obtained by a simple algebraic turbulence model. The numerical solution is carried out by the semi-implicit finite-difference scheme. The results of simple tests are presented and summarized. Model sensitivity has been studied with respect to the simulated obstacle size and shape

Quantum Circuits for the Unitary Permutation Problem

We consider the Unitary Permutation problem which consists, given $n$ unitary gates $U_1, \ldots, U_n$ and a permutation $\sigma$ of $\{1,\ldots, n\}$, in applying the unitary gates in the order specified by $\sigma$, i.e. in performing $U_{\sigma(n)}\ldots U_{\sigma(1)}$. This problem has been introduced and investigated by Colnaghi et al. where two models of computations are considered. This first is the (standard) model of query complexity: the complexity measure is the number of calls to any of the unitary gates $U_i$ in a quantum circuit which solves the problem. The second model provides quantum switches and treats unitary transformations as inputs of second order. In that case the complexity measure is the number of quantum switches. In their paper, Colnaghi et al. have shown that the problem can be solved within $n^2$ calls in the query model and $\frac{n(n-1)}2$ quantum switches in the new model. We refine these results by proving that $n\log_2(n) +\Theta(n)$ quantum switches are necessary and sufficient to solve this problem, whereas $n^2-2n+4$ calls are sufficient to solve this problem in the standard quantum circuit model. We prove, with an additional assumption on the family of gates used in the circuits, that $n^2-o(n^{7/4+\epsilon})$ queries are required, for any $\epsilon >0$. The upper and lower bounds for the standard quantum circuit model are established by pointing out connections with the permutation as substring problem introduced by Karp.Comment: 8 pages, 5 figure

Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory

There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal or modal logics and relies on efficient model checking algorithms; the behavioural approach exploits various equivalence or refinement checking methods, provided the specifications are given in the same formalism as implementations. In this paper we provide translations between the logical formalism of Hennessy-Milner logic with greatest fixed points and the behavioural formalism of disjunctive modal transition systems. We also introduce a new operation of quotient for the above equivalent formalisms, which is adjoint to structural composition and allows synthesis of missing specifications from partial implementations. This is a substantial generalisation of the quotient for deterministic modal transition systems defined in earlier papers

LTL Parameter Synthesis of Parametric Timed Automata

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model checking of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique.Comment: 23 pages, extended versio

Eternal solutions to a singular diffusion equation with critical gradient absorption

The existence of nonnegative radially symmetric eternal solutions of exponential self-similar type $u(t,x)=e^{-p\beta t/(2-p)} f_\beta(|x|e^{-\beta t};\beta)$ is investigated for the singular diffusion equation with critical gradient absorption \begin{equation*} \partial_{t} u-\Delta_{p} u+|\nabla u|^{p/2}=0 \quad \;\;\hbox{in}\;\; (0,\infty)\times\real^N \end{equation*} where $2N/(N+1) < p < 2$. Such solutions are shown to exist only if the parameter $\beta$ ranges in a bounded interval $(0,\beta_*]$ which is in sharp contrast with well-known singular diffusion equations such as $\partial_{t}\phi-\Delta_{p} \phi=0$ when $p=2N/(N+1)$ or the porous medium equation $\partial_{t}\phi-\Delta\phi^m=0$ when $m=(N-2)/N$. Moreover, the profile $f(r;\beta)$ decays to zero as $r\to\infty$ in a faster way for $\beta=\beta_*$ than for $\beta\in (0,\beta_*)$ but the algebraic leading order is the same in both cases. In fact, for large $r$, $f(r;\beta_*)$ decays as $r^{-p/(2-p)}$ while $f(r;\beta)$ behaves as $(\log r)^{2/(2-p)} r^{-p/(2-p)}$ when $\beta\in (0,\beta_*)$

Vaporization behaviour of the Molten Salt Fast Reactor fuel: The LiF-ThF4-UF4 system

A selected composition of the initial fuel of the Molten Salt Fast Reactor (MSFR) is assessed by differential scanning calorimetry (DSC) for melting point determination and by Knudsen effusion mass spectrometry (KEMS) for vaporization behaviour. Partial vapour pressures and thermodynamic activities of the MSFR fuel mixture are discussed indicating departures from ideal behaviour, and further interpreted by phase equilibria calculations. The boiling point of the mixture is obtained extrapolating vapour pressure experimental results. New results on the vaporization behaviour of pure uranium tetrafluoride are presented, together with the ionization potentials of UF4 by electron impact

Synthesis of plutonium trifluoride by hydro-fluorination and novel thermodynamic data for the PuF3-LiF system

PuF3 was synthetized by hydro-fluorination of PuO2 and subsequent reduction of the product by hydrogenation. The obtained PuF3 was analysed by X-Ray Diffraction (XRD) and found phase-pure. High purity was also confirmed by the melting point analysis using Differential Scanning Calorimetry (DSC). PuF3 was then used for thermodynamic assessment of the PuF3-LiF system. Phase equilibrium points and enthalpy of fusion of the eutectic composition were measured by DSC. XRD analyses of selected samples after DSC measurement confirm that after solidification from the liquid, the system returns to a mixture of LiF and PuF3

Compositionality for Quantitative Specifications

We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations