The stability problem on delay-dependent exponential convergence for neutral-type systems with nonlinear perturbations is investigated in this paper. A linear matrix inequality (LMI) based exponential stability criterion is derived by means of the Lyapunov-Krasovskii functional approach and a parameterized model transformation technique. An example is used to illustrate the less conservative re...

The Unified Modeling Language (UML) is widely considered as the defacto standard for the design of Object Oriented systems. UML class diagrams are used to depict the static structure of a system with its entities and the relationships between them. The Object Constraint Language (OCL) is a textual language based on first-order logic and can be used to define constraints on the elements of class...

We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by Alur et al. for symbolic state model checking for local safety properties [1]. The crux of the improvement is an optimization in the context of explicit state model checking of the condition that prevents action ignor...

The importance and difficulty of the problem of ranking fuzzy numbers is pointed out. Here we consider approaches to the ranking of fuzzy numbers based upon the idea of associating with a fuzzy number a scalar value, its valuation, and using this valuation to compare and order fuzzy numbers. Specifically we focus on expected value type valuations which are based upon the transformation of a fuz...

It is the main intention of the paper to show how the denotational semantics of a functional program can be used within the operational semantics of a graph transformation approach in order to compute data values. The presented approach goes beyond attributed graph transformations , since it allows to instanciate parameterized data types with elements of the graph. The kernel part of it is deen...

We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given propositional formula cannot be satisfied by a truth assignment that sets at most k variables to true, considering k as the parameter. One could separate the parameterized complexity classes FPT and W[2] by showing that th...

The paper starts with an examination and critique of Tarski’s wellknown proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain. The class of such operations has been characterized by McGee as exactly those definable in the language L∞,∞. Also characterized sim...

We propose a simple but powerful approach to the verification of parameterised systems. The approach is based on modelling the reachability between parameterized states as deducibility between suitable encodings of states by formulae of first-order predicate logic. To establish a safety property, that is non-reachability of unsafe states, the finite model finder is used to find a finite counter...

The most promising materials for applications in magnetic refrigeration exhibit a large entropy change at first-order ferromagnetic transition. Often, it has been observed that the transformation proceeds via two bursts surrounding regime of slow transformation. Within simplified framework, present article reports on thermodynamic model able to account this “two-steps” response. This is confron...