We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Büchi automata (BA) called Almost linear Büchi automata (ALBA). We provide effective translations between LIO and ALBA showing that the two formalisms are expressively equivalent. While standard translations of LTL into BA use some intermediate formalisms, the presented translation of LIO into ALBA is direc...

By a quasi-connected reductive group (a term of Labesse) over an arbitrary field we mean almost direct product connected semisimple and quasi-torus smooth multiplicative type). We show that linear algebraic is if only it isomorphic to normal subgroup group. compute the first Galois cohomology set $$H^1({\mathbb {R}},G)$$ G $${\mathbb {R}}$$ real numbers in terms certain action Weyl on fundament...

In this paper we discuss the nonlinear control of a novel biped robot with three-degrees-of-freedom and two control inputs, whose dynamics are linear apart from the gravitational torque and the impact equations. We show that the equations of motion are locally feedback linearizable by nonlinear change of coordinates and nonlinear feedback in a region that includes all walking gates of interest....

Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from general LSSS. In this paper, we propose the new concept of 3-multiplicative LSSS, and establish its relationship with strongly multiplicat...

We prove that a stochastic flow of reflected Brownian motions in a smooth multidimensional domain is differentiable with respect to its initial position. The derivative is a linear map represented by a multiplicative functional for reflected Brownian motion. The method of proof is based on excursion theory and analysis of the deterministic Skorokhod equation.

The aim of this paper is to show that under some mild conditions a functional equation of multiplicative $(alpha,beta)$-derivation is superstable on standard operator algebras. Furthermore, we prove that this generalized derivation can be a continuous and an inner $(alpha,beta)$-derivation.

The linear multiplicative programming problem minimizes a product of two (positive) variables subject to linear inequality constraints. In this paper, we show NP-hardness of linear multiplicative programming problems and related problems.