publication . Article . 2016

Insertion Modeling and Its Applications

Alexander Letichevsky; Oleksandr Letychevskyi; Vladimir Peschanenko;
Open Access English
  • Published: 01 Dec 2016 Journal: Computer Science Journal of Moldova (issn: 1561-4042, Copyright policy)
  • Publisher: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
Abstract
The paper relates to the theoretical and practical aspects of insertion modeling. Insertion modeling is a theory of agents and environments interaction where an environment is considered as agent with a special insertion function. The main notions of insertion modeling are presented. Insertion Modeling System is described as a tool for development of different kinds of insertion machines. The research and industrial applications of Insertion Modeling System are presented.
Subjects
ACM Computing Classification System: Data_FILES
free text keywords: process algebra, insertion modeling, formal models, verification, Electronic computers. Computer science, QA75.5-76.95
Download from
30 references, page 1 of 2

[1] D.R. Gilbert and A.A. Letichevsky, “A universal interpreter for nondeterministic concurrent programming languages,” In Fifth Compulog network area meeting on language design and semantic analysis methods, M. Gabbrielli, Ed. September, 1996. [Online]. Available: http://trove.nla.gov.au/work/7032623.

[2] A. Letichevsky and D. Gilbert, “Interaction of agents and environments,” Recent trends in Algebraic Development technique, LNCS, vol. 1827, pp. 311-328, September, 2000.

[3] V.M. Glushkov, “The automata theory and design issues digital machines structures,” Cybernetics, vol. 1, pp. 3-11, 1965. (in Russian)

[4] V. M. Glushkov and A. A. Letichevsky, “Theory of algorithms and descrete processors,” Advances in Information Systems Science (J. T. Tou, Ed.), vol. 1, pp. 1-58, Plenum Press, 1969.

[5] M. Kwan, “The design of the ICE encryption algorithm,” In The 4th International Workshop, Fast Software Encryption - FSE '97 Proc. LNCS, vol. 1267, pp. 69-82, 1997.

[6] Y.V. Kapitonova and A.A. Letichevsky, The mathematical theory of digital systems, Moscow, Science, 1988, 295 p. (in Russian)

[7] A. Letichevsky, J. Kapitonova, A. Letichevsky Jr., V. Volkov, S. Baranov, V.Kotlyarov and T. Weigert, “Basic Protocols, Message Sequence Charts, and the Verification of Requirements Specifications,” In ISSRE 2004, WITUL (Workshop on Integrated reliability with Telecommunications and UML Languages), Rennes, November, 2005, pp. 117-132.

[8] S. Baranov, C. Jervis, V. Kotlyarov, A. Letichevsky and T. Weigert, “Leveraging UML to deliver correct telecom applications in UML for Real,” In Design of Embedded Real-Time Systems, L.Lavagno, G. Martin and B. Selic, Eds. Kluwer Academic Publishers, 2003, pp. 323-342.

[9] J. Kapitonova, A. Letichevsky, V. Volkov and T. Weigert, “Validation of Embedded Systems,” In The Embedded Systems Handbook, R. Zurawski, Ed. CRC Press, Miami, 2005, pp.6-1-6-26.

[10] A.A.Letichevsky, J.V.Kapitonova, V.A.Volkov, A.A.Letichevsky, jr., S.N.Baranov, V.P.Kotlyarov and T.Weigert, “System Specification with Basic Protocols,” Cybernetics and System Analyses, vol. 4, 2005, pp. 3-21.

[11] R. Milner, A Calculus of Communicating Systems, (LNCS), vol. 92, 1980.

[12] R. Milner, Communication and Concurrency, Prentice Hall, 1989.

[13] R. Milner, “The polyadic π-calculus: a tutorial,” Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, Tech. Rep. ECSLFCS91180, 1991.

[14] C. A. R. Hoare, “Communicating Sequential Processes,” Prentice Hall, 1985.

[15] J. A. Bergstra and J. W. Klop, “Process algebra for synchronous communications,” Information and Control, vol. 60 (1/3), pp. 109- 137, 1984. [OpenAIRE]

30 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue