On the Complexity of the Reachability Problem for Safe, Elementary Hornets

Authors:
Michael Köhler-Bußmeier
Affiliations:
University of Hamburg, Department for Informatics, Vogt-Kölln-Straße 30, D-22527 Hamburg, Germany. koehler@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Year:
2014

Citing 11
Cited 0

Petri nets and algebraic specifications

Theoretical Computer Science
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Hornets: Nets within Nets Combined with Net Algebra

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
On the Expressiveness of Communication Channels for Object Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Nested Petri nets for adaptive process modeling

Pillars of computer science
Safeness for Object Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
High-level nets with nets and rules as tokens

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Liveness of Safe Object Nets

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

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Concurrency in Mobile Object Net Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the complexity of HORNETS, an algebraic extension of object nets. We define a restricted class: safe, elementary HORNETS, to guarantee finite state spaces. It will turn out, that the reachability problem for this class requires exponential space, which is a major increase when compared to safe, elementary object nets, which require polynomial space.