## 1 Introduction

Modern industrial systems (no matter, global, regional, national, transnational etc.) are complicated, distributed, strongly interconnected networks of local facilities, producing, transporting and utilizing various products and resources. That’s why, – first of all, of the mentioned strong interconnectivity and associated with it multiple chain effects, – these systems are often vulnerable to natural disasters in such a way, that the one only facility destruction may cause consequences far beyond area or place this facility is located. So one of the most actual, important and at the same time difficult problems of the modern system analysis is development of the widely available mathematical toolkits, models and computer technologies, which would be able to provide the decision makers from the government and corporate stuffs with comprehensive and precise prognostic information about such consequences – first of all, would be system, affected by natural disaster impact (NDI), vulnerable or sustainable to it.

Industrial system (IS) in general case contains technological base (various industrial complexes and devices) producing (manufacturing) various objects (cars, computers, buildings etc.) and utilizing various resources (materials, microchips etc.), necessary for this process (Fig. 1a). Natural disaster destroys some segments of the technological and resource bases, that’s why amounts of objects produced are decreasing (Fig. 1b).

By this we may formulate criterion for IS robustness/vulnerability assessment (Fig. 2).

If amounts of objects, produced by IS before and after natural disaster impact, are equal, then IS is sustainable to the NDI; otherwise it is vulnerable to the impact. In the last case there is also one more important “reverse” problem: what part of the work may be executed by vulnerable IS, which facilities are affected by NDI?

Let us consider formulated problems in more details.

As was said higher, IS include industrial (manufacturing) devices (complexes). Each such device may be represented as a “black box” *B* with *m* inputs and one output (Fig. 3). Every *i*-th input is marked by *a _{i}* – name of object (item, resource) type, – and

*n*– amount (volume, quantity) of this object. So

_{i}*n*

_{1}objects (of type)

*a*

_{1}, …,

*n*objects (of type)

_{m}*a*are required for one object (of type)

_{m}*a*manufacturing.

IS as a whole may be represented by *k* such “black boxes” *B*_{1}, …, *B _{k}* interconnected by the “logistical ring”

*L*, providing transport of objects, manufactured by devices, from their outputs to inputs of another devices, thus forming integrated manufacturing process (Fig. 4).

This process, however, is driven by orders, which sources are external systems or persons, consuming objects, produced by IS. Each order *q* in general case defines types and quantities of objects, which would be manufactured (*n̄*_{1} objects of type *ā*_{1}, …, *n̄ _{l}* objects of type

*ā*at Fig. 4). From the other side, IS itself consumes resources, which are represented at Fig. 4 as set

_{l}*I*containing

*n*

_{l}_{1}objects (of type)

*a*

_{l}_{1}, …,

*n*objects (of type)

_{l}_{p}*a*. By this, IS along with order also may be considered as “black box”, i.e. device producing object

_{l}_{p}*q*after being applied to initial resources set

*I*. Any impact on IS eliminates some initial resources and devices entering this system, thus reducing its producing capability.

Let us underline, that there are no static interconnections between devices *B*_{1}, …, *B _{k}*, and structure, representing IS in the described manner, is not graph, usually considered as a canonical form of such systems description and modelling (

**Burkart, 1997**;

**Mills and Dabrowski, 2006**;

**Hespanha et al., 2007**;

**Levin et al., 2009**;

**Dabrowski and Hunt, 2011**;

**Mills et al., 2012**;

**Carreras et al., 2005**;

**Mills et al., 2011**;

**Lade and Gross, 2012**;

**Scheffer, 2009**;

**Sheffer et al., 2009**;

**Dabrowski et al., 2011**;

**D’Andrea and Dullerud, 2003**;

**Dullerud and Paganini, 2005**;

**Goh and Yang, 2002**;

**Horn and Johnson, 1991**;

**Jadbabiae et al., 2003**;

**Klavins et al., 2006**;

**Mesbahi and Egerstedt, 2010**;

**Mills and Dabrowski, 2008**;

**Olfati-Saber et al., 2007**;

**Stewart, W 1994**). Here every order completion provides its own tree, including manufacturing operations and transfers of their results among devices, incorporated to this process. Moreover, there may be a lot of variants of each order completion, by reason IS may contain devices manufacturing similar objects in different alternative ways. So, every order completion process generates, in fact, each own cooperation, or contracts set, providing necessary items manufacturing.

Described formalization is basic for direct and reverse problems, verbally formulated higher, primary consideration. But it is not sufficient for strict mathematical description and, further, necessary algorithms design. There would be some constructive mathematical toolkit providing solutions of mentioned problems. But multiple attempts of well-known general-purpose tools, based on vector-matrix calculus, graphs theory, Markovian chains, Petri nets etc. (**Burkart, 1997**; **Mills and Dabrowski, 2006**; **Hespanha et al., 2007**; **Levin et al., 2009**; **Dabrowski and Hunt, 2011**; **Mills et al., 2012**; **Carreras et al., 2005**; **Mills et al., 2011**; **Lade and Gross, 2012**; **Scheffer, 2009**; **Sheffer et al., 2009**; **Dabrowski et al., 2011**; **D’Andrea and Dullerud, 2003**; **Dullerud and Paganini, 2005**; **Goh and Yang, 2002**; **Horn and Johnson, 1991**; **Jadbabiae et al., 2003**; **Klavins et al., 2006**; **Mesbahi and Egerstedt, 2010**; **Mills and Dabrowski, 2008**; **Olfati-Saber et al., 2007**; **Stewart, W 1994**), application in the described area were not successful by reasons of problem’s dimension, difficulties of IS manufacturing process precise representation and computational complexity. This lead us to the new approach, which is, by our opinion, more flexible and simple in application to the large-scale IS representation, analysis and synthesis, as well as more efficient from the computational complexity point of view, especially in high-parallel computing environments. This new approach is strongly based on the recursive multisets (MS) theory (**Sheremet, 2010**, **2011**) – more precisely, multiset grammars (MG), – that’s why is called “multigrammatical”. Multiset grammars, namely, one of their possible dialects, – constraint multiset grammars (CMG) – were at first proposed in (**Marriott, 1994**; **Marriott and Meyer 1997**; **Marriott, 1996**) as a tool for recognition of visual objects with complex structure. CMG may be also considered as one of the problem-oriented constraints logical programming languages (**Marriott and Stucky, 1998**; **Apt, 2003**; **Fruhkwirth and Abdennadher, 2003**).

Authors’ main contribution to this area are so called unitary multiset metagrammars (UMMG) (**Sheremet, 2010**, **2011**; **Sheremet and Zhukov, 2016**), which are specific knowledge representation model, providing deep integration and convergence of classical optimization theory and modern knowledge engineering. As shown in (**Sheremet, 2010**, **2011**; **Sheremet and Zhukov, 2016**), various subsets (subclasses) of UMMG provide efficient solution of various problems from system analysis and classical optimization areas.

Problem considered in this paper was announced in (**Sheremet, 2016**), and it is solved mainly by applying one of the simplest classes of UMMG family – unitary multiset grammars (UMG). Also general form multigrammars are applied to the mentioned reverse problem study.

We consider main results of UMG/MG application to the problem verbally formulated higher in a following way. Section 2 is dedicated to basic notions and definitions. Main elements of the approach (technological base, resource base, impact on industrial system) multiset/multigrammatical representation as well as IS sustainability (vulnerability) conditions are described in the Section 3, while Section 4 is dedicated to the NDI representation and mentioned conditions transformation to the corresponding form. Reverse problem concerning recognition of the abilities of the vulnerable IS is considered in Section 5. Inplementation issues are discussed in short in Section 6. Further directions of the development of multigrammatical approach practical applications are described at the conclusion.

## 2 Basic Notions and Definitions

According to (**Calude et al., 2001**; **Petrovskiy, 2003**; **Banatre and Le Metoyer, 1993**; **Singh et al., 2007**; **Red’ko et al., 2015**), **multiset** is set of so called multiobjects of the form *n* • *a*, that means there are *n* identical objects (of type) *a*, and that is written as

(1)

$\nu =\{{n}_{1}\cdot {a}_{1},\dots ,{n}_{m}\cdot {a}_{m}\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu = { {n_1} cdot {a_1}, ldots , {n_m} cdot {a_m}} ,

]

end{document}

where *ν* is multiset name, *n*_{1} • *a*_{1}, …, *n _{m}* •

*a*are multiobjects entering

_{m}*ν*, and integer numbers

*n*

_{1}, …,

*n*are called multiplicities of

_{m}*a*

_{1}, …,

*a*objects, all of which are different. (1) means that there are

_{m}*n*

_{1}objects (of type)

*a*

_{1}, …,

*n*objects (of type)

_{m}*a*in multiset

_{m}*ν*.

**Unitary multiset grammar** (UMG) is couple *S* = < *a*_{0}, *R* >, where *a*_{0} is title object, and *R* is scheme – set of the so called **unitary rules** (UR) of the form

(2)

$a\to {n}_{1}\cdot {a}_{1},\dots ,{n}_{m}\cdot {a}_{m},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

a to {n_1} cdot {a_1}, ldots , {n_m} cdot {a_m},

]

end{document}

where *a* object is called head and list *n*_{1} • *a*_{1}, …, *n _{m}* •

*a*– body of the UR.

_{m}UMG were designed specially for the representation of hierarchical systems and objects, so the most valuable in the considered problem area is so called **structural interpretation** of the unitary rules. According to the structural interpretation, UR (2) means that object *a* consists of *n*_{1} objects *a*_{1}, …, *n _{m}* objects

*a*.

_{m}**Example 1.** Let *S* = < *car, R* >, where *R* contains two URs:

*car* → 1 • *frame*, 1 • *engine*, 4 • *door*, 4 • *wheel*.

*engine* → 1 • *motor*, 1 • *accumulator*, 1 • *transmission*.

As seen, car consists from one frame, one engine, four doors and four wheels. Engine, in turn, contains motor, accumulator as well as transmission.▪

**Technological interpretation** of unitary rules is extension of the structural one in such a way that UR

(3)

$a\to {n}_{1}\cdot {a}_{1},\dots ,{n}_{m}\cdot {a}_{m},{n\u2018}_{1}\cdot {b}_{1},\dots ,{n\u2018}_{k}\cdot {b}_{k},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

a to {n_1} cdot {a_1}, ldots , {n_m} cdot {a_m}, {n’_1} cdot {b_1}, ldots , {n’_k} cdot {b_k},

]

end{document}

represents not only structural components (spare parts) of the object *a*, which are multiobjects *n*_{1} • *a*_{1}, …, *n _{m}* •

*a*, but also resources, necessary for assemblying object

_{m}*a*from these components, and being multiobjects

*n′*

_{1}•

*b*

_{1}, …,

*n′*•

_{k}*b*.

_{k}**Example 2.** Let *S* = < *car, R* >, where *R* contains one UR:

*car* → 1 • *frame*, 1 • *engine*, 4 • *door*, 4 • *wheel*,

400 • *kW*, 300 • *USD*, 10 • *mnt* – *asm* – *line*.

Here first four multiobjects of the UR body are the same, as in the first UR in the example 1, while the last three multiobjects define amounts of electrical energy (400 *kilowatt*), money (300 *dollars*) and time (10 *minutes of the assemblying line operation*), which are necessary for assemblying car from its spare parts (*frame, engine*, 4 *doors*, 4 *wheels*).▪

Unitary multiset grammars define systems (devices, processes etc.) in the easily understood top-down manner, and result of UMG application is set of multisets, each containing multiobjects with multiplicities defining total amounts of specific elementary (non-decomposed) objects having place in the system (device) or utilized while its manufacturing. Degree of decomposition is regulated by the analyst applying this tool while problem solving.

To define formally UMG semantics, i.e. process of generation of set of multisets *V _{S}* represented by UMG

*S*, we shall use some operations and relations on multisets (

**Sheremet, 2010**,

**2011**;

**Petrovskiy, 2003**). Lower +, – and * are symbols of multisets addition, subtraction and multiplication operations correspondingly, which are defined as follows:

(4)

$\begin{array}{l}\nu +\nu \u2018=\left(\underset{\begin{array}{l}n\cdot a\in \nu \\ n\u2018\cdot a\in \nu \u2018\end{array}}{\cup}\{(n+n\u2018)\cdot a\}\right)\cup \\ \cup \left(\underset{\begin{array}{l}n\cdot a\in \nu \\ a\notin \nu \u2018\end{array}}{\cup}\{n\cdot a\}\right)\cup \\ \cup \left(\underset{\begin{array}{l}n\u2018\cdot a\u2018\in \nu \\ a\u2018\notin \nu \end{array}}{\cup}\{n\u2018\cdot a\u2018\}\right)\text{}\cdot \end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

{nu + nu’}= left(mathop {mathop {bigcup limits_{n cdot a{in}nu}}limits_{n’ cdot a{in}nu’}}{(n+n’)cdot a}right)cup\

qquad qquad cupleft(mathop {mathop {mathop bigcup limits_{n cdot a{in}nu}}limits_{a{notin}nu’}} {ncdot a} right)cup\

qquad qquad cupleft(mathop {mathop {mathop bigcup limits_{n’ cdot a'{in}nu}}limits_{a'{notin}nu}} {n’cdot a’} right)cup

end{array}

]

end{document}

(5)

$\nu -\nu \u2018=\underset{\begin{array}{l}n\cdot a\in \nu \\ n\u2018\cdot a\in \nu \u2018\\ n>n\u2018\end{array}}{{\displaystyle \cup}}\{(n-n\u2018)\cdot a\}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu – nu’= mathop {mathop {mathop bigcup limits_{n cdot a{ in }nu } }limits_{n’ cdot a{ in }nu ‘} } limits_{n > n’} { (n – n’) cdot a }

]

end{document}

(6)

$n*\nu =\underset{m\cdot a\in \nu}{{\displaystyle \cup}}\{(m\times n)\cdot a\}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

n*nu = mathop cup limits_{m cdot a in nu } { (m times n) cdot a}

]

end{document}

Here symbols +, – and × denote usual arithmetic operations. In (4) we assume, that object *a* absence in multiset *ν* is equivalent to it’s zero-value multiplicity.

Lower we shall designate by β(*ν*) set of all objects having place in multiset *ν* (it is called multiset basis):

(7)

$\beta (\nu )=\left\{a\right|a\in \nu \}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

beta (nu ) = { a|a in nu }.

]

end{document}

Symbol “⊆” denotes multisets inclusion relation, and, if *ν′* ⊆ *ν*, then *ν′* is called submultiset of *ν*. Formally

(8)

$\nu \u2018\subseteq \nu ,$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu ‘ subseteq nu ,

]

end{document}

if

(9)

$(\forall n\prime \xb7a\in \nu \prime )(\exists n\xb7a\in \nu )n\prime \le n.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

(forall n’ cdot a in nu ‘) (exists n cdot a in nu) n’ le n.

]

end{document}

Also we shall use multisets intersection operation denoted by bold symbol “∩” and defined as follows:

(10)

$\nu \cap \nu \u2018=\underset{\begin{array}{l}n\cdot a\in \nu \\ n\u2018\cdot a\in {\nu}^{\u2018}\end{array}}{\cup}\{\text{min(}n,n\u2018)\cdot a\}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu cap nu’= {mathop {mathop {mathop bigcup limits_{n cdot a{ in }nu } }limits_{ n’ cdot a{ in }nu’ } } {{rm{min}}(n, n’)} cdot a }.

]

end{document}

As in (4), *a* ∉ *ν* and 0 • *a* ∈ *ν* are equivalent.

By *A _{s}* we shall designate set of all objects having place in UMG

*S*= <

*a*

_{0},

*R*>, while by

*A̅*– set of all terminal objects having place in

_{s}*S*, i.e. objects which are not heads of unitary rules

*r*∈

*R*and present only in URs bodies. As seen,

(11)

$\overline{{A}_{s}}\subseteq {A}_{s}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

overline {{A_s}} subseteq {A_s}.

]

end{document}

Multiset *ν* ∈ *V _{s}* is called

**terminal multiset**(TMS), if there is no one UR in the scheme

*R*, which may be applied to

*ν*, i.e. it contains only terminal objects. Set of terminal multisets (STMS)

*V̅*⊆

_{s}*V*is subset of

_{s}*V*:

(12)

$\overline{{V}_{s}}\subseteq {V}_{s}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

overline {{V_s}} subseteq {V_s}.\

end{array}

]

end{document}

Strict mathematical definition of the UMG application, i.e. set of multisets generation process, which we shall use here, is as follows (**Sheremet, 2010**, **2011**; **Sheremet and Zhukov, 2016**):

(13)

${V}_{(0)}=\left\{\right\{1\xb7{a}_{0}\left\}\right\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_{(0)}} = { { 1 cdot {a_0}} } ,

]

end{document}

(14)

${V}_{(i+1)}={V}_{(i)}\cup \left({\underset{\nu \in V}{{\displaystyle \cup}}}_{(i)}\underset{r\in R}{{\displaystyle \cup}}\right\{\pi (\nu ,r)\}),$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_{(i + 1)}} = V_{(i)} cup (bigcup_{nuin V_{(i)}} bigcup_{rin R} {pi(nu,r)}),

]

end{document}

(15)

$\begin{array}{l}\pi (\nu ,<a\to {n}_{1}\times {a}_{1},\mathrm{\dots},{n}_{m}\times {a}_{m}>)=\\ =\{{}_{\{\varnothing \}\text{otherwise},}^{\nu -\{n\times a\}+n*\{{n}_{1}\times {a}_{1},\dots ,{n}_{m}\times {a}_{m}\},\text{if}n\times a\in v,}\end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

{pi (nu , < a to {n_1} times {a_1}, ldots ,{n_m} times {a_m} >) = }\

= begin{cases} {nu -{ n times a} + n*{ {n_1} times {a_1}, ldots ,{n_m} times {a_m}} ,rm{if} n times a in v,}\ {emptyset } {rm{otherwise,}} end{cases}\

end{array}

]

end{document}

(16)

${V}_{s}={V}_{(\infty )},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_s} = {V_{(infty )}},

]

end{document}

(17)

$\overline{{V}_{s}}=\left\{\nu \right|\nu \in {V}_{s}\&\beta \left(\nu \right)\subseteq \overline{{A}_{s}}\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

overline {{V_s}} = { nu |nu in {V_s} & beta (nu ) subseteq overline {{A_s}} } ,

]

end{document}

where UR *a* →*n*_{1} • *a*_{1}, …, *n _{m}* •

*a*for unambiguity is represented in angle brackets, i.e. as <

_{m}*a*→

*n*

_{1}•

*a*

_{1}, …,

*n*•

_{m}*a*>.

_{m}As seen, multisets generation is implemented by application to set of MS *V*_{(i)}, created at previous *i* steps, all unitary rules *r* ∈ *R*. In turn, every such UR is applied to all multisets *ν* ∈ *V*_{(i)} by special function π of two arguments, first being *ν*, and second – UR *r* in the form *a* →*n*_{1} • *a*_{1}, …, *n _{m}* •

*a*. If

_{m}*ν*contains multiobject

*n*•

*a*, it is replaced by multiset

*n**{

*n*

_{1}•

*a*

_{1}, …,

*n*•

_{m}*a*} (this, of course, is followed by summarizing multiplicities of identical objects in the MS sum). Otherwise result is empty multiset. The described iterative process in general case is infinite, and set of multisets, defined by UMG

_{m}*S*= <

*a*

_{0},

*R*>, is it’s fixed point

*V*

_{(∞)}, while set of terminal multisets, defined by

*S*, is subset of

*V*, defined by (17).

_{S}Let us note, that from computational complexity point of view (14) may be transformed to

(18)

$\begin{array}{l}{V}_{(i+1)}={V}_{(i)}\cup \\ (\underset{\nu \in {V}_{(i)}}{\cup}\underset{{n}_{m}\cdot {a}_{m}>\in R}{\underset{<a\to {n}_{{}_{{}_{1}}}{a}_{{}_{{}_{1}}},\dots ,}{\underset{n\cdot a{\exists}_{\in}\nu}{\cup}}}\text{{}\nu -\{n\cdot a\}+n*\{{n}_{1}\cdot {a}_{1},\dots ,{n}_{m}\cdot {a}_{m}\left\}\right\}),\end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

{{V_{(i + 1)}} = {V_{(i)}}mathop cup }\

{(mathop bigcup limits_{nu in {V_{(i)}}} mathop {mathop {mathop bigcup limits_{n cdot a{exists in }nu } }limits_{ < a to {n_{_{_1}}}{a_{_{_1}}}, ldots ,} }limits_{{n_m} cdot {a_m} > in R} { nu – { n cdot a} + n*{ {n_1} cdot {a_1}, ldots ,{n_m} cdot {a_m}} } ),}

end{array}

]

end{document}

where ∃∈ means selection of any one multiobject *n* • *a* from multiset *ν*. That provides sharp reduction of generation computational complexity (**Sheremet, 2010**, **2011**).

Here we shall consider only so called **finitary UMG**, which generate finite STMS (**Sheremet, 2010**, **2011**).

UMG *S* = < *a*_{0}, *R* > is finitary, when there exists *i* such, that *V*_{(i+1)} = *V*_{(i)}, and if so, *V*_{(i)} = *V _{S}*. Problem of UMG finitarity recognition is algorithmically decidable (

**Sheremet, 2010**,

**2011**).

Let us continue multigrammatical formalization of basic notions concerning the main subject of the paper.

**Industrial system** may be represented now by UMG *S* = < *tb, R* >, where *tb* (acronym from “technological base”) is title object, and *R* is set of unitary rules in technological interpretation. **Order** completed by industrial system may be represented by multiset

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

q = { n_1^q cdot {rm{ }}a_1^q, ldotsldots, n_l^q cdot a_l^q}

]

end{document}

, and, evidently, resources amount, necessary for order *q* completion, is set of terminal multisets generated by UMG

(19)

${S}_{q}=<\mathit{\text{tbq}},R\cup \{<\mathit{\text{tbq}}\to {n}_{1}^{q}\cdot {a}_{1}^{q},\dots ,{n}_{l}^{q}\cdot {a}_{l}^{q}>\}>,$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{S_q} = < tbq, R cup { < tbq to n_1^q cdot a_1^q, ldots, n_l^q cdot a_l^q > } {rm{ > ,}}

]

end{document}

i.e. *V̅ _{Sq}* (for simplicity we shall use

*V̅*instead of

_{q}*V̅*lower). Because of possibility of multiple ways of some objects manufacturing, i.e. so called internal alternativity of

_{Sq}*S*(

_{q}**Sheremet, 2010**,

**2011**), there may be more than one TMS in

*V̅*.

_{q}**Example 3.** Let *S* be the same, as in the previous example, and *q =* {3 • *car* }, i.e. IS must manufacture 3 cars. Then

*S _{q}* = <

*tbq*, {<

*tbq*→ 3 •

*car*>,

*< car*→1 •

*frame*, 1 •

*engine*, 4 •

*wheel*, 4 •

*chair*,

400 • *kW*, 300 • *USD*, 10 • *mnt* –*asm* –*line* >} >,

(here UR are written in the angle brackets for unambiguity) and, as seen,

*V̅ _{s}*

_{q}= {{3 •

*frame*, 3 •

*engine*, 12 •

*wheel*, 12 •

*chair*, 1200 •

*kW*, 900 •

*USD*, 30 •

*mnt*–

*asm*–

*line*}}. ▪

**Resource base** of industrial system may be represented by multiset, which multiobjects define amounts of objects, being available for technological base. Evidently, resource base *ν* is **sufficient** for order *q* completion by IS *S* = < *tb, R* >, if there exists at least one set of resources amounts, necessary for this completion, being submultiset of *ν*:

(20)

$(\exists \overline{v}\in {\overline{V}}_{q})\overline{v}\subseteq \nu .$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

(exists bar nu in {bar V_q}) bar nu subseteq nu .

]

end{document}

**Example 4.** Resource base

*ν* = {4 • *frame*, 3 • *engine*, 15 • *wheel*, 12 • *chair*, 1500 • *kW*, 1200 • *USD*, 50 • *mnt* – *asm* – *line*}

is sufficient for order *q* from the example 3 completion, while resource base

*ν* = {1 • *frame*, 3 • *engine*, 15 • *wheel*, 12 • *chair*, 1500 • *kW*, 1200 • *USD*, 50 • *mnt* – *asm* – *line*}

is not sufficient, because number of frames having place in the resource base, i.e. one, is less than it is necessary for 3 cars assemblying, i.e. three, although all other resources amounts are sufficient (they even exceed necessary values).▪

**Impact** on industrial system may be represented as multiset Δ*ν*, which defines resources amount eliminated from the resource base of IS, so the last after impact would be *ν*–Δ*ν*.

All introduced notions and definitions provide formulation of the condition of IS sustainability/vulnerability to impact.

Let resource base *ν* is sufficient for order *q* completion by IS *S* = < *tb, R* >, i.e. it satisfies (20). Then IS *S* completing order *q* with resource base *ν* is **sustainable** to impact Δ*ν*, if

(21)

$(\exists \overline{\nu}\in {\overline{V}}_{q})\overline{\nu}\subseteq \nu -\Delta \nu .$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

(exists bar nu in {bar V_q}) bar nu subseteq nu -Delta nu .

]

end{document}

Otherwise IS *S* is **vulnerable** to impact Δ*ν*.

**Example 5.** IS *S* = < *tb, R* > from example 3, completing order *q =* {3 • *car*} with resource base from example 4, sufficient for this order completion, is sustainable to impact

Δ*ν* = {3 • *wheel*, 2 • *chair*, 300 • *kW*, 100 • *USD*, 5 • *mnt* – *asm* – *line*}

because resource base after impact

*ν*–Δ*ν* = {4 • *frame*, 3 • *engine*, 12 • *wheel*, 10 • *chair*, 1200 • *kW*, 1100 • *USD*, 45 • *mnt* – *asm* – *line*}

is sufficient for completion. At the same time this IS is vulnerable to impact

Δ*ν* = {1 • *engine* },

because resource base after impact

*ν* = {4 • *frame*, 2 • *engine*, 15 • *wheel*, 12 • *chair*, 1500 • *kW*, 1200 • *USD*, 50 • *mnt* – *asm* – *line*}

is not sufficient for completion (number of engines is less than necessary).▪

## 3 Natural Disasters Impacts on Industrial System

Until now we have considered impacts without their specific features. Natural disaster impacts most general feature is their localization, i.e. connection with some fixed areas (points) affected by the NDI. However, any information about technological base, as well as resource base, elements locations, in the considered higher UMG representation of industrial systems is not included.

Let us extend unitary rules in technological interpretation by geospatial information in such a way, that every object, having place in UR, would have form *a/z*, where *z* is locator defining area (point), where this object presents, and “/” is divider, which is not used anywhere in *a* and *z* strings. So UR would have the following form:

(22)

$a/z\to {n}_{1}\cdot {a}_{1}/{z}_{1},\dots ,{n}_{m}\cdot {a}_{m}/{z}_{m},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

a{rm{/}}z to {n_1} cdot {a_1}/{z_1}, ldots, {n_m} cdot {a_m}/{z_m},

]

end{document}

that means object *a* at location *z* may be produced (assembled) if there are *n*_{1} objects *a*_{1} at location *z*_{1}, …, *n _{m}* objects

*a*at location

_{m}*z*. (Objects like

_{m}*a/z, a*

_{1}/

*z*

_{1}, …,

*a*are called “composite objects”, or “composits”).

_{n}/z_{n}Similarly, we shall extend resource base and order representation, which would become respectively

(23)

$\nu =\{{n}_{1}\xb7{a}_{1}/{z}_{1},\dots ,{n}_{k}\xb7{a}_{k}/{z}_{k}\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu = { {n_1} cdot {a_1}/{z_1}, ldots, {n_k} cdot {a_k}/{z_k}} ,

]

end{document}

(24)

$q=\{{n}_{1}^{q}\cdot {a}_{1}^{q}/{z}_{1}^{q},\dots ,{n}_{l}^{q}\cdot {a}_{l}^{q}/{z}_{l}^{q}\}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

q = { n_1^q cdot a_1^q/z_1^q, ldots, n_l^q cdot a_l^q/z_l^q} .

]

end{document}

After that there is a simplest way for NDI representation, namely, by the set *Z* = {*z*_{1}, …, *z _{k}*}, of locations destroyed by this NDI completely. Corresponding relation for NDI in the multiset form is constructed directly:

(25)

$\Delta \nu (Z)=\{n\cdot a/z|n\cdot a/z\in \nu \&z\in Z\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

Delta nu (Z) = { n cdot a/z|n cdot a/z in nu & z in Z} ,

]

end{document}

and

(26)

$\nu -\Delta \nu (Z)=\{n\cdot a/z|n\cdot a/z\in \nu \&z\notin Z\}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu -Delta nu (Z) = { n cdot a/z|n cdot a/z in nu & z notin Z}.

]

end{document}

From (23)–(24) and *Z* definition we may write the condition of IS sustainability/vulnerability, which is evident generalization of (21). If

(27)

$(\exists \overline{\nu}\in {\overline{V}}_{q})\text{}\overline{\nu}\subseteq \nu -\Delta \nu (Z),$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

(exists bar nu in {bar V_q}) bar nu subseteq nu -Delta nu (Z),

]

end{document}

then IS *S* = < *tb, R* >, completing order with resource base *ν*, is **sustainable** to NDI *Z*. Otherwise IS is **vulnerable** to *Z*.

**Example 6.** Let us consider IS, which resource base is

*ν* = {10 • *a*_{1}/*z*_{1}, 5 • *a*_{2}/*z*_{2}, 19 • *a*_{3}/*z*_{3}, 7 • *a*_{4}/*z*_{4}},

technological base is represented by scheme *R* containing two unitary rules

*a/z*_{1} → 3 • *a*_{1}/*z*_{1}, 2 • *a*_{2}/*z*_{2}, 7 • *a*_{3}/*z*_{3},

*a/z*_{1} → 2 • *a*_{2}/*z*_{2}, 3 • *a*_{4}/*z*_{4},

and order *q* completed by this IS is *q =* {2 • *a*_{1}/*z*_{1}}.

Natural disaster impact *Z* = {*z*_{3}} causes destruction of subset of the resource base, located at *z*_{3}, so according to (25),

Δ*ν*(*Z*) = {19 • *a*_{3}/*z*_{3}},

and

*ν*–Δ*ν*(*Z*) = {10 • *a*_{1}/*z*_{1}, 5 • *a*_{2}/*z*_{2}, 7 • *a*_{4}/*z*_{4}}.

As seen,

V̅* _{q}* = {

*ν*

_{1},

*ν*

_{2}},

where

*ν*_{1} = {6 • *a*_{1}/*z*_{1}, 4 • *a*_{2}/*z*_{2}, 14 • *a*_{3}/*z*_{3}},

*ν*_{2} = {4• *a*_{2}/*z*_{2}, 6 • *a*_{4}/*z*_{4}},

and

*ν*_{1} ⊈ *ν* – Δ*ν*(*Z*),

*ν*_{2} ⊈ *ν* – Δ*ν*(*Z*),

that’s why IS is sustainable to NDI *Z*.▪

Note, that NDI may destruct facilities not always completely, but very often partially. In this case some objects located at the area, affected by the NDI, may remain in the undestructed state and thus may be used elements for manufacturing some products.

This case may be represented in the direct manner:

(28)

$\Delta \nu (Z)=\{\Delta {n}_{{i}_{1}}\cdot {a}_{{i}_{1}}/{z}_{{i}_{1}},\dots ,\Delta {n}_{{i}_{p}}\cdot {a}_{{i}_{p}}/{z}_{{i}_{p}}\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

Delta nu (Z) = { Delta {n_{{i_1}}} cdot {a_{{i_1}}}/{z_{{i_1}}}, ldots, Delta {n_{{i_p}}} cdot {a_{{i_p}}}/{z_{{i_p}}}} ,

]

end{document}

that provides use of condition (27) for the IS sustainability/vulnerability assessment.

**Example 7.** Let us consider IS from the previous example 7, and NDI, partially destructing locations *z*_{3} and *z*_{4}, so that

Δ*ν*(*Z*) = {12 • *a*_{3}/*z*_{3}, 2 • *a*_{4}/*z*_{4} },

and

*ν*–Δ*ν*(*Z*) = {10 • *a*_{1}/*z*_{1}, 5 • *a*_{2}/*z*_{2}, 7 • *a*_{3}/*z*_{3}, 5 • *a*_{4}/*z*_{4}}.

As seen, because of

*ν*_{1} ⊈ *ν* – Δ*ν*(*Z*)

*ν*_{2} ⊈ *ν* – Δ*ν*(*Z*)

IS is vulnerable to NDI Δ*ν*(*Z*).▪

## 4 Reverse Problem

Let us consider the case, when IS *R*, completing order *q* with resource base *ν*, is vulnerable to NDI (*Z* or Δ*ν*(*Z*)).

The question is as follows: what part of order *q* may be completed by IS *R* affected by NDI *Z*?

Simple, but, however, non-evident approach to this question consideration is based on the general form multiset grammars use for constructing the solution.

**Multiset grammar** is couple *S* = < *ν*_{0}, *R* >, where *ν*_{0} is multiset called kernel, and *R* is, as in the UMG, scheme, which elements are called rules, which structure is

(29)

$\nu \to \nu \u2018,$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

nu to nu ‘,

]

end{document}

where *ν* and *ν′* are multisets. Semantics of multigrammars is similar to UMG semantics (**Sheremet, 2010**, **2011**):

(30)

${V}_{(0)}=\left\{{\nu}_{0}\right\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_{(0)}} = { {nu _0}} ,

]

end{document}

(31)

${V}_{(i+1)}={V}_{(i)}\cup \left(\underset{\nu \in {V}_{(i)}}{\cup}\underset{r\in R}{\cup}\{\pi (\nu ,r)\}\right),$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_{(i + 1)}} = {V_{(i)}} cup left( {mathop bigcup limits_{nu in {V_{(i)}}} mathop bigcup limits_{r in R} { pi (nu ,r)} } right),

]

end{document}

(32)

$\pi (\nu ,\overline{\nu}\to \overline{\nu}\u2018)=\{{}_{\{\varnothing \}\text{otherwise,}}^{\nu -\overline{\nu}+\overline{\nu}\u2018,\text{if}\overline{\nu}\subseteq \nu ,}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

pi (nu ,bar nu to bar nu ‘) = begin{cases} nu-bar{nu}+bar{nu}’, rm{if} bar{nu}subseteq nu\

{emptyset} rm{otherwise},

end{cases}

]

end{document}

(33)

${V}_{s}={V}_{(\infty )},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_s} = {V_{(infty )}},

]

end{document}

(34)

${\overline{V}}_{S}=\left\{\nu \right|\nu \in {V}_{S}\&(\forall r\in R)\pi (\nu ,r)=\{\varnothing \}\}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{bar V_S} = { nu |nu in {V_S} & (forall r in R) pi (nu , r) = { emptyset }}.

]

end{document}

As seen, MG provides generation of new multisets from already generated, beginning from the kernel, by replacement of their submultisets in accordance with rules having place in the scheme. Generation is executed until it is possible, so, in general case, *V _{S}* and

*V̅*may be infinite. However, if there exists

_{S}*i*such, that

*V*

_{(i)}=

*V*

_{(i+1)}, then

*V*

_{(i)}=

*V*, then both

_{S}*V*and

_{S}*V̅*are finite sets, and MG is finitary.

_{S}Let us consider UMG *S* = < *tb, R* >, representing IS with technological base *R*, and this IS resource base *ν*. Multiset grammar

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

S_nu ^* = < nu ,{R^*} >

]

end{document}

will be called **dual** to unitary multiset grammar *S* = *tb, R* >, if

(35)

$\begin{array}{l}{R}^{\ast}=\{\{{n}_{1}\cdot {a}_{\text{1}},\dots ,{n}_{m}\cdot {a}_{m}\}\to \{1\cdot a\left\}\right|\\ <a\to {n}_{1}\cdot {a}_{\text{1}},\dots ,{n}_{m}\cdot {a}_{m}>\in R\},\end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{*{20}{l}}

{{R^ * } = { { {n_1} cdot {a_1}, ldots ,{n_m} cdot {a_m}} to { 1 cdot a} |}\

qquad qquad { < a to {n_1} cdot {a_1}, ldots ,{n_m} cdot {a_m} > in R} ,}

end{array}

]

end{document}

i.e. every unitary rule *a* →*n*_{1} • *a*_{1}, …, *n _{m}* •

*a*having place in the UMG

_{m}*S*scheme

*R*is substituted by one and the only one “mirror” rule in MG

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{S_nu ^*}

]

end{document}

scheme *R**.

As may be seen, set of multisets

${V}_{{S}_{\nu}^{*}}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{V_{S_nu ^*}}

]

end{document}

, generated by MG

${S}_{\nu}^{*}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{S_nu ^*}

]

end{document}

*S*, beginning from the resource base *ν*. Set of variants of order *q* partial completion is, thus, subset of set generated by MG

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{S_nu ^*}

]

end{document}

*q* order (here and lower we denote mentioned set of variants as V (*R, ν, q*)):

(36)

$V(R,\nu ,q)=\left\{\overline{\nu}\right|\overline{\nu}\in {V}_{{S}_{\nu}^{*}}\&q\cap \overline{\nu}\ne \{\varnothing \}\}.$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

V(R, nu , q) = { bar nu |bar nu in {V_{S_nu ^*}} & q cap bar nu ne { emptyset } } .

]

end{document}

As a consequence, total set of solutions of the reverse problem is

(37)

$\begin{array}{l}\text{V}(R,\nu \u2013\Delta \nu (Z),q)=\\ =\left\{\overline{\nu}\right|\overline{\nu}\in {V}_{{S}_{\nu -\Delta \nu (z)}^{*}}q\cap \overline{\nu}\ne \{\varnothing \}\}.\end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

rm{V} (R,nu – Delta nu (Z), q) = \

= bar nu | bar nu in {V_{S_{nu – Delta nu (z)}^*}}& q cap bar nu ne { emptyset } }.

end{array}

]

end{document}

**Example 8.** Let us consider IS with the same scheme *R* and resource base *ν* as in the previous examples 7 and 8, completing order *q* = { 3 • *a/z*_{1}}, and being affected by the same NDI Δ*ν*(*Z*) as in the example 8. Kernel *ν*_{0} of MG *S** = < *ν*_{0}, *R**>, dual to UMG *S* = < *tb, R* >, is

*ν*_{0} = *ν***–** Δ*ν*(*Z*) = {10 • *a*_{1}/*z*_{1}, 5 • *a*_{2}/*z*_{2}, 7 • *a*_{3}/*z*_{3}, 5 • *a*_{4}/*z*_{4}},

while rules are

*r*_{1} ≡ {3 • *a*_{1}/*z*_{1}, 2 • *a*_{2}/*z*_{2}, 7 • *a*_{3}/*z*_{3}} → {1 • *a/z*_{1}},

*r*_{2} ≡ {2 • *a*_{2}/*z*_{2}, 3 • *a*_{4}/*z*_{4}} → {1 • *a/z*_{1}},

*r*_{2} ≡ {3 • *a/z*_{1}} → {1 • *tbq*}.

According to (36),

V (*R, ν***–** Δ*ν*(*Z*), *q*) = {*ν*_{1}, *ν*_{2}, *ν*_{3}},

where

*ν*_{1} = {7 • *a*_{1}/*z*_{1}, 3 • *a*_{2}/*z*_{2}, 5 • *a*_{4}/*z*_{4}, 1 • *a/z*_{1}},

*ν*_{2} = {5 • *a*_{1}/*z*_{1}, 3 • *a*_{2}/*z*_{2}, 2 • *a*_{4}/*z*_{4}, 2 • *a/z*_{1}},

*ν*_{3} = {10 • *a*_{1}/*z*_{1}, 3 • *a*_{2}/*z*_{2}, 7 • *a*_{3}/*z*_{3}, 2 • *a*_{4}/*z*_{4}, 1 • *a/z*_{1}}.

As seen, *ν*_{1} is result of application of *r*_{1} to *ν*_{0}; *ν*_{2} – result of application of *r*_{2} to *ν*_{1}; while *ν*_{3} is result of application of *r*_{2} to *ν*_{0}.

So, a valuable part of the order (2 of 3 objects *a* located at *z*_{1}) may be completed by the affected IS, and even some valuable part of the resource base would remain after following this way of order completion.▪

However, in general case some of multisets entering set V (*R, ν* – Δ*ν*(*Z*), *q*) may be of no practical use (as *ν*_{1} and *ν*_{3} in the previous example 8), because the only purpose of the assessment is to get the best (“valuable” in the common sense) variants of order completion, which are not improvable from the practical point of view.

To filter STMS, constructed in accordance with (37), we shall define one useful function **max**, which value **max**(*V*) is subset of *V* including only so called non-dominated multisets entering *V*:

(38)

$\mathbf{\text{max}}\left(V\right)=\left\{\nu \right|\nu \in V\&(\overline{)\exists}\nu \u2018\in V)\nu \subset \nu \u2018\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{bf{max}} (V) = { nu | nu in V & (notexists nu ‘ in V) nu subset nu ‘} ,

]

end{document}

i.e. there is no one multiset in **max**(*V*) ⊆ *V*, which is submultiset of some other multiset entering *V*; **max**(*V*) is thus set of maximal elements of *V*.

**Example 9.** Let *V =* {*ν*_{1}, *ν*_{2}, *ν*_{3}, *ν*_{4}}, where

*ν*_{1} = {3 • *a*_{1}, 2 • *a*_{2}, 1 • *a*_{3}},

*ν*_{2} = {1 • *a*_{1}, 2 • *a*_{2}},

*ν*_{3} = {2 • *a*_{1}, 1 • *a*_{3}},

*ν*_{4} = {1 • *a*_{1}, 3 • *a*_{2}}.

As may be seen, according to (38), because of *ν*_{2} ⊆ *ν*_{1}, *ν*_{3} ⊆ *ν*_{1}, **max**(*V*) = {*ν*_{1}, *ν*_{4}}. ▪

From here set of valuable (“precise”) solutions of reverse problem, denoted V̅ (*R, ν***–** Δ*ν*(*Z*), *q*) may be constructed in a following evident way:

(39)

$\begin{array}{l}\overline{\text{V}}(R,\nu \u2013\Delta \nu (Z),q)=\\ =\mathbf{\text{max}}\left(\right\{\overline{\nu}\cap q|\overline{\nu}\in \text{V}(R,\nu \u2013\Delta \nu \left(Z\right),q\left)\right\}).\end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

{rm{bar V}}(R, nu – Delta nu (Z), q) =\

= {bf{max}} ({ bar nu cap q | bar nu in {rm{V}} (R, nu -Delta nu (Z), q) }).

end{array}

]

end{document}

As seen, set of valuable solutions includes those only intersections of elements of V (*R, ν***–** Δ*ν*(*Z*), *q*) and *q* order, which are non-dominated multisets.

**Example 10.** Consider V (*R, ν***–** Δ*ν*(*Z*), *q*) = {*ν*_{1}, *ν*_{2}, *ν*_{3}} and *q* = { 3 • *a/z*_{1}} from Example 9. According to (39),

V̅ (*R, ν* – Δ*ν*(*Z*), *q*) = **max** ({*ν*_{1} ∩ *q, ν*_{2} ∩ *q, ν*_{3} ∩ *q*}) =

= **max** ({{1 • *a/z*_{1}}, {2 • *a/z*_{1}}, {∅}}) = {{2 • *a/z*_{1}}}.▪

Note, that general form multigrammars application instead of unitary MG provides generation of all possible variants of work distribution between alternative facilities (devices), not only monopolial ones. However, this opportunity as a consequence leads to sensitive increasing of computational complexity of generation mentioned. Theory and implementation of this complexity reduction would be considered in separate publications.

## 5 Implementation issues

Software implementation of IS sustainability assessment (“direct problem”) employs knowledge base (*R* set of unitary rules) representation and storage in a form of data base, which elements are selected by means of NoSQL-like (**McCreary and Kelly, 2013**; **Vaish, 2013**) query language.

Data base mentioned is set of records being couples of the form < *a, B* >, where *a* is object (key of the record) while *B* is set of bodies of unitary rules, which head is *a*:

(40)

$B=\{{B}_{1},\dots ,{B}_{m}\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

B = { {B_1}, ldots , {B_m} },

]

end{document}

where

(41)

${B}_{i}=\{<{a}_{1}^{i},{n}_{1}^{i}>,\dots ,<{a}_{{k}_{1}}^{i},{n}_{{k}_{1}}^{i}>\},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

{B_i} = { < a_1^i, n_1^i >, ldots , < a_{k_1}^i, n_{k_1}^i > } ,

]

end{document}

so that (40)–(41) represent *m* unitary rules

(42)

$\begin{array}{l}a\to {a}_{1}^{1},{n}_{1}^{1},\dots ,{a}_{{k}_{1}}^{1},{n}_{{k}_{1}}^{1},\\ \dots \\ a\to {a}_{1}^{m},{n}_{1}^{m},\dots ,{a}_{{k}_{m}}^{m},{n}_{{k}_{m}}^{m}.\end{array}$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

begin{array}{l}

a to a_1^1, n_1^1, ldots, a_{k_1}^1, n_{k_1}^1,\

quad ldots\

a to a_1^m, n_1^m, ldots, a_{k_m}^m, n_{k_m}^m.

end{array}

]

end{document}

While generation, set *B* is selected from data base by query, which processing is implemented by special function *READ* (*a*). Similarly, insertion of new unitary *a*→*w* to the knowledge base is implemented by function *INSERT* (*a, w*), as well as UR *a*→*w* deletion from KB (DB) is implemented by function *DELETE* (*a, w*). Also there is function *DELALL* (*a*), eliminating from KB all unitary rules with head *a*, i.e. deletion from data base record <*a, B*>, where *B* is current set of bodies of URs with head *a*.

Associative internal organization of the described data base along with physical blocks cash, supporting DB management via virtual memory space, provides fast execution of functions mentioned without redundant search (**Sheremet, 2013**).

Software implementation of assessment of part of the order, which may be completed by the affected vulnerable IS (“reverse problem”) employs knowledge base (scheme *R** of MG, dual to the initial UMG) representation and storage in a form of data base similar to the considered higher.

However, this data base contains records of two types:

- triples of the form <
*r, w, a*>, where*r*is unique identifier (key of the record) of the “mirror” rule*w*→{1 •*a*}, where*w*multiset is represented as in (41); - couples of the form <
*a, w*>, where*a*is object (key of the record), while*w*is set of couples <*r, n*>, where*r*is identifier of rule, which left part contains multiobject*n*•*a*.

**Example 11.** Let dual UMG *R** contains following “mirror” rules:

*r*_{1}: {3 • *a*_{1}, 2 • *a*_{2} } → {1 • *a*_{3}},

*r*_{2}: {2 • *a*_{1}, 5 • *a*_{3}} → {1 • *a*_{0}}.

Then corresponding data base will contain following records:

*< r*_{1}, {<*a*_{1}, 3>, <*a*_{2}, 2>}, *a*_{3}>,

*< r*_{2}, {<*a*_{1}, 2>, <*a*_{3}, 5>}, *a*_{0}>,

*< a*_{1}, {<*r*_{1}, 3>, <*r*_{2}, 2>} >,

*< a*_{2}, {<*r*_{1}, 2>} >,

*< a*_{3}, {<*r*_{2}, 5>} >.▪

As may be seen, quantity of records of the first type is |*R**|=|*R*| while quantity of records of the second type is equal to number of objects having place in left parts of rules entering *R**.

Records of the first type are used while generation of the TMS (i.e. solutions) set in accordance with (36)-(38) by application of “mirror” rules. If this would be done without any improvements, there would be full search of all |*R**| rules at every generation step in order to apply some of them to the current multiset, generated while previous steps execution. So for practically interesting knowledge bases with |*R**|, beginning from 10^{5}–10^{6}, direct implementation of generation algorithmics is unreal. To avoid this principal difficulty, records of the second type are introduced. They are stored and selected by key (object *a*) in such a way, that by one access to data base identifiers of all “mirror” rules, which possibly may be applied to current multiset by reason there is multiobject *n* • *a* in their left parts, and *n* ≤ *m*, where *m* • *a* enters current multiset. This techniques provides cut-off all the rest “mirror” rules, non-applicable to this MS by reason of object *a* absence in their left parts. There are several implementations of this basic idea, and they would be considered separately.

Described approach to software implementation of the proposed algorithmics is somewhat efficient from the practical point of view, that is verified by real software-intensive IS management experience (**Sheremet, 2005**; **Sheremet, 2005**; **Karasev and Sheremet, 2008**). Such software operates CALS-originated knowledge bases, which contain structural descriptions of all types of objects, manufactured by various facilities, entering distributed IS. Due to “granularity” of the described knowledge representation, all accumulation and correction of such KB from the distributed local sources is performed without any difficulties in the online regime. Assessment of the possibility of orders completion at moments, when they enter IS, is performed in soft real time mode (minutes per message) on knowledge bases containing 10–12 mln. unitary rules with 2–3 mln. type of objects (items) used and manufactured by the industrial system, and this mode does not require special-purpose or high-parallel hardware. Reverse problem software is activated, when various impacts like manufacturing equipment malfunctions and necessary resources delays occur, and is solved on the same hardware in practically the same time scale. More detailed description of the UMG toolkit software implementation in various hardware environments may be object of the special paper.

## 6 Conclusion

Multigrammatical approach shortly presented in the paper may be efficiently used for the assessment of consequences of natural disasters impacts (as well as human-implemented impacts) on large-scale industrial systems, no matter what production they are manufacturing, what infrastructure they use, what kind of producing devices they contain etc., due to the generality and flexibility of MG/UMG toolkit used for the assessment.

The main four directions of further development of the approach, in our opinion, are:

- application of so called temporal MG/UMG with parallel processes modelling features to more deep and adequate assessment of NDI consequences;
- implementation of “what-if” regimes for decision makers;
- minimization of computational complexity of multisets generation as well as high-parallel generation algorithms development for grid/cloud hardware;
- development of “Big Knowledge” paradigm and unconventional computational models for its hardware implementation.

The first direction background is following. As it is easy to see, multigrammatical approach is strongly based on the additivity of quantities of objects represented by their multiplicities. However, time is additive only in consideration to one processing (manufacturing) unit (for example, assemblying line): if there are two or more such units, they may operate in parallel, that’s why total work may be completed by the system faster than in the sequential mode with additive time operating. Temporal MG/UMG are such generalization of the considered higher mathematical tools, that provide simple description of industrial systems and their elements extended by time intervals which are necessary to these elements to execute operations. Basic construction of temporal unitary multiset grammar is so called temporal unitary rule of the form

(43)

$a\to n\cdot t,{n}_{1}\cdot {a}_{1},\dots ,{n}_{m}\cdot {a}_{{}_{m}},$

documentclass[10pt]{article}

usepackage{wasysym}

usepackage[substack]{amsmath}

usepackage{amsfonts}

usepackage{amssymb}

usepackage{amssymb}

usepackage{amsbsy}

usepackage[mathscr]{eucal}

usepackage{mathrsfs}

usepackage{pmc}

usepackage[Euler]{upgreek}

pagestyle{empty}

oddsidemargin -1.0in

begin{document}

[

a to n cdot t, {n_1} cdot {a_1}, ldots, {n_m} cdot {a_{_m}},

]

end{document}

where *t* is fixed object denoting time measurement unit (for example, minute) while *n* multiplicity is duration of time interval (number of *t* objects), necessary for assemblying *a* object by utilizing *n*_{1} units of resource *a*_{1}, …, *n _{m}* units of resource

*a*. This extension provides as a final purpose construction of Gantt diagrams charts of manufacturing (production) processes evolving all devices which are necessary for order completion, that’s why temporal MG/UMG algorithmics is in fact algorithmics of optimal (rational) scheduling (

_{m}**Conway et al., 2003**;

**Hermann, 2006**). It is much more deep and sophisticated in comparison with MG/UMG, however, providing practically useful generalization of well known scheduling problems and their solutions.

The second of the listed directions is from the practical point of view very important, because it provides end users (decision makers) with the opportunity to prepare to possible NDI before they really occur.

The third direction, being quite evident, follows from the non-procedural, declarative representation of the knowledge about industrial systems and their operation items. “Granularity” of multigrammatical knowledge bases provides easy, in fact, “additive” accumulation of knowledge as well as its correction.

However, like any other knowledge representation model, MG/UMG need special algorithmics providing minimization of redundant search while multisets generation, especially for the so called filtering MG/UMG (**Sheremet, 2010**, **2011**; **Sheremet and Zhukov, 2016**; **Sheremet and Zhukov, 2016**). This direction is, perhaps, most critical, because it eliminates or mitigates sharp growth of redundant generation steps, which reason is well-known combinatorial explosion while knowledge base volume expansion. There would be combination of two basic approaches for such kind of problems solution: redundant steps elimination by some smart cutting-off conditions exploitation at maximal early stages of multisets generation, and “brutal force” application by parallel generation of alternative branches on asynchronously operating processor units. State of the art in this area is described in (**Sheremet 2010**, **2011**).

The most general is, in our opinion, the fourth direction. As may be easily estimated, real large-scale industrial systems technological bases and IS production (manufactured objects) would be represented by UMG knowledge bases containing millions and millions unitary rules. Creating, maintaining and utilizing such amounts of knowledge is a great problem being the next step of computer technologies application after Big Data, which are in fact everyday reality, however, not yet understood (**Roberts, 2016**) (as may be seen from section V, when UMG are used, then **Big Knowledge** is implemented by **Big Data** tools). In many considerations, it would be a new way of thinking, which must lead us to the new understanding of the global technosphere as an interconnected set of devices, joined with one another by information infrastructure (that’s already “Internet of Things”) and logistical networks. Such understanding, in turn, may optimize humanity behavior and its relations with the nature.

Multiset Analysis of Consequences of Natural Disasters Impacts on Large-Scale Industrial Systems

Facebook

Twitter

Google+

LinkedIn

RSS