Probabilistic transitions for P systems

In this paper we use the abstract syntax and the structural operational semantics of the P systems given in 1 ], and add probabilities to the rules and to the communication targets. We take into account the number of possible combinations of rules which can be applied in a computation step, as well as the consumption degree of the current resources.