In this paper we present a systematic translation algorithm that maps a software architecture model to rewriting logics. We consider a nowadays typical component-based software architecture model-SAM. SAM is a formal software architecture model that integrates two formalisms -- Petri Nets and Temporal Logic. Our goal is to effectively describe the component based software architecture model SAM using a rewriting based semantics. This algorithm is implemented in Maude, a high performance declarative programming language that supports membership and rewriting logics. The contribution of this paper is we defined the translation algorithm to rewriting logic to show an interleaving semantic matching between the behavior model Petri net and rewriting logic.