منابع مشابه
On the hierarchy of Petri net languages
— We prove Jtn {D[*) £ M (£>!*), where I>î* is the one-sided Dyck language, and discuss some old and new resuits concerning Pétri net languages. The above resuit shows that Pétri nets without X-labeled transitions are less powerful thon gênerai nets as regards their firing séquences since the class S£\ of gênerai Pétri net languages {Hack [13]) is identical with Aî^D'?), and the class ^Sf^ of c...
متن کاملSome Results on Petri Net Languages
We compare various classes of Petri net languages. We present a new constructive proof of the equivalence, from the point of view of descriptive power, of “general” Petri nets and “restricted” Petri nets (no multiple arcs nor self-loops are allowed in the latter class). We also comment on the descriptive power of Petri nets versus that of finitely recursive processes.
متن کاملCharacterization of Petri Net Languages
This work treats the relationship between Petri Nets and languages. In 2003, Darondeau solved the Petri Net synthesis problem for a certain class of languages, i. e. for a given language L of this class he constructed a Petri Net generating the least Petri Net language containing L. Furthermore, he developed a decision procedure which tests for equality of these two languages. It is proved here...
متن کاملPetri Net Languages and Infinite Subsets of
Families of Petri net languages are usually defined by varying the type of transition labeling and the class of subsets of N to be used as sets of final markings (m is the number of places). So far three main classes of subsets have been studied: the trivial class containing as single element N, the class of finite subsets of N, and the class of ideals (or covering subsets) of N. In this paper ...
متن کاملThe Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability problem of Petri nets. In particular, we rely on Lambert’s construction of marked graph transition sequences — special instances of coverability graphs that allow us to extract constructively the simple regular express...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1977
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(77)80013-2