We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we consider extensions of Petri nets with transfer and reset operations defined for black indistinguishable tokens (Affine Well-Structured Nets), extensions in which tokens carry pure names dynamically generated with special ν-t...

Abstract In the first part of this article we discuss the definition of Pand T–invariants for algebraic Petri nets. Thereby we stress the strong relation of these concepts with those for colored Petri nets. This part contains furthermore a comparison with the concepts defined in [Rei91], where first algebraic nets, invariant concepts and the main theorems concerning invariants have been present...

A method is presented for the robust design of ¯exible manufacturing systems (FMS) that undergo the forecasted product plan variations. The resource allocation and the operation schedule of a FMS are modeled as a colored Petri net and an associated transition ®ring sequence. The robust design of the colored Petri net model is formulated as a multi-objective optimization problem that simultaneou...

In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...

In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...