## Cellular—neural computations: formal model

A formal model for the fine-grained parallel computations is presented, which combines the connectionist approach of Artificial Neuron Networks with the cellular -like communication structure. The model is based on the concepts and formalities of Parallel Substitution Algorithm, which is considered the most theoretically advanced generalization of Cellular Automaton. Principles...

## On compositional model checking in the modal Mu-calculus and its extension with multiple clocks

This paper includes several results concerning with compositional model checking (CMC) for finite-state systems with multiple clocks. We describe a model of time [6], and a method of reducing a timed (infinite) model to a finite untimed model. We also present a new Finite Process Algebra (FPA) and its...

## High-performance heterogeneous processing in concentrating computing system

In this paper the possibilities of organizing heterogeneous computing in so-called Combined Architecture systems consisting of a basic host subsystem (a massively parallel computer), and a set of high-performance specialized parallel coprocessors (hardware modules) executing the main workload are discussed. To optimize the choice of hardware modules, a classification of...

## On completeness of mechanism of annotation-directives

An annotated program is a program written down in a programming language extended by the annotations which are formalized comments in the basic programs and relevant for the semantics of the program can be described. The paper focuses on the completeness property of the directive mechanism for different kinds of...

## On parallel recursive mapping algorithm for pyramidal multiprocessor systems

A problem of mapping of an information graph of a complex algorithm into the pyramidal interprocessor network of a parallel computer system is considered. The parallel recursive algorithm for optimal or suboptimal solution of the mapping problem, the objective functions for mapping and experimental results for the pyramidal multiprocessor system...

## Effective representation of algorithm for finding a minimal spanning tree of a graph in associative parallel processor

In this paper we analyze two procedures for finding a minimal spanning tree of a graph for an abstract associative STAR-machine with bit-serial processing. These procedures are based on the Prim-Dijkstra algorithm and use different graph representations. We prove their correctness, evaluate their complexity and compare them. In addition, we...

## An investigation of equivalence notions on some subclasses of Petri nets

In this paper a variety of Petri net equivalences is examined. A correlation of all the considered equivalences is established, and a lattice of implications is obtained. In addition, the equivalences are treated for some subclasses of Petri nets: sequential nets, T-nets and nets with strict labelling.

## Modelling the semantics of coloured dataflow networks

Dataflow networks are a well-known mathematical tool extensively used for modelling and analyzing concurrent computing systems and their software. A few formal dataflow models reported in the literature may be amalgamated in two groups-static and dynamic. Static models allow at most one token on an arc. This assumption severely limits...