The paper describes an approach to modeling telecommunication systems and processes of data transmission based on Boolean-valued networks. Models to address two specific problems of networksecurity are offered. It is possible to adapt existing algorithms of graph theory to apply them in this approach. Thus, it becomes possible to take into account not only quantitative but also qualitative measure of information in solving urgent network problems.

A definition of a maximum flow in Boolean-valued networks and an algorithm to find this flow were proposed. Two examples to demonstrate the described models and algorithms are also presented in the paper.