Ремонт и курирование большого формального метода
The article analyzes the methods and provides a solution to the problem of detecting logical contradictions in business process models of the health care company. Practical purpose of solving the problem is to increase the efficiency of data management for municipal agencies as stakeholder of company. The methodology is based on formal tools relational logic formalism and the methodology involved is describing business processes by DEMO paradigm. Essentially used the simulator MIT Alloy Analyzer. Analyzed business processes specific organization, provides guidance on the elimination of contradictions.
Biography and analysis of the texts of the poet Nikolay Oleynikov
E. Zalta and P. Oppenheimer have created non-modal reading of the Anselm’s argument about the existence of God, The Ontological Argument. The authors have deduced the existence of God from his being. For this purpose, the term "that than which none greater can be conceived" used as a definite description. Through the predicate logic with the descriptions and several special axioms Zalta and Oppenheimer have formalized Anselm’s argument and demonstrate that from a formal point of view, his arguments is quite correct. But if we use as a tool the Theory of abstract objects we obtain the ontological argument, consequence of which is fundamentally different from the conclusion that Anselm has made.
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.
The annotated list of abbreviations and acronyms used in Russian and Soviet Avant-garde art and art institutions in the first third of the 20th century.
This book constitutes the proceedings of the 35th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2014, held in Tunis, Tunisia, in June 2014. The 15 regular papers and 4 tool papers presented in this volume were carefully reviewed and selected from 48 submissions. In addition the book contains 3 invited talks in full paper length. The papers cover various topics in the field of Petri nets and related models of concurrency.
oftware Defined Networks (SDNs) and corresponding platforms are expected to be widely used in future generation networks and especially deployed and activated on-demand as agile networking control service components. The correct functioning of SDN platforms must be assured, i.e., such platforms should be thoroughly tested before deployment. After thorough verification of SDN controllers and switches, the composition of them still requires additional testing in order to guarantee the absence of critical faults. We propose a model based testing technique for checking SDN platforms that relies on appropriate graph enumeration. In particular, we define a fault model where the fault domain contains the wrongly and correctly implemented paths allowed with respect to the underlying resource connectivity graph. We also establish the conditions for deriving a complete test suite with respect to such fault model under black box and white box testing assumptions.