Invariant property preserving extensions of elementary Petri nets

نویسنده

  • Sibylle Peuker
چکیده

We deene an extension of an elementary Petri net and give a suucient criterion for the preservation of invariant properties. Properties of a net are described by propositional temporal formulas. An elementary Petri net is an extension of another net if the smaller net can be embedded into the larger one by an injective function that maps places on places and transitions on transitions. It is shown that every extension preserves the static properties of the net, viz. the properties expressable in rst order propositional logic. The criterion for the preservation of invariant properties is that the embedding function preserves the pre-and postset of places. That means that the ow relation of the smaller net is preserved and furthermore that only the image of a transition can have a larger pre-or postset in the extension than its soure in the original net.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen

The topic of this PhD thesis is the stepwise refinement of distributed algorithms. Stepwise refinement starts with a simple algorithm with certain desired properties. This algorithm is refined step by step such that the desired properties are preserved in each refinement step. The result is a complex distributed algorithm which satisfies concrete implementation requirements and which still has ...

متن کامل

Object Petri Nets: Definitions, Properties, and Related Models

In this presentation the decidability issues of formalisms that allow Petri nets as tokens are studied. Especially for “elementary object-net systems” defined by Valk the decidability of the reachability and the boundedness problem is considered. It is shown that reachability becomes undecidable while boundedness remains decidable for elementary object-net systems. Furthermore it is shown that ...

متن کامل

A Survey of Elementary Object Systems Part I: Decidability Results

This contribution presents the formalism of Elementary Object Systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach known as the nets-within-nets paradigm. Since object nets in general are immediately Turing complete, we introduce the restricted class of elementary object nets which restrict the nesting of nets to the depth of two. In this work we study the rel...

متن کامل

A Survey of Elementary Object Systems

This contribution presents the formalism of Elementary Object Systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach known as the nets-within-nets paradigm. One central aim of this contribution is to compile all our previous works dedicated to certain aspects of Eos together with recent yet unpublished results within one selfcontained presentation. Since object ...

متن کامل

Elementary Siphons of Petri Nets and Deadlock Control in FMS

For responsiveness, in the Petri nets theory framework deadlock prevention policies based elementary siphons control are often utilized to deal with deadlocks caused by the sharing of resources in flexible manufacturing system (FMS) which is developing the theory of efficient strict minimal siphons of an S3PR. Analyzer of Petri net models and their P-invariant analysis, and deadlock control are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997