design of crystal-like lattices can be achieved by using some net operations. hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. the networks herein presented are related to the dyck graph and described in terms of omega polynomial and piv polynomials.

We present a symbolic approach to the calculation of siphons and traps for algebraic Petri nets where the color domains are speci ed without equations and with at most unary operation symbols

There are many natural forcing notions adding real numbers, most notably the precursors of this class of forcing notions, namely Cohen and Random forcing. Whereas Random forcing has been deliberately constructed in connection with the σ–algebra of Lebesgue measurable sets and Cohen forcing is represented by the algebra of Borel sets modulo the σ–ideal of meager sets, the other classical forcing...

Time Petri nets by Merlin and Farber are a powerful modelling formalism. However, symbolic model checking methods for them consider in most cases the nets which are 1-safe, i.e., allow the places to contain at most one token. In our paper we present a preliminary version of the approach aimed at testing reachability for time Petri nets without this restriction. We deal with the class of bounded...

In this paper a nonparametric neural network (NN) technique for prediction of future values of a signal based on its past history is presented. This approach bypasses modeling, identification, and parameter estimation phases that are required by conventional parametric techniques. A multi-layer feed forward NN is employed. It develops an internal model of the signal through a training operation...

In this paper, the Ness-Helleseth functions over Fpn defined by the form f(x) = ux pn−1 2 −1 + x n −2 are proven to be a new class of almost perfect nonlinear (APN) functions and they are CCZ-inequivalent with all other known APN functions when p ≥ 7. The original method of Ness and Helleseth showing the functions are APN for p = 3 and odd n ≥ 3 is also suitable for showing their APN property f...