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 model-ing. 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)
Preface It is our pleasure to bring you the volume of the selected papers of the seventh edition ICTERI 2011 is concerned with several interrelated topics that proved to be vibrant for the research and industrial communities judging by the number of submissions we have received this year:  ICT infrastructures, integration and interoperability  Machine(More)
This paper outlines the development of symbolic modelling in white-box testing technology within the scope of an insertion modelling system (IMS). It implements the symbolic execution of the tested system and generate traces that contain a scenario of system behaviour. The obtained traces were checked for conformance with either a formal model for system(More)
This paper is devoted to the whole problem of interleaving reduction in modeling of concurrent processes. The main notions of insertional modeling were described. The verification problem in terms of insertional modeling was examined. General algorithm of interleaving reduction in terms of insertional modeling was presented. A static and incremental(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)
The paper presents the usage of invariants technique for symbolic modeling and verification of requirements for reactive systems. It includes checking of the safety, completeness, liveness, and consistency properties, deadlocks and livelocks detection. The paper describes the iterative method of double approximation and the method of undetermined(More)
We present the technique that allows splitting first-order logic formu-lae 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)
The main goal of the paper is finding of pre-and 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)