Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: multiset rewriting

Sortuj według:

Ogranicz wyniki do:

Decidability Problems of a Basic Class of Object Nets

Dietze R., Kudlek M., Kummer O.

Fundamenta Informaticae

2007

Vol. 79, nr 3-4

295-302

It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dickson's Lemma for a certain class of multisets, and a modified Karp Miller algorithm, is applied. This presents another class of nets with different decidability behaviour for reachability and boundedness.

Some Considerations on Higher-Order Petri Nets

Farwer B., Kudlek M., Misra K.

Fundamenta Informaticae

2003

Vol. 54, nr 2,3

185-193

This paper introduces higher-order Petri nets based on multiset rewriting. Some variations of the firing rule for high-level Petri nets following the nets-within-nets paradigm, i.e. allowing Petri nets as tokens, are discussed. All considerations keep in mind the possibile existence of a universal higher-order Petri net.