The aim of this work is to analyze the interval canonical representation for fuzzy QL-implications and automorphisms. Intervals have been used to model the uncertainty of a specialist’s information related to truth values in the fuzzy propositional calculus: the basic systems are based on interval fuzzy connectives. Thus, using subsets of the real unit interval as the standard sets of truth deg...

This paper presents Super State Analysis (SSA) for analyzing UML multiple state and sequence diagrams to detect the inconsistencies. SSA model uses transition set that captures relationship information that is not specifiable in UML diagrams. The SSA model uses the transition set to link transitions of multiple state diagrams together. The analysis generates three different sets automatically. ...

The paper discusses the application of state diagrams in UML to class testing. A set of coverage criteria is proposed based on control and data ow in UML state diagrams and it is shown how to generate test cases satisfying these criteria from UML state diagrams. First, control ow is identiied by transforming UML state diagrams into extended nite state machines (EFSMs). The hierarchical and conc...

We show how to transform UML (Uniied Modeling Language) state diagrams into graphs by making explicit the intended semantics of the diagram. The process of state expansion in nested state diagrams is explained by graph transformations in three steps: (1) adding boundary nodes introducing a precise interface for the state to be expanded, (2) expanding the state, and (3) removing the boundary nod...

Predicate-action diagrams, which are similar to standard state-transition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specification—and those descriptions then proved correct— even when the complete specification cannot be written as a diagram. We also use the diagrams to illustrate proofs...

in this note first by considering the notion of general fuzzy automata (for simplicity gfa), we define the notions of direct product, restricted direct product and join of two gfa. also, we introduce some operations on (fuzzy) sets and then prove some related theorems. finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given gfa....

Several object-oriented design methods make use of scenario diagrams (or interaction diagrams), i.e. descriptions of expected interaction between objects during an example run of a system. Such diagrams help the designer to understand the behavior of the participating objects, and eventually to specify their general behavior as state machines or as collections of methods. However, the step from...

Concurrent software for engineering computations consists of multiple cooperating modules. The behavior of individual modules is described by means on state diagrams. In the paper, the constraints on state diagrams are proposed, allowing for the specification of designer’s intentions as to the synchronization of modules. Also, the translation of state diagrams (with enforcement constraints) int...