| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429034 | Information Processing Letters | 2011 | 6 Pages |
Abstract
Boundedness is a relevant property for adaptive systems: creation, composition and destruction of components at runtime introduce different infiniteness dimensions. In this paper we show the decidability of the boundedness for adaptive nets, a subclass of nested nets enhanced with subprocess composition.
► Adaptive nets introduce the net size unboundedness dimension to nested nets. ► Boundedness of an adaptive nets is reducible to properties of a colored net over finite domain. ► Boundedness for adaptive nets is decidable.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Olivia Oanea,