Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric failure equivalences, which take two previously-known behavioral equivalences, i.e., the weak failure equivalence and the weak impossible future equivalence, as thei...

In this paper, we prove some properties of algebraic cone metric spaces and introduce the notion of algebraic distance in an algebraic cone metric space. As an application, we obtain some famous fixed point results in the framework of this algebraic distance.

In this note we show that if k is an algebraic number field with algebraic closure I and M is a finitely generated, free Zrmodule with continuous Ga\(k/k)action, then the continuous Galois cohomology group Hl(k, M) is a finitely generated Z,-module under certain conditions on M (see Theorem 1 below). Also, we present a simpler construction of a mapping due to S. Bloch which relates torsion alge...

Interval-valued fuzzy soft sets realize a hybrid soft computing model in a general framework. Both Molodtsov's soft sets and interval-valued fuzzy sets can be seen as special cases of interval-valued fuzzy soft sets. In this study, we first compare four different types of interval-valued fuzzy soft subsets and reveal the relations among them. Then we concentrate on investigating some nonclassic...

A fully-explicit, self-consistent algebraic expression for the Reynolds stress, which is the exact solution to the Reynolds stress transport equation in the `weak equilibrium' limit for twodimensional mean ows for all linear and some quasi-linear pressure-strain models, is derived. Current explicit algebraic Reynolds stress models derived by employing the `weak equilibrium' assumption treat the...

CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed by the designers that CTC is secure with respect to statistical attacks, such as differential and linear cryptanalysis. After a linear attack on CTC was presented, the cipher’s linear transformation was tweaked to of...

This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, different kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic compositio...

It is further believed that any practical attacks against HyRal are not possible with respect to the state-of-the-art. That is, we conclude that HyRal might be resistant to some well-known analysis such as differential attack, higher order differential attack, linear attack(including Truncated Linear Attack), interpolation attacks, algebraic attack (including XL attack and XSL attack), related ...

In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...