A lot of research is being done to directly apply to high level nets structural techniques similar to those existing for place transition nets. In particular, the question of computing siphons for high level nets is of interest since the well known results about relations between liveness of a net and control of its siphons. In this paper, we show how one can derive an efficient computing of siphons containing a given place from an appropriate interpretation of algebraic Petri nets in rewrite logic as true concurrency semantics. Within this method the verification procedure of symbolic siphons is reduced to two easy understandable inference rewrite rule instead to a completeness problem as in recent approach of K. Schmidt. Moreover the proposed methods can be implemented using rewriting techniques.