Time exceptions in sequence diagrams

UML sequence diagrams partially describe a system. We show how the description may be augmented with exceptions triggered by the violation of timing constraints and compare our approach to those of the UML 2.1 simple time model, the UML Testing Profile and the UML profile for Schedulability, Performance and Time. We give a formal definition of time exceptions in sequence diagrams and show that the concepts are compositional. An ATM example is used to explain and motivate the concepts

Interacting Components

SystemCSP is a graphical modeling language based on both CSP and concepts of component-based software development. The component framework of SystemCSP enables specification of both interaction scenarios and relative execution ordering among components. Specification and implementation of interaction among participating components is formalized via the notion of interaction contract. The used approach enables incremental design of execution diagrams by adding restrictions in different interaction diagrams throughout the process of system design. In this way all different diagrams are related into a single formally verifiable system. The concept of reusable formally verifiable interaction contracts is illustrated by designing set of design patterns for typical fault tolerance interaction scenarios

Graphical modelling language for spycifying concurrency based on CSP

Introduced in this (shortened) paper is a graphical modelling language for specifying concurrency in software designs. The language notations are derived from CSP and the resulting designs form CSP diagrams. The notations reflect both data-flow and control-flow aspects of concurrent software architectures. These designs can automatically be described by CSP algebraic expressions that can be used for formal analysis. The designer does not have to be aware of the underlying mathematics. The techniques and rules presented provide guidance to the development of concurrent software architectures. One can detect and reason about compositional conflicts (errors in design), potential deadlocks (errors at run-time), and priority inversion problems (performance burden) at a high level of abstraction. The CSP diagram collaborates with objectoriented modelling languages and structured methods

Correctness of an STM Haskell implementation

A concurrent implementation of software transactional memory in Concurrent Haskell using a call-by-need functional language with processes and futures is given. The description of the small-step operational semantics is precise and explicit, and employs an early abort of conflicting transactions. A proof of correctness of the implementation is given for a contextual semantics with may- and should-convergence. This implies that our implementation is a correct evaluator for an abstract specification equipped with a big-step semantics

Canonical Phase Diagrams of the 1-D Falicov-Kimball Model at T=0

The Falicov-Kimball model of spinless quantum electrons hopping on a 1-dimensional lattice and of immobile classical ions occupying some lattice sites, with only intrasite coupling between those particles, have been studied at zero temperature by means of well-controlled numerical procedures. For selected values of the unique coupling parameter $U$ the restricted phase diagrams (based on all the periodic configurations of localized particles (ions) with period not greater than 16 lattice constants, typically) have been constructed in the grand-canonical ensemble. Then these diagrams have been translated into the canonical ensemble. Compared to the diagrams obtained in other studies our ones contain more details, in particular they give better insight into the way the mixtures of periodic phases are formed. Our study has revealed several families of new characteristic phases like the generalized most homogeneous and the generalized crenel phases, a first example of a structural phase transition and a tendency to build up an additional symmetry -- the hole-particle symmetry with respect to the ions (electrons) only, as $U$ decreases.Comment: 24 pages, 8 figures (not included