Wyniki wyszukiwania - Biblioteka Nauki

1

Slicing Abstractions

100%

Brückner I. , Dräger K. , Finkbeiner B. , Wehrheim H.

Fundamenta Informaticae

|

2008

|

tom Vol. 89, nr 4

369-392

EN

Abstraction and slicing are both techniques for reducing the size of the state space to be inspected during verification. In this paper, we present a new model checking procedure for infinite-state concurrent systems that interleaves automatic abstraction refinement, which splits states according to new predicates obtained by Craig interpolation, with slicing, which removes irrelevant states and transitions from the abstraction. The effects of abstraction and slicing complement each other. As the refinement progresses, the increasing accuracy of the abstract model allows for a more precise slice; the resulting smaller representation gives room for additional predicates in the abstraction. The procedure terminates when an error path in the abstraction can be concretized, which proves that the system is erroneous, or when the slice becomes empty, which proves that the system is correct.

2

ILF and DAWN for verifying distributed algorithms : an idea for a tool

100%

Baar T. , Kindler E.

Fundamenta Informaticae

|

1999

|

tom Vol. 37, Nr 3

201-211

EN

The Distributed Algorithms Working Notation (DAWN) was designed for modeling and veri-fying algorithms in an intuitive way. Nevertheless, DAWN proofs are formal. In this paper, we show that it is possible to check correctness of a DAWN proof fully auto-matically. For each step in a DAWN proof, we can generate a set proof obligations which can automatically be checked by help of automated theorem provers. The verification tool ILF provides a uniform interface to many theorem provers - which makes it an ideal partner for DAWN and a basis for building a DAWN-tool.

3

On the relationships among four timed process algebras

100%

Corradini F. , D'Ortenzio D. , Inverardi P.

Fundamenta Informaticae

|

1999

|

tom Vol. 38, Nr 4

377-395

EN

In this paper we contrast (the core of) four well-known process algebras specifically enriched for the specification and verification of timed systems. The aim of this comparison is twofold. On one hand it permits to gain confidence on how time and time passing are modelled in the four different timed process algebras. On the other hand, it establishes conditions under which mappings from a calculus to another can be provided which preserve (strong bisimulation-based) behavioural equivalence.

4

Verification of a model as a scientific tool of operations research : a methodological approach

100%

Radosiński E. , Radosiński Ł.

Operations Research and Decisions

|

2018

|

tom Vol. 28, No. 3

45--62

EN

The aim of the research presented in this paper was to solve one of the fundamental problems of modelling and simulation, i.e., verification of a model as a scientific tool of operations research. To attack this problem, certain crucial issues in the philosophy of science (the demarcation problem, the principle of verifiability) must be redefined. In discussing the question of verification, a procedure (the so called RAD-VER procedure) for verifying a model of a microeconomic system, in our case – a firm, is formulated. It is assumed that verification is a ceaseless process of evaluating a model’s scientificity from the standpoints of deductive reasoning, coherency and empiricism. Verification has been divided into two stages: the verification of the assumptions underlying the model of a firm and the verification of the simulator.

5

TTCN-3 for passive intrusion detection

100%

Brzeziński K.

Poznan University of Technology Academic Journals. Electrical Engineering

|

2007

|

tom No 54

9-16

EN

This paper discusses the feasibility of using TTCN-3 (both a language and its execution environment) to express and conduct passive tests. To motivate the discussion, we concentrate of the problem of detecting network attacks (intrusions). In this way the current paradigm, which associates TTCN-3 with active testing, is challenged and extended.

6

Application of OBDD Diagrams in Verification of Tabular Rule Systems

100%

Szwed P. , Ligęza A.

Schedae Informaticae

|

2005

|

tom Vol. 14

75-94

EN

This paper examines the application of Ordered Binary Decision Diagrams (OBDD) to modelling and verification of quality properties of rule systems. The transformation of an intentional specification of a tabular rule system into OBDD data structures was proposed and techniąues of verification of such ąuality properties as completeness, determinism and redundancy of rules were described.

7

Szkoła projektowania. Cz. 8, Weryfikacja audytów energetycznych

100%

Żurawski J.

Izolacje

|

2010

|

tom R. 15, nr 9

88-90

PL

Ze względu na ogromny bałagan prawny trudno jest poprawnie, tzn. tak jak chce osoba weryfikująca, wykonać audyt energetyczny. Zdarza się, że nie ze wszystkimi uwagami weryfikujących można się zgodzić. Pozostawienie pewnych kwestii dowolnej interpretacji osób weryfikujących nie powinno mieć miejsca, zwłaszcza że często decydują one o wydatkowaniu ogromnych kwot z budżetu państwa.

8

Verification mechanism for lightweight componenent-based environment based on ioc container

100%

Leszko R. , Piętak K.

Computer Science

|

2013

|

tom Vol. 14 (4)

577--588

EN

This paper presents a concept of component verification framework dedicated to a particular lightweight component environment. The starting point of the paper constitutes a discussion about the significance of verification of syntax in- consistencies in software development. Next, the need of verification in service-oriented and component-based systems is presented, and various approaches of verification in existing component environments are explained. The main part of the paper introduces a concept of functional integrity of component-based systems that utilize verification mechanisms which check consistency between components. The proposed solution is built on a fine-grained component environment (close to classes similarly to the Spring Framework) realized in the AgE platform. Selected technical aspects of framework design illustrate the considerations of the paper.

9

Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics

100%

Mateo J. A. , Srba J. , Sørensen M. G.

Fundamenta Informaticae

|

2015

|

tom Vol. 140, nr 1

89--121

EN

Analysis of workflow processes with quantitative aspects like timing is of interest in numerous time-critical applications. We suggest a workflow model based on timed-arc Petri nets and study the foundational problems of soundness and strong (time-bounded) soundness. We first consider the discrete-time semantics (integer delays) and explore the decidability of the soundness problems and show, among others, that soundness is decidable for monotonic workflow nets while reachability is undecidable. For general timed-arc workflow nets soundness and strong soundness become undecidable, though we can design efficient verification algorithms for the subclass of bounded nets. We also discuss the soundness problem in the continuous-time semantics (real-number delays) and show that for nets with nonstrict guards (where the reachability question coincides for both semantics) the soundness checking problem does not in general follow the approach for the discrete semantics and different zone-based techniques are needed for introducing its decidability in the bounded case. Finally, we demonstrate the usability of our theory on the case studies of a Brake System Control Unit used in aircraft certification, the MPEG2 encoding algorithm, and a blood transfusion workflow. The implementation of the algorithms is freely available as a part of the model checker TAPAAL (www.tapaal.net).

10

Verification of a model as a scientific tool of operations research – a methodological approach

100%

RADOSIŃSKI E. , RADOSIŃSKI Ł.

Operations Research and Decisions

|

2018

|

tom 28

|

nr 3

45-62

EN

The aim of the research presented in this paper was to solve one of the fundamental problems of modelling and simulation, i.e., verification of a model as a scientific tool of operations research. To attack this problem, certain crucial issues in the philosophy of science (the demarcation problem, the principle of verifiability) must be redefined. In discussing the question of verification, a procedure (the so called RAD-VER procedure) for verifying a model of a microeconomic system, in our case – a firm, is formulated. It is assumed that verification is a ceaseless process of evaluating a model’s scientificity from the standpoints of deductive reasoning, coherency and empiricism. Verification has been divided into two stages: the verification of the assumptions underlying the model of a firm and the verification of the simulator.

11

Comparison of models for dynamic analysis of a mobile telescopic crane

100%

Maczyński A. , Szczotka M.

Journal of Theoretical and Applied Mechanics

|

2002

|

tom Vol. 40 nr 4

1051-1074

EN

he paper compares two models of a mobile telescopic crane. The first is analytical and uses methods common in manipulator dynamics together with the modal method; the second uses the commercial ADAMS... package. Results of numerical simulations for rotation of the crane upper structure are presented and compared. Models are evaluated in terms of calculation time, possible development and use in crane design.

PL

W pracy przedstawiono porównanie dwóch modeli samojezdnego żurawia teleskopowego. Pierwszy został opracowany na drodze analitycznej przy zastosowaniu metod z zakresu dynamiki manipulatorów z wykorzystaniem metody modalnej, drugi przy użyciu komercyjnego pakietu ADAMS... . Przedstawiono i porównano przykładowe wyniki symulacji numerycznych dla ruchu obrotowego nadwozia żurawia. Dokonano oceny modeli pod względem czasochłonności obliczeń, możliwości ich rozbudowy i zastosowania w projektowaniu żurawi.

12

Checking Properties of Adaptive Workflow Nets

100%

van Hee K. , Oanea O. , Serebrenik A. , Sidorova N. , Voorhoeve M. , Lomazova I. A.

Fundamenta Informaticae

|

2007

|

tom Vol. 79, nr 3-4

347-362

EN

In this paper we consider adaptive workflow nets, a class of nested nets that allows more comfort and expressive power for modeling adaptability and exception handling in workflow nets. We define two important behavioural properties of adaptive workflow nets: soundness and circumspectness. Soundness means that a proper final marking (state) can be reached from any marking which is reachable from the initial marking, and no garbage will be left. Circumspectness means that the upper layer is always ready to handle any exception that can happen in a lower layer. We define a finite state abstraction for adaptive workflow nets and show that soundness and circumspectness can be verified on this abstraction.

13

Construction of a flexible simulation model of a corporation

100%

RADOSIŃSKI E. , RADOSIŃSKI Ł.

Operations Research and Decisions

|

2019

|

tom 29

|

nr 1

75-95

EN

The instability of the real structure of a firm is one of the fundamental problems in simulating microeconomic systems. This paper proposes a method, called ACV (abstraction – gradual concretization – verification) for constructing a flexible simulation model of a corporation. This method is based on the assumption that an effective approach to simulating a microeconomic system should take into account the structural instability of the modelled object. Practical implementation of the ACV method is illustrated using the EK_AN simulator of a firm. The purpose of the simulator as a scientific tool of operations research is to analyse the relations of given inputs (decisions) with the short- and mediumterm forecasts of a firm’s economic performance.

14

A Logic Framework for Verification of Timed Algorithms

100%

Slissenko A.

Fundamenta Informaticae

|

2004

|

tom Vol. 62, nr 1

29--67

EN

This paper is a survey of research of my colleagues and myself aimed at developing a comprehensive logical framework for the verification of real-time distributed systems. The framework is based on predicate logics with explicit time. To choose such a logic we pursue two goals: first, to make formalization of verification problems rather direct, without unjustified simplifications, and second, to have a logic which permits to describe decidable classes of the verifications problem covering the particular problems we are interested in. Notice that our intention is not to introduce new specification languages, but work directly with those of the user. In this paper we describe First Order Timed Logic (FOTL) that is sufficient to express the main part of verification of systems without uncertainty. The time is continuous (the formalism work as well for discrete time - in our context this case is less interesting and less efficient from algorithmic viewpoint). We give examples of problems that can be treated, describe how to represent runs of programs in FOTL, introduce decidable classes, discuss aspects of practical efficiency. We conclude with open questions.

15

Resistance calibrators for verification of instruments destined for industrial applications

100%

Mykyychuk M. , Yatsuk V. , Ivakhiv O.

Measurement Automation Monitoring

|

2015

|

tom Vol. 61, No. 8

390--394

EN

Nowadays, there are some problems corresponding with specifics of industrial instrumentation metrological support, i.e., compatibility ranges of resistance reproducibility in existing calibrators and the measurement range of industrial instrumentation, disability of controlling metrological characteristics in operation mode etc. To solve such problems, the use of active resistance simulators is possible. In the paper, there is presented the proper structure of an industrial resistance calibrator together with the calibrator error analysis.

16

Type-driven development of concurrent communicating systems

100%

Brady E.

Computer Science

|

2017

|

tom Vol. 18 (3)

219--240

EN

Modern software systems rely on communication, for example mobile applcations communicating with a central server, distributed systems coordinaing a telecommunications network, or concurrent systems handling events and processes in a desktop application. However, reasoning about concurrent prgrams is hard, since we must reason about each process and the order in which communication might happen between processes. In this paper, I describe a type-driven approach to implementing communicating concurrent programs, using the dependently typed programming language Idris. I show how the type system can be used to describe resource access protocols (such as controlling access to a file handle) and verify that programs correctly follow those prtools. Finally, I show how to use the type system to reason about the order of communication between concurrent processes, ensuring that each end of a communication channel follows a defined protocol.

17

Combining Static and Dynamic Contract Checking for Curry

100%

Hanus M.

Fundamenta Informaticae

|

2020

|

tom Vol. 173, nr 4

285--314

EN

Static type systems are usually not sufficient to express all requirements on function calls. Hence, contracts with pre- and postconditions can be used to express more complex constraints on operations. Contracts can be checked at run time to ensure that operations are only invoked with reasonable arguments and return intended results. Although such dynamic contract checking provides more reliable program execution, it requires execution time and could lead to program crashes that might be detected with more advanced methods at compile time. To improve this situation for declarative languages, we present an approach to combine static and dynamic contract checking for the functional logic language Curry. Based on a formal model of contract checking for functional logic programming, we propose an automatic method to verify contracts at compile time. If a contract is successfully verified, it can be omitted from dynamic checking. This method decreases execution time without degrading reliable program execution. In the best case, when all contracts are statically verified, it provides trust in the software since crashes due to contract violations cannot occur during program execution.

18

Proposal of an Observation Sheet for Basketball Players’ Performance Assessment

100%

Andrzej S. , Izabela L.

Baltic Journal of Health and Physical Activity

|

2012

|

tom 4

|

nr 4

258-276

EN

Background: The aim of this study was to develop a research tool used for an assessment of basketball players’ performance. Material/Methods: First, research of the subject literature was made and a preliminary outline of an assessment sheet for basketball players was developed. Next, after causing test observation, the final model of the observation sheet was prepared, and its reliability was evaluated. To measure the inter-observer agreement three experts independently viewed the same game, where they had to assess different components of game performance using the newly developed instrument. The inter- and intra-observer agreement was calculated by means of the kappa-values. Results: In their study, the experienced observers exhibited 98% of intra-observer reliability. For inter-observer reliability three inexperienced observers registered relatively low (3%) and high (1%) levels of observational errors. Conclusions: An observation sheet for basketball players’ performance assessment (Basketball Performance Assessment Instrument - BPAI) meets scientific requirements.

19

Signature verification: A comprehensive study of the hidden signature method

100%

Putz-Leszczyńska J.

International Journal of Applied Mathematics and Computer Science

|

2015

|

tom 25

|

nr 3

659-674

EN

Many handwritten signature verification algorithms have been developed in order to distinguish between genuine signatures and forgeries. An important group of these methods is based on dynamic time warping (DTW). Traditional use of DTW for signature verification consists in forming a misalignment score between the verified signature and a set of template signatures. The right selection of template signatures has a big impact on that verification. In this article, we describe our proposition for replacing the template signatures with the hidden signature-an artificial signature which is created by minimizing the mean misalignment between itself and the signatures from the enrollment set. We present a few hidden signature estimation methods together with their comprehensive comparison. The hidden signature opens a number of new possibilities for signature analysis. We apply statistical properties of the hidden signature to normalize the error signal of the verified signature and to use the misalignment on the normalized errors as a verification basis. A result, we achieve satisfying error rates that allow creating an on-line system, ready for operating in a real-world environment.

20

Verification of machine tool functionality by using hardware in the loop and manufacturing simulation

100%

Pritschow G. , Korajda B. , Rock S.

Prace Naukowe Instytutu Technologii Maszyn i Automatyzacji Politechniki Wrocławskiej. Konferencje

|

2003

|

tom Vol. 84, nr 41

45-52

EN

In order to achieve the highest machining precision, errors in a manufacturing unit need to be compensated for. The Hardware in the Loop simulation was designed as a verification and validation tool for CNC systems. The technological innovation is that the entire platform, simulated machine and control system, runs under hard real time conditions. The dynamic and cutting path errors can then easily be seen and analyzed. A comparison between the visualization and a physical work piece has proven this simulation method to be valid.