### Article

## Верификация СНК: выбор стратегии

Every SoC design center has its own design flow, i.e. process of chip designing, testing, verification and production. The design flow depends on many factors: a finance possibility, personal's quality and even traditions in the firm. As SoC production is very expensive task, every firm try to produce good chip on the first iteration. So the verification of the SoC project is the main task of modern design process. The article describes generic SOC verification strategy approach selection based on the given set of criterion. Strategy defines the aggregate of verification methods applied with software and hardware based tools. Proven that verification strategy selection is a complex multi-criterion decision maker methodology, thereby may be introduced as a sequence of verification strategy selection and efforts (expenses) diversification per each verification stage. Proposed individual and group methods of the decision evaluation. This allows to construct the most effective iterative look-up procedure for the given objectives.

The paper presents a formalism and a tool for modelling and analysis of distributed real-time systems of mobile agents. For that we use a time extension of our Resource Driven Automata Nets (TRDA-nets) formalism. A TRDA-net is a two-level system. The upper level represents distributed environment locations with a net of active resources. On the lower level agents are modeled by extended finite state machines, asynchronously consuming/producing shared resources through input/output system ports (arcs of the system net). We demonstrate modelling facilities of the formalism and show that specific layers of TRDA-nets can be translated into Timed Automata, as well as into Time Petri nets, thus TRDA-nets integrate merits of both formalisms.

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE’13) and the International Workshop on Modeling and Business Environments (ModBE’13) in Milano, Italy, June 24–25, 2013. These are co-located events of Petri Nets 2013, the 34th international conference on Applications and Theory of Petri Nets and Concurrency.

PNSE'13 presents the use of Petri Nets (P/T-Nets, Coloured Petri Nets and extensions) in the formal process of software engineering, covering modelling, validation, and veriﬁcation, as well as their application and tools supporting the disciplines mentioned above.

ModBE’13 provides a forum for researchers from interested communities to investigate, experience, compare, contrast and discuss solutions for modeling in business environments with Petri nets and other modeling techniques.

This volume contains the papers to be presented at VPT 2014: Second International Workshop on Verification and Program Transformation to be held on July 17-18, 2014 in Vienna. The workshop is an event of the Vienna Summer of Logic 2014 and it is co-located with the 26th International Conference on Computer Aided Verification CAV 2014. The workshop aim is to bring together researchers working in two different areas, Verification and Program Transformation. Recent research in both fields has shown a great potential for mutually beneficial interactions. On the one hand the methods, techniques and tools developed in program transformations have been successfully applied for verification of programs, systems and protocols specified by programs. Partial evaluation, partial deduction, fold/unfold transformations, supercompilation and distillation have all been used for verification with a particular success in the verification of infinite-state and parameterized systems. In opposite direction, model checking, automated and interactive theorem proving, SAT- and SMT-based methods have been used to strengthen and optimize program transformations. Yet another area on the border of two fields, that is formal verification and certification of programs transformations tools, such as automated refactoring tools and compilers has attracted considerable interest, posed major challenges and yielded promising results. The workshop aim is to provide a forum where all these interactions could be presented and discussed.

Workshop on Program Semantics, Specification and Verification: Theory and Applications is the leading event in Russia in the field of applying of the formal methods to software analysis. Proceedings of the fourth workshop are dedicated to formalisms for program semantics, formal models and verication, programming and specification languages, etc.

Content and methodic of the preparation testing in “Programming” subject in LMS e-Front is given. Necessity and preconditions to the preparation testing are described. The results of application of the methodic are provided.

This paper examines the practice of using the intuitivity test as an evaluation criterion of normative ethical theories. Mechanism of intuitive thinking and its differences from rational decision-making is described. It is shown, that due to the nature of intuitive thinking, the results of intuitivity test are often influenced by factors that contradict the conditions of the original problem, which calls into question the reliability of the results of such verification.

To verify realtime properties of UML statecharts one may apply a UPPAAL, toolbox for model checking of realtime systems. One of the most suitable ways to specify an operational semantics of UML statecharts is to invoke the formal model of Hierarchical Timed Automata. Since the model language of UPPAAL is based on Networks of Timed Automata one has to provide a conversion of Hierarchical Timed Automata to Networks of Timed Automata. In this paper we describe this conversion algorithm and prove that it is correct w.r.t. UPPAAL query language which is based on the subset of Timed CTL.

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.

Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability

The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.

It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are *selfreducible*? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.

Many electronic devices operate in a cyclic mode. This should be considered when forecastingreliability indicators at the design stage.The accuracy of the prediction and the planning for the event to ensure reliability depends on correctness of valuation and accounting greatest possiblenumber of factors. That in turn will affect the overall progress of the design and, in the end,result in the quality and competitiveness of products

Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov [7], we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.

I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables