A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Theories of random sets and fuzzy random sets are useful concepts which are frequently applied in scientific areas including information science, probability and statistics. In th...
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...