2,162 research outputs found
Metamodel-based model conformance and multiview consistency checking
Model-driven development, using languages such as UML and BON, often makes use of multiple diagrams (e.g., class and sequence diagrams) when modeling systems. These diagrams, presenting different views of a system of interest, may be inconsistent. A metamodel provides a unifying framework in which to ensure and check consistency, while at the same time providing the means to distinguish between valid and invalid models, that is, conformance. Two formal specifications of the metamodel for an object-oriented modeling language are presented, and it is shown how to use these specifications for model conformance and multiview consistency checking. Comparisons are made in terms of completeness and the level of automation each provide for checking multiview consistency and model conformance. The lessons learned from applying formal techniques to the problems of metamodeling, model conformance, and multiview consistency checking are summarized
Fredkin Gates for Finite-valued Reversible and Conservative Logics
The basic principles and results of Conservative Logic introduced by Fredkin
and Toffoli on the basis of a seminal paper of Landauer are extended to
d-valued logics, with a special attention to three-valued logics. Different
approaches to d-valued logics are examined in order to determine some possible
universal sets of logic primitives. In particular, we consider the typical
connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As
a result, some possible three-valued and d-valued universal gates are described
which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram
Completeness theory for the product of finite partial algebras
AbstractA general completeness criterion for the finite product ∏P(ki) of full partial clones P(ki) (composition-closed subsets of partial operations) defined on finite sets E(ki)(|E(ki)|⩾2,i=1,…,n,n⩾2) is considered and a Galois connection between the lattice of subclones of ∏P(ki), called partial n-clones, and the lattice of subalgebras of multiple-base invariant relation algebra, with operations of a restricted quantifier free calculus, is established. This is used to obtain the full description of all maximal partial n-clones via multiple-base invariant relations and, thus, to solve the general completeness problem in ∏P(ki)
TBell: A mathematical tool for analyzing decision tables
This paper describes the development of mathematical theory and software to analyze specifications that are developed using decision tables. A decision table is a tabular format for specifying a complex set of rules that chooses one of a number of alternative actions. The report also describes a prototype tool, called TBell, that automates certain types of analysis
Attribute Exploration of Gene Regulatory Processes
This thesis aims at the logical analysis of discrete processes, in particular
of such generated by gene regulatory networks. States, transitions and
operators from temporal logics are expressed in the language of Formal Concept
Analysis. By the attribute exploration algorithm, an expert or a computer
program is enabled to validate a minimal and complete set of implications, e.g.
by comparison of predictions derived from literature with observed data. Here,
these rules represent temporal dependencies within gene regulatory networks
including coexpression of genes, reachability of states, invariants or possible
causal relationships. This new approach is embedded into the theory of
universal coalgebras, particularly automata, Kripke structures and Labelled
Transition Systems. A comparison with the temporal expressivity of Description
Logics is made. The main theoretical results concern the integration of
background knowledge into the successive exploration of the defined data
structures (formal contexts). Applying the method a Boolean network from
literature modelling sporulation of Bacillus subtilis is examined. Finally, we
developed an asynchronous Boolean network for extracellular matrix formation
and destruction in the context of rheumatoid arthritis.Comment: 111 pages, 9 figures, file size 2.1 MB, PhD thesis University of
Jena, Germany, Faculty of Mathematics and Computer Science, 2011. Online
available at http://www.db-thueringen.de/servlets/DocumentServlet?id=1960
- …