Either, the assertions used in the consequence rules cannot be captured by a complete proof system, or not every set of states can be represented by formulas

The following result is useful in providing the best quadrature rule in the class for approximating the integral of a function f : [a, b] → R whose first derivative is

In view of the interest in this type of inequality, much attention has been paid to the problem and many authors have extended the inequality to more general cases (see [1, 8])..

AEREA American Electric Railway Engineering Association / е / aero/п/ = A 22. AES Aircraft Electrical Society,

The following result is useful in providing the best quadrature rule in the class for approxi- mating the integral of a function f : [a, b] → R whose first derivative is

In case of the inductor only the distance between the pole surfaces, signed by d and the number of turns, signed by N and in connection with it the width of the conductor m

In computer science, formal methods refers to mathematically based techniques for the specification, development and verification of software and hardware systems!.

RASSIAS (Eds.), Ostrowski Type Inequalities and Applications in Numerical Integration, Kluwer Academic Publishers, Dordrecht, 2002..

"Performance Comparison of Multi Design Method and Meta-Heuristic Methods for Optimal Preliminary Design of Core-Form Power Transformers", Periodica Polytechnica

(a közoktatás központi értékelési rendszere, a központi mérésekkel kapcsolatos intézményi szervezési, szakmai feladatok, a mérési eredmények beépítése a

Line 474 – earlier Fusarium resistant (alias 484), high Mn level in the ear 1/a – inoculated with Fusarium culmorum. 2/a – inoculated with

In this section the result of transformation from functional specification into formal models (Petri net and UPPAAL automata) is summarized and some examples of

Based on the size and centroid of the objects suspicious locations are identified and fovea (region of interest, ROI) processing performs one after the other, by instructing the

In Section 3, we introduce the formalism of Timed Control Flow Automata, an extension of Control Flow Automata with notions of Timed Automata, and describe how verifiers for

The usual method for performing the system analysis in this case is the following: Firstly, the desired external behavior of the protocol is specified in the form of a process

Then, in Section 5, we construct the protocol game of the Syverson protocol and prove that it satisfies the definition of rational exchange assuming that the communication be- tween

In the present software-development practice it is still rather rare to use formal specification and verification methods, although the size and complexity of current soft- ware

it can apply in more phases of the protocol "life-cycle" namely in the design of the formal spec- ifications (giving the testing information in the specification), in