Combinational multiple-valued circuit design by generalised disjunctive decomposition

A design of multiple-valued circuits based on the multiple-valued programmable logic arrays (MV PLA’s) by generalized disjunctive decomposition is presented. Main subjects are 1) Generalized disjunctive decomposition of multiple-valued functions using multiple-terminal multiplevalued decision diagrams (MTMDD’s); 2) Realization of functions by MV PLA-based combinatorial circuits

Towards a General Theory of Stochastic Hybrid Systems

In this paper we set up a mathematical structure, called Markov string, to obtaining a very general class of models for stochastic hybrid systems. Markov Strings are, in fact, a class of Markov processes, obtained by a mixing mechanism of stochastic processes, introduced by Meyer. We prove that Markov strings are strong Markov processes with the cadlag property. We then show how a very general class of stochastic hybrid processes can be embedded in the framework of Markov strings. This class, which is referred to as the General Stochastic Hybrid Systems (GSHS), includes as special cases all the classes of stochastic hybrid processes, proposed in the literature

On the (non)removability of spectral parameters in Z2Z_2-graded zero-curvature representations and its applications

We generalise to the $\mathbb{Z}_2$-graded set-up a practical method for inspecting the (non)removability of parameters in zero-curvature representations for partial differential equations (PDEs) under the action of smooth families of gauge transformations. We illustrate the generation and elimination of parameters in the flat structures over $\mathbb{Z}_2$-graded PDEs by analysing the link between deformation of zero-curvature representations via infinitesimal gauge transformations and, on the other hand, propagation of linear coverings over PDEs using the Fr\"olicher--Nijenhuis bracket.Comment: 38 pages, accepted to Acta Appl. Mat