The Generalized Nets (GNs) are extensions of Petri nets and of different Petri nets modifications, introduced by the author (1982). In the book, definitions and the basic properties of GNs are given. The GNs extensions and reductions are discussed. GNs, which describe the functioning and results of the work of different types of petri nets, different types of finite automata and of Turing machines, are given. Over the GNs are defined different operations, relations and operators. They can also be transferred onto other nets. Many open problems in the GNs theory are given.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Generalized Nets GNs retrospection present
On the Concept GN
Conservative Extensions of GNs
GNs and Other Objects
Algebraic Aspect of the Theory of GNs
A L 12 K K active algorithm AMSE Review Vol analogous arcs Atanassov capacities characteristic function colour Computer Science concept conservative extensions construct a GN corresponding defined definition denote determined Dimitrov E U E E-nets elements equal exists finite function giving fuzzy sets given GN given transition GN G GN transition GN-model GN's GNAC graph graphical structure GTGN Hence i i i i-th index matrix initial characteristic input and output input places intuitionistic fuzzy juxtaposes Lecture Notes M-net Math modelled process modifications natural numbers Notes in Computer Obviously operator G ordinary GN output places parameters Petri net theory place l pr pr predicates priorities Proc Proof reduced GN Sofia temporal logic THEOREM time-components time-diagrams time-moment tion token receives tokens enter tokens transfer tran transition type transition Z Turing machine valid Varna word a a