We present an algebra of discrete timed input/output automata that execute in the context of different clock granularities — timed machines — as models of systems that can be dynamically interconnected at run time in a heterogeneous context. We show how timed machines can be refined to a lower granularity of time and how timed machines with different clock granularities can be composed. We prop...

The goal of a generative syntactic module is to create linguistic objects that connect sound to meaning. Therefore, a basic structure building operation is needed that combines syntactic objects into more complex objects. In the Minimalist Program (Chomsky 1995) this operation is called Merge. At first sight, both the existence and the working of Merge are close to being trivial, but on nearer ...

Software reliability growth models (SRGMs) are inadequate to assess the reliability of modern, heterogeneous, component–based software systems since these models treat the system as a black box and model its input/output behavior without looking into its internal structure. Development of techniques to assess the reliability of a component–based software system (which may be assembled from a va...

We present a neural net based implementation of propositional [0, 1]-valued multiadjoint logic programming. The implementation needs some preprocessing of the initial program to transform it in a homogeneous program; then, transformation rules carry programs into neural networks, where truth-values of rules relate to output of neurons, truth-values of facts represent input, and network function...

Converting a conventional contract into an electronic equivalent that can be executed and enforced by computers is a challenging task. The difficulties are caused by the ambiguities that the original humanoriented text is likely to contain. The conversion process involves the conversion of the original text into mathematical notation. This paper discusses how standard conventional contracts can...

In this paper, the memory capacity of incompletely connected associative memories is investigated. First, the capacity is derived for memories with fixed parameters. Optimization of the parameters yields a maximum capacity between 0.53 and 0.69 for hetero-association and half of it for autoassociation improving previously reported results. The maximum capacity grows with increasing connectivity...

A parametric analysis is an analysis whose input and output are parametrized with a number of parameters which can be instantiated to abstract properties after analysis is completed. This paper proposes to use Cousot and Cousot’s Cardinal power domain to capture functional dependencies of analysis output on its input and obtain a parametric analysis by parametrizing a non-parametric base analys...

This paper considers a synthesis of output regulation controllers which keep the controlled outputs within the prescribed bounds The controller is designed so that the closed loop system is equal or similar to the target system with an appropriate input output relationship An H norm is used as an object function to measure a di erence betw een them The controller is obtained by minimizing the o...

We present an analysis of the work of human participants in addressing design problems by analogy. We describe a computer program, called Galatea, that simulates the visual input and output of four experimental participants. Since Galatea is an operational computer program, it makes specific commitments about the visual representations and reasoning it uses for analogical transfer. In particula...

In program comprehension, developers often spend a lot of time for the investigation of input/output during an execution of a method. In Java program, input for a method includes arguments, fields and class variables. To identify fields and class variables used by a method, developers must invetigate all methods which may be called from the method. In this paper, we propose a tool for visualizi...