• W16,15 = “all medical procedures are completed”;
• W16,16 = ¬ W16,15.
In place l15, the current πi token receives the characteristic
“condition of the patient upon discharge from hospital”.
In place l16, the current πi token receives the characteristic
“condition of the patient during the procedures”.
Finally, we mention that place l8 represents the processes,
described by the GN from [3], while places l14, l15 and l16
correspond to the processes, modeled by the GN from [4]. On
the other hand, the present GN model elaborates into further
details the basic idea presented in [5].
The so constructed GN model traces the logical stages of the
final part of the process of communication between the sensors
connecting mobile adult patients and the staff of the respective
hospital unit. The developed model can be used for simulation
of the processes of decision making of the appropriate
specialists, who must either visit the respective adult patient or
to transport him/her to the hospital unit. The model permits
simulation of different scenarios e.g. the situation, in which
many patients simultaneously require medical assistance.
This work was partly funded by the project FP7-PEOPLE-
2009-IRSES-247541-MATSIQEL.
[1] Andonov, V., et al. Generalized Net Model for Telecare
Services, IEEE Conf. “Intelligent Systems”, Sofia, Bulgaria, 6-8
Sept. 2012, 221-224.
[2] Andonov, V., T. Stojanov, K. Atanassov, P. Kovachev, General-
ized Net Model for Telecommunication Processes in Telecare
Services, 1st International Conference on Telecommunications and
Remote Sensing, Sofia, Bulgaria, 29-30 Aug. 2012, 158-162.
[3] Chakarov, V., et al. Generalized net model for some basic
clinical administrative decision making. 1st European Conf-
erence on Health Care Modelling and Computation Craiova,
Aug. 31 - Sept., 2, 2005, 72-78.
[4] Matveev M., et al. Dynamic model of intensive care unit work-
flow based on generalized nets. International Electronic Journal
“Bioautomation”, Vol. 2, 2005, 85-92.
[5] Shannon, A., et al. The generalized net modelling of information
healthcare system. Int. Conf. "Automatics and Informatics'06",
Sofia, 3-6 Oct. 2006, 119-122.
[6] Atanassov, K., Generalized Nets, World Scientific, Singapore,
1991.
[7] Atanassov, K., On Generalized Nets Theory, “Prof. Marin Dri-
nov” Publishing House of the Bulgarian Academy of Sciences,
2007.
APPENDIX: SHORT REMARKS ON GENERALIZED NETS
Generalized Nets (GNs, see [6, 7] are extensions of the
apparatus of mathematical modelling of Petri Nets and other
modifications of theirs. GNs are a tool intended for the
detailed modelling of parallel and concurrent processes.
A GN is a collection of transitions and places ordered
according to some rules (see Fig. 2). The places are marked by
circles. The set of places to the left of the vertical line (the
transition) are called input places, and those to the right are
called output places. For each transition, there is an index
matrix with elements called predicates. Some GN-places
contain tokens – dynamic elements entering the net with initial
characteristics and getting new ones while moving within the
net. Tokens proceed from an input to an output place of the
transition if the predicate corresponding to this pair of places
in the index matrix is evaluated as “true”. Every token has its
own identifier and collects its own history that could influence
the development of the whole process modelled by the GNs.
Two time-moments are specified for the GNs: for the
beginning and the end of functioning, respectively.
A GN can have only a part of its components. In this case,
it is called reduced GN. Here, we shall give the formal
definition of a reduced GN without temporal components,
place and arc capacities, and token, place and transition
priorities.
Formally, every transition in the used below reduced GN is
described by a triple: Z = 〈L′, L″, r〉, where:
l'
1
l'
m
Z
l"
1
. . . . . .
l'
i
. . . . . .
l"
n
l"
j
Fig. 2. A GN transition
(a) L′ and L″ are finite, non-empty sets of places (the tran-
sition’s input and output places, respectively); for the
transition these are
L′ = {
} and L″ = {
};
(b) r is the transition’s condition determining which tokens
will pass (or transfer) from the transition’s inputs to its
outputs; it has the form of an Index Matrix (IM):
Creative Commons Attribution License 4.0
(Attribution 4.0 International, CC BY 4.0)
This article is published under the terms of the Creative
Commons Attribution License 4.0
https://creativecommons.org/licenses/by/4.0/deed.en_US
3. Conclusions
Acknowledgment
References
WSEAS TRANSACTIONS on COMMUNICATIONS
DOI: 10.37394/23204.2022.21.5
Mikhail Matveev, Velin Andonov,
Krassimir Atanassov, Maria Milanova