Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Special Issue on Concurrency Specification and Programming (CS&P)
Article type: Research Article
Authors: Dietze, Roxana | Kudlek, Manfred | Kummer, Olaf
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
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.
Keywords: Object Petri nets, multiset rewriting, Dickson's lemma, Karp Miller algorithm
Journal: Fundamenta Informaticae, vol. 79, no. 3-4, pp. 295-302, 2007
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]