Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Emotions in organizations: A multi-level perspective

Recent years have seen an upsurge of interest in the study of emotions in organizations. Research, however, has been hampered by the ephemeral nature of emotions and a lack of an integrated multi-level model. This article therefore presents a five-level model of emotions in organizations. At the lowest level is within-person variation, defined in terms of affective events theory. Levels of the model then proceed through individual, dyadic relationship, group, and organization-wide perspectives. The article also outlines the neurophysiological processes that underlie the experience, perception, and communication of emotion; it concludes with a discussion of implications for research and practice.