The paper addresses the problem of analysis of alternatives in the design of 
distributed real-time systems. In the design of such a system, a hardware 
architecture needs to be chosen; then the system algorithm must be mapped onto 
the chosen architecture. As a result, the design space is very large, and 
evaluation of alternatives is very expensive.
We propose an approach to an approximate analysis of alternative design decisions,
which allows to eliminate infeasible solutions faster.