Abstract
Dynamic net models of a special kind — discrete process generators — are considered. Their relation to automata, Petri nets, partially commutative monoids, and the theory of traces is examined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
V. E. Kotov, Petri Nets [in Russian], Nauka, Moscow (1984).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebras, Languages, and Programming [in Russian], Naukova Dumka, Kiev (1989).
Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).
A. N. Romanov and S. V. Surzhko, "Discrete process generators: models and applications," 1st World Congress of the Bernoulli Society of Mathematical Statistics and Probability Theory, Abstracts of Papers [in Russian], Nauka, Moscow (1986).
S. V. Surzhko, "On evaluation of operators defined by regular schemas," Kibernetika, No. 6, 75–77, 82 (1989).
V. N. Agafonov, Program Specification: Conceptual Tools and Their Organization [in Russian], Nauka, Novosibirsk (1987).
É. Kh. Tyugu, Conceptual Programming [in Russian], Nauka, Moscow (1984).
E. Ochmanski, "Regular behaviour of concurrent systems," Bull. EATCS,27, 56–67 (Oct. 1985).
Ch. Duboc, "Mixed product and asynchronous automata," Theor. Comput. Sci.,48, 183–199 (1986).
I. J. Aalbersberg and G. Rozenberg, "Theory of traces," Theor. Comput. Sci.,60, 1–82 (1988).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 83–90, September–October, 1991.
Rights and permissions
About this article
Cite this article
Surzhko, S.V. Net models of discrete information transducers. I. Cybern Syst Anal 27, 706–711 (1991). https://doi.org/10.1007/BF01130541
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01130541