The paper contains an evaluation of the modeling multi-agent systems methods in the context of discrete event dynamic systems in technical and industrial settings. Also the ease of implementing solutions of common types of dynamic discrete models in Erlang language is considered and is showing that programming in Erlang / OTP is more suitable for multi-agent systems design compared to other pla...

Deteministic finit state (DFA) automata have emerged as an effective tools for agent modeling applications. The problem of automata learning is to determine a DFA from a series of observation and has recently been studied extensively and a number of algorithms has been proposed. These algorithms can be divided into groups : supervised and unsupervised . In supervised algorithms, we have access ...

nowadays, textile and woven fabric composites are taken into consideration forapplications in high mechanical properties and every in-plane direction. however, developments inmodelling and characterisation of the fabric reinforced composite materials are considered more inthe effects of element types used in the mesh generation of the crack tip. the type of elementselected for the crack tip, a ...

Fixed-point logic with rank (FPR) is an extension of fixed-point counting (FPC) operators for computing the a matrix over finit field. The expressive power FPR properly extends that FPC and contained in P, but it not known if containment proper. We give circuit characterization terms families symmetric circuits gates, along lines given by Anderson Dawar 2017. This requires development broad fra...

A bstract. T he periodic behavior of a particu lar class of dynamical sys tems , the cellular automata (CA) , is studied . A lar ge class of CAs is defined , (containing both addit ive and nonadditive CAs) in terms of the sensi tivity of t he local rule on which the CA is based . For this class , the set of configurations which ente r a cycle afte r a finit e number of it erat ions is complete ...

In this study the structure for O-minimal expansions of groups is considered Let be an o-minimal expansion of an ordered group (R,0,1,+,<) with distinguished positive element 1. We first prove that the following are equivalent: (1) is semibounded, (2) has no poles, (3) cannot define a real closed field with domain R and order <, (4) is eventually linear and (5) every –definable set is a finit u...