Boundedness of adaptive nets is decidable

Authors:
Olivia Oanea
Affiliations:
Universität Rostock, Institut für Informatik, 18051 Rostock, Germany
Venue:
Information Processing Letters
Year:
2011

Citing 9
Cited 0

Some Decidability Results for Nested Petri Nets

PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Recursive Petri nets: Theory and application to discrete event systems

Acta Informatica
Checking Properties of Adaptive Workflow Nets

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
The Reachability Problem for Object Nets

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Hornets: Nets within Nets Combined with Net Algebra

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Nested Petri nets for adaptive process modeling

Pillars of computer science
Soundness of workflow nets: classification, decidability, and analysis

Formal Aspects of Computing
Nested nets for adaptive systems

ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Adaptive workflow nets for grid computing

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.89

Visualization

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.