Decidability Problems of a Basic Class of Object Nets

Authors:
Roxana Dietze;Manfred Kudlek;Olaf Kummer
Affiliations:
Department Informatik, MIN-Fakultät, Universität Hamburg Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. E-mail: {dietze,kudlek,kummer}@informatik.uni-hamburg.de;Department Informatik, MIN-Fakultät, Universität Hamburg Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. E-mail: {dietze,kudlek,kummer}@informatik.uni-hamburg.de;Department Informatik, MIN-Fakultät, Universität Hamburg Vogt-Kölln-Str. 30, D-22527 Hamburg, Germany. E-mail: {dietze,kudlek,kummer}@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Year:
2007

Citing 5
Cited 0

Gro¨bner bases: a computational approach to commutative algebra

Gro¨bner bases: a computational approach to commutative algebra
Boundedness of Reset P/T Nets

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Petri Nets as Token Objects: An Introduction to Elementary Object Nets

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Parallel program schemata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.