Input shaping control with reentry commands of prescribed duration

Control of flexible mechanical structures often deals with the problem of unwanted vibration. The input shaping is a feedforward method based on modification of the input signal so that the output performs the demanded behaviour. The presented approach is based on a finite-time Laplace transform. It leads to no-vibration control signal without any limitations on its time duration because it is not strictly connected to the system resonant frequency. This idea used for synthesis of control input is extended to design of dynamical shaper with reentry property that transform an arbitrary input signal to the signal that cause no vibration. All these theoretical tasks are supported by the results of simulation experiments

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

Sterile neutrinos in neutrinoless double beta decay

We study possible contribution of the Majorana neutrino mass eigenstate $\nu_h$ dominated by a sterile neutrino component to neutrinoless double beta ($0\nu\beta\beta$) decay. From the current experimental lower bound on the $0\nu\beta\beta$-decay half-life of $^{76}$Ge we derive stringent constraints on the $\nu_h-\nu_e$ mixing in a wide region of the values of $\nu_h$ mass. We discuss cosmological and astrophysical status of $\nu_h$ in this mass region.Comment: 6 pages, 1 figure; v2 added comments and reference

On Refinements of Boolean and Parametric Modal Transition Systems

We consider the extensions of modal transition systems (MTS), namely Boolean MTS and parametric MTS and we investigate the refinement problems over both classes. Firstly, we reduce the problem of modal refinement over both classes to a problem solvable by a QBF solver and provide experimental results showing our technique scales well. Secondly, we extend the algorithm for thorough refinement of MTS providing better complexity then via reductions to previously studied problems. Finally, we investigate the relationship between modal and thorough refinement on the two classes and show how the thorough refinement can be approximated by the modal refinement

Dynamical electroweak symmetry breaking due to strong Yukawa interactions

We present a new mechanism for electroweak symmetry breaking (EWSB) based on a strong Yukawa dynamics. We consider an SU(2)_L x U(1)_Y gauge invariant model endowed with the usual Standard model fermion multiplets and with two massive scalar doublets. We show that, unlike in the Standard model, EWSB is possible even with vanishing vacuum expectation values of the scalars. Such EWSB is achieved dynamically by means of the (presumably strong) Yukawa couplings and manifests itself by the emergence of fermion and gauge boson masses and scalar mass-splittings, which are expressed in a closed form in terms of the fermion and scalar proper self-energies. The `would-be' Nambu--Goldstone bosons are shown to be composites of both the fermions and the scalars. We demonstrate that the simplest version of the model is compatible with basic experimental constraints.Comment: 6 pages, REVTeX4, 3 eps figures; discussion of compatibility with EW precision data added; version published in J. Phys.

Relative Value Iteration for Stochastic Differential Games

We study zero-sum stochastic differential games with player dynamics governed by a nondegenerate controlled diffusion process. Under the assumption of uniform stability, we establish the existence of a solution to the Isaac's equation for the ergodic game and characterize the optimal stationary strategies. The data is not assumed to be bounded, nor do we assume geometric ergodicity. Thus our results extend previous work in the literature. We also study a relative value iteration scheme that takes the form of a parabolic Isaac's equation. Under the hypothesis of geometric ergodicity we show that the relative value iteration converges to the elliptic Isaac's equation as time goes to infinity. We use these results to establish convergence of the relative value iteration for risk-sensitive control problems under an asymptotic flatness assumption

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

Inverse dynamics approximation for controlling mechanisms with flexible elements

GA20-21893S - Mechatronic Tensegrities for energy efficient light robot