The objective of this paper is to study the monoid of all partial
transformations of a finite set that preserve a uniform partition. In addition
to proving that this monoid is a quotient of a wreath product with respect to a
congruence relation, we show that it is generated by 5 generators, we compute
its order and determine a presentation on a minimal generating set.

Software developers are expected to protect concurrent accesses to shared regions of memory with some mutual exclusion primitive that ensures atomicity properties to a sequence of program statements. This approach prevents data races but may fail to provide all necessary correctness properties.The composition of correlated atomic operations without further synchronization may cause atomicity violations. Atomic violations may be avoided by grouping the correlated atomic regions in a single larger atomic scope. Concurrent programs are particularly prone to atomicity violations when they use services provided by third party packages or modules, since the programmer may fail to identify which services are correlated. In this paper we propose to use contracts for concurrency, where the developer of a module writes a set of contract terms that specify which methods are correlated and must be executed in the same atomic scope. These contracts are then used to verify the correctness of the main program with respect to the usage of the module(s). If a contract is well defined and complete, and the main program respects it, then the program is safe from atomicity violations with respect to that module. We also propose a static analysis based methodology to verify contracts for concurrency that we applied to some real-world software packages. The bug we found in Tomcat 6.0 was immediately acknowledged and corrected by its development team.

Event-Condition-Action languages are the commonly accepted para- digm to express and model the behavior of reactive systems. While numerous Event-Condition-Action languages have been proposed in the literature, differing e.g. on the expressivity of the language and on its operational behavior, existing Event-Condition-Action languages do not generally support the action compo- nent to be formulated as a transaction. In this paper, sustaining that it is important to execute transactions in reactive languages, we propose an Event-Condition- Transaction language, based on an extension of Transaction Logic. This exten- sion, called Transaction Logic with Events (T Rev ), combines reasoning about the execution of transactions with the ability to detect complex events. An impor- tant characteristic of T Rev is that it takes a choice function as a parameter of the theory, leaving open the behavioral decisions of the logic, and thereby allowing it to be suitable for a wide-spectrum of application scenarios like Semantic Web, multi-agent systems, databases, etc. We start by showing how T Rev can be used as an Event-Condition-Action language where actions are considered as transac- tions, and how to differently instantiate this choice function to achieve different operational behaviors. Then, based on a particular operational instantiation of the logic, we present a procedure that is sound and complete w.r.t. the semantics and that is able to execute T Rev programs

n/a

In this paper we consider various classes of monoids of transformations of a finite chain,
including those of transformations that preserve or reverse either the order or the orientation.
In line with Howie and McFadden (1990),
we complete the study of the ranks (and of idempotent ranks, when applicable) of all their ideals.

n/a

This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting systems and biautomatic structures. For sylvester monoids, which are not finitely presented, we prove that the standard presentation is an infinite complete rewriting system, and construct biautomatic structures. Consequently, the monoid algebras corresponding to monoids of these classes are automaton algebras in the sense of Ufnarovskij.

Robotics technology has been applied to a wide variety of sectors and with a higher economic and social impact. In the last decades it has been one of the main elements of industrial manufacturing automation where about 1.5 million robots are currently operating, which means that 4 to 5 million workers are operating those systems. From 2014 to 2016, robot installations are estimated to increase by 6% on average per year. Besides this, in recent years the number of professional service robots has increased enormously in military and civil applications (around 130 thousand units).

This paper investigates the dynamic behaviour of cable-supported glazing façades
subjected to medium-level air blast loads. Preliminary numerical studies are carried-out in
SAP2000 by means of a geometrically refined and simplified lumped-mass finite-element
numerical model, in order to assess the major effects of the design blast load in the main
façade components. As shown, both the glass panels and the cable system are able to
properly accommodate the incoming impulsive loads, typically involving extreme ...

We prove the Stechkin inequality for Fourier multipliers on variable Lebesgue spaces under some natural assumptions on variable exponents.