Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
The algebraic hierarchical decomposition of finite state automata can be applied wherever a finite system should be `understood' using a hierarchical coordinate system. Here ...
In modular approaches to specify concurrent systems a system is built up from components using various operators as e.g. the sequential, the parallel, or the choice (+) operator. U...
The aim of the given paper is development of a recursive approach for calculating the statistics of decimated realizations of a basic discrete-time signal, obtained by sampling a c...