Abstract

Abstract
This paper presents a formal framework in which to study the socialization processes evolving among utility-based agents. These agents are self-interested, being their different social attitudes (cooperativeness, competitiveness or indifference) a consequence of this behavior. The dynamics of the socialization process are captured by a relation that measures the similarities between the desires of two groups of agents. This similitude relation is derived from the system's model, defined as a probabilistic transition system and a set of individual preference relations. Game-theoretic concepts are used in order to determine the rational(or expected) transitions of the system. © 1998 IEEE.

Abstract
This paper is concerned with the formalization of a automated contracting mechanism that enables a society of cooperative resource allocation agents to negotiate rationally in a self-interested meta-society. Such environments induce agents to adopt different social behaviors according to the negotiation partner. This problem may be solved by taking an economic perspective in all the decisions, namely, by using utility based agents, through the use of marginal utility calculations, and defining dynamically the market extent for a task. The risk attitude and reactivity of each agent can be parameterized in order to achieve different negotiation strategies. The framework presented in this paper can be applied in a wide variety of situations, ranging from electronic commerce on virtual economic markets, to load distribution problems. © Springer-Verlag Berlin Heidelberg 1997.

Abstract
The calculus of relations has been widely used in program specification and reasoning. It is very tempting to use such specifications as running prototypes of the desired program, but, even considering finite domains, the inherent partiality and non-determinism of relations makes this impractical and highly inefficient. To tame partiality we prescribe the usage of invariants, represented by coreflexives, to characterize the exact domains and codomains of relational specifications. Such invariants can be used as pre-condition checkers to avoid runtime errors. Moreover, we show how such invariants can be used to narrow the non-deterministic execution of relational specifications, making it viable for a relevant class of problems. In particular, we show how the proposed techniques can be applied to execute specifications of bidirectional transformations, a domain where partiality and non-determinism are paramount. © 2012 Springer-Verlag.

Abstract
A UML Protocol State Machine (PSM) is a behavioral diagram for the specification of the external behavior of a class, interface or component. PSMs have been used in the software development process for different purposes, such as requirements analysis and testing. However, like other UML diagrams, they are often difficult to validate and verify, specially when combined with other artifacts, such as Object Constraint Language (OCL) specifications. This drawback can be overcome by application of an off-the-shelf formal method, namely one supporting automatic validation and verification. Among those, we have the increasingly popular Alloy, based on a simple relational flavor of first-order logic. This paper presents a model transformation from PSMs, optionally complemented with OCL specifications, to Alloy. Not only it enables automatic verification and validation of PSMs, but also a smooth integration of Alloy in current software development practices. © 2012 Springer-Verlag.

Abstract
Lenses are one of the most popular approaches to define bidirectional transformations between data models. However, writing a lens transformation typically implies describing the concrete steps that convert values in a source schema to values in a target schema. In contrast, many XML-based languages allow writing structure-shy programs that manipulate only specific parts of XML documents without having to specify the behavior for the remaining structure. In this paper, we propose a structure-shy bidirectional two-level transformation language for XML Schemas, that describes generic type-level transformations over schema representations coupled with value-level bidirectional lenses for document migration. When applying these two-level programs to particular schemas, we employ an existing algebraic rewrite system to optimize the automatically-generated lens transformations, and compile them into Haskell bidirectional executables. We discuss particular examples involving the generic evolution of recursive XML Schemas, and compare their performance gains over non-optimized definitions. © 2012 Springer-Verlag.