Requirement verification in simulation-based automation testing

The emergence of the Industrial Internet results in an increasing number of complicated temporal interdependencies between automation systems and the processes to be controlled. There is a need for verification methods that scale better than formal verification methods and which are more exact than testing. Simulation-based runtime verification is proposed as such a method, and an application of Metric temporal logic is presented as a contribution. The practical scalability of the proposed approach is validated against a production process designed by an industrial partner, resulting in the discovery of requirement violations.Comment: 4 pages, 2 figures. Added IEEE copyright notic

The main directions of innovations distribution in the sphere of the higher education

This article opens questions of necessity of innovation development and ways of distribution of innovations in the sphere of the higher education in modern society.В данной статье обосновывается необходимость и описываются способы распространения инноваций в сфере высшего образования во все более усложняющемся современном обществе

Automatic generation of repair suggestions for overall I&C architecture represented with an ontology

We present an approach for suggesting possible fixes to an overall I&C nuclear architecture during its design phase. Despite the I&C architecture, in our case, being represented with an ontology, we do not aim to change the properties of an ontology per se. Instead, we focus on the subset of ABox triples that do not contain terminological elements in either subject, predicate, or object parts. Such a subset we call the design artifacts. When the ontology is filled with the design artifacts, the analyst runs the check of non-functional requirements using SPARQL queries. The requirements associated with the queries that returned results do not hold. The goal of the current work is to provide support for the next stage when the analyst has to change the design artifacts so that the queries no longer return results. Our method is based on representing the results of queries as graphs, intersecting them, and finding the minimal changes that prevent the results from being mapped on their (or other) queries