V originále
P systems are powerful computational devices, whose structure and functionality are inspired by living cells and organisms. P colonies are one of the types of P systems working with objects. They are formed from one-membrane agents placed in the shared environment and they use very simple rules. It was proved that P colonies are computationally complete devices. In the paper, we investigate the application of P colonies to simulate logical operators. It is obtained in a constructive way. In the first steps we show the construction of P colonies that can simulate the functioning of the logic gates – NOT, AND, OR, XOR, NOR and NAND, in the second step we show how to combine them to obtain Boolean circuits. These results demonstrate the method of logic circuits construction that work in a maximally parallel manner with extremely simple particles - membrane agents. In the work, we also discuss using different types of P colonies (restricted, homogeneous and 2D P colonies) for simulation of such circuits.