Sciweavers

Share
FUIN
2007

Decidability Problems of a Basic Class of Object Nets

12 years 1 months ago
Decidability Problems of a Basic Class of Object Nets
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. Keywords : Object Petri nets, multiset rewriting, Dickson’s lemma, Karp Miller algorithm
Roxana Dietze, Manfred Kudlek, Olaf Kummer
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2007
Where FUIN
Authors Roxana Dietze, Manfred Kudlek, Olaf Kummer
Comments (0)
books