A system is introduced which automatically generates implementation code from the object and dynamic models of an application. We found that the behavior of active objects can well be represented by activity diagrams rather than state diagrams. The paper first explains our approach to convert state diagrams as well as activity diagrams into implementation code. The paper then describes our syst...

This paper establishes the impact of topological and graphical properties on the comprehension of Euler diagrams. To-date, various studies have examined the impact of individual properties of Euler diagrams, such as curve shape and orientation. This has allowed us to establish guides for using these properties such as ‘draw Euler diagrams with circles’ and ‘draw Euler diagrams without regard to...

Voronoi diagrams and Delaunay triangulations have been extensively used to represent and compute geometric features of point configurations. We introduce a generalization to poset diagrams and poset complexes, which contain order-k and degree-k Voronoi diagrams and their duals as special cases. Extending a result of Aurenhammer from 1990, we show how to construct poset diagrams as weighted Voro...

Spider diagrams combine and extend Venn diagrams and Euler circles to express constraints on sets and their relationships with other sets. These diagrams can usefully be used in conjunction with object-oriented modelling notations such as the Unified Modelling Language. This paper summarises the main syntax and semantics of spider diagrams and introduces four inference rules for reasoning with ...

In recent years, a number of authors have started studying Aristotelian diagrams containing metalogical notions, such as tautology, contradiction, satisfiability, contingency, strong and weak interpretations of (sub)contrariety, etc. The present paper is a contribution to this line of research, and its main aims are both to extend and to deepen our understanding of metalogical diagrams. As for ...

Linear diagrams have recently been shown to be more effective than Euler diagrams when used for set-based reasoning. However, unlike the growing corpus of knowledge about formal aspects of Euler and Venn diagrams, there has been no formalisation of linear diagrams. To fill this knowledge gap, we present and formalise Point and Line (PaL) diagrams, an extension of simple linear diagrams containi...

Most formal approaches to the veriication of temporal properties of reactive programs infer temporal conclusions from veriication conditions that are state formulas, i.e., contain no temporal operators. These proofs can often be eeectively presented by the use of veriica-tion diagrams. In this paper, we present a self-contained presentation of veriication diagrams for proving various temporal p...

1 Introduction Typically, UML is used in the early software development phases. Use-case diagrams serve for requirements analysis. During object-oriented analysis and design, the different use-cases are refined by a number of scenarios using sequence diagrams, collaboration diagrams or activity diagrams. In more elaborated cases, state-charts may be used to specify exact (object) behaviour. In ...

A new kind of a decision diagrams are presented: its nodes correspond to all types of nonsingular expansions for groups of input variables, in particular pairs. The diagrams are called the Linearly Independent (LI) Decision Diagrams (LI DDs). There are 840 nonsigular expansions for a pair of variables, thus 840 different types of nodes in the tree. Therefore, the number of nodes in such (exact)...

In Section 5.4, we have developed a functional formalism to find all connected vacuum diagrams and their multiplicities. These serve as a basis for deriving all diagrams contributing to two-and four-point functions. This is done by removing from the connected vacuum diagrams one line and two lines, respectively. Instead of the two lines we may also remove a vertex, as pointed out in Section 5.5...