In: Paris, Orsay, Diplom-Thèse. 1990.
Abstract: Modularity is an important feature when treating concurrent systems, necessary for their analysis (placement, partial proofs,...) and crucial for the readability and provability of the adequacy of their semantics. First we present an overview of possible models in terms of high level Petri net classes including algebraic Petri nets, Petri net systems, and CO-OPN. Then we study their power and their structuration properties by giving complete semantics to actor languages in each model. We show that we need the possiblity to formalize data structures when modeling formally the semantics of such complex languages. Also it is not sufficient to have a non structured formalism like algebraic nets to keep, in the modeling, informations on modularity. We conclude that CO-OPN is the most general and adequat formalism. As an alternative approach, we improve the Petri net systems formalism, which is already structured, by adding algebraic specifications. The resulting class of nets, called Algebraic Petri net systems, is finally compared with the class of CO-OPN nets.