Complexity results for elementary hornets

Authors:
Michael Köhler-Bußmeier;Frank Heitmann
Affiliations:
Department for Informatics, University of Hamburg, Hamburg, Germany;Department for Informatics, University of Hamburg, Hamburg, Germany
Venue:
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Year:
2013

Citing 10
Cited 0

Petri nets and algebraic specifications

Theoretical Computer Science
Fundamentals of Algebraic Specification I

Fundamentals of Algebraic Specification I
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. We have shown previously that the reachability problem for this class requires at least exponential space, which is a major increase when compared to safe, elementary object nets, which require polynomial space. Here, we show how a safe, elementary Hornets can be simulated by a safe Eos, which establishes an upper bound for the complexity, since we know that that the reachability problem for safe Eos is PSpace-complete.