Papers by Waldemar Korczynski
this paper. In this paper x, y, X , Y are sets. We introduce G-net structures which are extension... more this paper. In this paper x, y, X , Y are sets. We introduce G-net structures which are extensions of 1-sorted structure and are systems
this paper. In this paper x, y are sets and X , Y are sets. We introduce G-net structures which a... more this paper. In this paper x, y are sets and X , Y are sets. We introduce G-net structures which are systems
this paper. In this paper x, y are sets and X , Y are sets. Let N be a net. The functor chaos(N) ... more this paper. In this paper x, y are sets and X , Y are sets. Let N be a net. The functor chaos(N) yielding a set is defined by: (Def. 2)
Demonstratio Mathematica
In the paper some relationships between two models of concurrent system are described. One of the... more In the paper some relationships between two models of concurrent system are described. One of these models are Petri nets, the other one the graphs with limitations described in [Kor?].It is shown that graphs with limitations can be used for modeling of concurrence in systems which are more general than Petri nets.
Demonstratio Mathematica
In the paper a bitopological presentation of graphs has been described.
Progress in Natural Science, 2007
In the paper a concept for modeling the economic systems by the formalism of Paun's systems i... more In the paper a concept for modeling the economic systems by the formalism of Paun's systems is proposed. The main idea is to represent economic systems as homomorphic images of Petri nets corresponding to the (super) cells of Paun's systems.
Lecture Notes in Computer Science, 2003
Graph based models of hierarchical systems are usually seen as 'graph equipped with some refineme... more Graph based models of hierarchical systems are usually seen as 'graph equipped with some refinements', understood as the (homo)morphisms or (bi)simulations. In such a model it is not possible to consider phenomena happened on different levels of the system. We propose a new formalism of directed multi-graph allowing to see a hierarchical system similar as a formula of second order logic, i.e. to consider all levels parallel 'at the same time'. The concurrence in hierarchical system is modeled in terms of directed multi-graph.
Some fundamental notions of the theory of Petri nets are described in Mizar formalism. A Petri ne... more Some fundamental notions of the theory of Petri nets are described in Mizar formalism. A Petri net is defined as a triple of the form places, transitions, flow with places and transitions being disjoint sets and flow being a relation included in places × transitions.
Information Processing Letters, 1982
Fundamenta Informaticae, Apr 1, 1991
In this paper an algebraic characterization of a class of Petri nets is given. The nets are chara... more In this paper an algebraic characterization of a class of Petri nets is given. The nets are characterized by a kind of algebras, which can be considered as a generalization of the concept of the case graph of a (marked) Petri net.
Uploads
Papers by Waldemar Korczynski