Complexity Estimate of Logical Specifications Execution for Transport Processes Prototyping

In this paper we examine logical specifications for rapid prototyping of complex structures and processes, including transport ones. We use a language in classical predicate logic with equality and negation, which has computable semantics. The execution of such descriptions may have exponential complexity estimates. We have obtained sufficient conditions and, accordingly, subclasses of such specifications, the complexity of constructing prototypes for which can be reduced to polynomials of low degrees. Systems were defined which solvable in time \(O\left( {n\log_{2} n} \right)\) with linear memory \(O\left( m \right)\) , where \(n\) is the power of specified relations, \(m\) is the power of relations and function values. The expressiveness of the resulting classes of specifications, as shown by practical use, is sufficient for prototyping in various subject areas.