Location of Repository

On the Complexity of Safe, Elementary Hornets

By Michael Köhler-Bußmeier

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

Topics: Hornets, nets-within-nets, object nets, reachability, safeness 1 Hornets, Higher-Order Object Nets
Year: 2014
OAI identifier: oai:CiteSeerX.psu:10.1.1.417.2164
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ceur-ws.org/Vol-928/020... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.