Vladimir S. Peschanenko

Learn More
The problem of reachability of the states of transition systems is considered hereby. The notions of partial unfolding and permutability of two operators (including the notion of statically permutable operators) are presented. New algorithm for reachability problem in terms of insertion modeling is described. An example of application of such algorithm is(More)
The paper relates to practical aspects of insertion modeling. Insertion modeling system is an environment for the development of insertion machines, used to represent insertion models of distributed systems. The architecture of insertion machines and insertion modeling system IMS is presented. Insertion machine for constraint programming is specified as an(More)
The paper describes an approach for creation of effective test automation technology for industrial software projects based on a formal model of the system under test, performing its automatic symbolic verification of the model and generation of symbolic traces, then their automatic concretization, generation and execution of test suites. The technology(More)
  • Alexander Godlevskyi, Aleksander Letichevskyi, +4 authors Maksym Poltorackiy
  • 2017
This paper outlines the technology of the formalization and verification of legal text documents. A formal model of a legal document is presented as an ordered set of rules. Every rule is presented as a triple containing preand post-conditions, as well as process parts. All rules are ordered in Use Case Maps (UCM) diagrams. Such a formal model can be(More)
The main goal of the paper is finding of preand post-invariants for transitions between symbolic states in the system that must be verified and use them for verification purposes. Systems are specified by basic protocols [1]. This specification defines a transition system with transitions s → s′ where s and s′ are symbolic states, b is a basic protocol. The(More)
The paper is devoted to the methods of programs proving in the Insertion Modeling System IMS. Architecture and functional possibilities of IMS, the main notions of insertion modeling were presented in this work. Floyd’s insertion machine and the methods of the satisfiability checking, and the usage of those methods for programs proving were described in the(More)
The talk describes insertion modeling methodology, its theory, implementation and applications. Insertion modeling is a methodology of model driven distributed system design. It is based on the model of interaction of agents and environments. Both agents and environments are characterized by their behaviors represented as the elements of continuous behavior(More)
We present the technique that allows splitting first-order logic formulae into parts which helps to use the special algorithms of satisfiability checking and predicate transformer, which are the specializations. We describe the mathematical description of the algorithm of the constructing specializations and a few particular approaches to them, which speed(More)
Over the last decades economies around the globe have transformed into a knowledge-based economy (KBE). Information and Communication Technology (ICT) has served as the principal enabling technology for this transformation. Now biology becomes another major pillar – producing a knowledge-based bio-economy (KBBE). The challenges faced by biotechnology push(More)