A representation of discrete event dynamical systems

Discrete event dynamic systems (DEDS), are systems, which change state over time, based on current state and state transition rules. Each state is separated from its neighbour by a step rather than a continuum of infinitesimal states. This continuum in DEDS needs a representation between 0 and 1. The application of fuzzy logic in defining and modelling the DEDS is suggested as a possible solution because the nature of DEDS may be asynchronous, distributed, parallel, non-deterministic and/or stochastic. This results in the generalisation of crisp finite automata into fuzzy automata for a DEDS. In this paper, a DEDS in the form of hopper feed system is considered. The system is reformulated using state vectors and event transition matrices and is extended to fuzzy vectors and matrices. An algorithm is proposed for the final control action to be implemented using a programmable logic controller (PLC).

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently introduced the convolution distance between sheaves of $\mathbf {k}$ -vector spaces on M. In this paper, we characterize distances on the group of constructible functions on a real finite dimensional vector space that can be controlled by the convolution distance through the sheaf-function correspondence. Our main result asserts that such distances are almost trivial: they vanish as soon as two constructible functions have the same Euler integral. We formulate consequences of our result for Topological Data Analysis: there cannot exist nontrivial additive invariants of persistence modules that are continuous for the interleaving distance.

ABSTRACTIn this paper, the static output feedback stabilisation of discrete event dynamic systems (DEDSs) is investigated via the semi-tensor product (STP) of matrices. Firstly, the dynamics of DEDSs modelled by deterministic Moore-type finite automata are converted into an matrix expression in the STP frame. Secondly, necessary and sufficient conditions for the existence of a static output feedback control pattern, stabilising the controlled discrete event dynamic systems to some equilibrium point, are given, and constructive algorithms to seek the static output feedback control pattern including an effective specific solution algorithm and an analytic solution algorithm are proposed. Thirdly, the equilibrium-based static output feedback stabilisation of DEDSs is extended to the set-based static output feedback stabilisation and necessary and sufficient conditions and constructive algorithms to seek the corresponding control pattern are provided. Finally, some examples are presented to illustrate the effectiveness of the proposed approach.

Let D be a division ring with the center F and suppose that D* is the multiplicative group of D. D is called centrally finite if D is a finite dimensional vector space over F and D is locally centrally finite if every finite subset of D generates over F a division subring which is a finite dimensional vector space over F. We say that D is a linear division ring if every finite subset of D generates over Fa centrally finite division subring. It is obvious that every locally centrally finite division ring is linear. In this report we show that the inverse is not true by giving an example of a linear division ring which is not locally centrally finite. Further, we give some properties of subgroups in linear division rings. In particular, we show that every finitely generated subnormal subgroup in a linear ring is central. An interesting corollary is obtained as the following: If D is a linear division ring and D* is finitely generated, then D is a finite field.

Algebraic Characteristics and Structure Decomposition for “Linear” Discrete Event Dynamic Systems

Application of neustadt's theory of extremals to an optimal control problem with a functional differential equation and a functional inequality constraint

Proof.We will prove the first part by induction on t.When r=l, u=Uy.In addition, [uk] = [u]k = [u] so u is not nilpotent.Hence, the associative algebra of all polynomials in u, denoted by F[u], is not nilpotent and thus contains an idempotent e=f(u) for fix) a polynomial.Then [e] = [/(«)] = a[u] where a=f(l) is in F. Thus a[w] = [e] = [e]2 = c72[w]2 = c72[w].Since e is not in M, a[u]^0 and a=l.Let w = Uy + u2 for r^2.Then u=w+u3+ ■ ■ ■ +ut for pairwise orthogonal idempotents [w], [u3],..., [ut].By the inductive hypothesis, there exists an idempotent e and pairwise orthogonal idempotents/ e3,...,et in Ae(l) such that

Given a symmetric bilinear form F on a finite dimensional real vector space V we attempt to find ‘nice’ bases where the matrix representation of the form is as simple as possible, in the same sort of way as we did in the Gram-Schmidt orthogonalization process for inner products. The theorem which says that this is possible and which describes all the possible matrix representations one can get is called Sylvester’s law of inertia. (Sylvester’s law of inertia has nothing to do with inertia: the story goes that Sylvester said, ‘If Isaac Newton can have a law of inertia, then so can I’, and consequently gave this theorem the name it has been known by ever since.) This ‘law’ is exactly analogous to Theorem 2.33 which classified all finite dimensional vector spaces using dimension; it turns out that symmetric bilinear forms are classified by the dimension of the underlying vector space and two further numbers, called the rank and the signature of the form.

An affine algebraic group

Linear algebra is considered an essential mathematical theory that has many engineering applications. While many theorem provers support linear spaces, they only consider finite dimensional spaces. In addition, available libraries only deal with real vectors, whereas complex vectors are extremely useful in many fields of engineering. In this paper, we propose a new linear space formalization which covers both finite and infinite dimensional complex vector spaces, implemented in HOL-Light. We give the definition of a linear space and prove many properties about its operations, e.g., addition and scalar multiplication. We also formalize a number of related fundamental concepts such as linearity, hermitian operation, self-adjoint, and inner product space. Using the developed linear algebra library, we were able to implement basic definitions about quantum mechanics and use them to verify a quantum beam splitter, an optical device that has many applications in quantum computing.

Discrete event dynamic systems (DEDS) are prevalent in many areas of engineering, like manufacturing, maintenance, distributed computing, etc. Activities or discrete events in DEDS are generally large in numbers, highly parallel, distributed, and highly intertwined. Modeling DEDS systems are further complicated by the fact that the decisions to be made from the model may incorporate inference engines that uses advanced statistical analysis on massive data and may also include fuzzy decisions. This paper talks about development of a new tool for modeling and simulation of DEDS that can satisfy the characteristics mentioned above; the new tool is called General purpose Petri net Simulator (GPenSIM). This paper further presents a recent extension to the new tool, which is the real-time simulation capability.

The combination of algebraic structures and graphs was carried out by investigating thoroughly the relation among the algebraic structure and the graph theoretic properties. Moreover, it needs to explore algebraic structure. The results of the combination of algebraic structures and graphs have many applications in the fields of Internet modeling, coding, etc. For example, the famous Cayley graph was constructed from groups and widely used in network models. Das introduced the subspace inclusion graph on finite-dimensional vector space over a finite filed, and studied that the graph is bipartite and some special properties if the dimension of the vector space is 3. In this paper, this bipartite inclusion graph in the case of 3-dimensional is extended to more general dimensional bipartite inclusion graph. The diameter, girth, clique number, covering number, independence number and matching number are studied and the properties are shown, such as regular, planar and Eulerian. Moreover, the authors also introduce a new results about the structure and the number of 1-dimensional and n-1-dimensional subspaces on n-dimensional vector space.

The problem of determining whether two programs compute the same function is undecidable. We restrict the class of functions that a program can compute to be a finite dimensional vector space, enabling the problem to become tractable. We prove a theorem showing that the number of test points needed to distinguish any such programs is equal to the dimension of the vector space of functions which they compute, thus generalizing previous results of Howden. Our result unifies certain existing software testing theory and explains the successes and failures of one existing method for selecting test data called perturbation testing. We apply the theorem to obtain three results on the number of test points required to test in vector spaces of Boolean functions and polynomials. First, the Vandermonde matrix used together with our theorem yields the classical result that a polynomial of degree at most n is determined by n+1 points. Second, in vector spaces of Boolean functions we obtain useful results when the degree of the Boolean function is less than the number of inputs to the function. Third, we apply our theorem to describe a technique for testing nonpolynomial, real valued functions.

ALGEBRAIC CHARACTERISTICS AND STRUCTURE DECOMPOSITION FOR “LINEAR” DISCRETE EVENT DYNAMIC SYSTEMS

Gröbner Basis Methods for Multivariate Splines