Boundedness of adaptive nets is decidable
| Autor: | Olivia Oanea |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Discrete mathematics
Property (philosophy) Information processing Composition (combinatorics) Computer Science Applications Theoretical Computer Science Decidability Algebra TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Adaptive system Signal Processing Theory of computation Information Systems Mathematics |
| Zdroj: | Information Processing Letters. 111:738-743 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/j.ipl.2011.05.004 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect