Liveness of Safe Object Nets

Authors:
Michael Köhler-Bußmeier;Frank Heitmann
Affiliations:
(Correspd.) University of Hamburg, Department for Informatics, Vogt-Kölln-Straße 30, D-22527 Hamburg. koehler@informatik.uni-hamburg.de;University of Hamburg, Department for Informatics, Vogt-Kölln-Straße 30, D-22527 Hamburg. koehler@informatik.uni-hamburg.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2011

Citing 11
Cited 4

Nested petri nets - a formalism for specification and verification of multi-agent distributed systems

Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
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
Theoretical Aspects of Recursive Petri Nets

Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Name Creation vs. Replication in Petri Net Systems

Fundamenta Informaticae - PETRI NETS 2007
On the Expressiveness of Communication Channels for Object Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Modelling mobility and mobile agents using nets within nets

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Safeness for Object Nets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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
High-level nets with nets and rules as tokens

ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Modelling mobility with petri hypernets

WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques

P- and t-systems in the nets-within-nets-formalism

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Complexity results for elementary hornets

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
On Compositionality of Boundedness and Liveness for Nested Petri Nets

Fundamenta Informaticae - Concurrency Specification and Programming CS&P
On the Complexity of the Reachability Problem for Safe, Elementary Hornets

Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the complexity of the liveness problem for safe Elementary Object Nets (EOS). Object nets are Petri nets which have Petri nets as tokens. They are called elementary if the net system has a two levelled structure. The concept of safeness bounds the number of tokens which may reside on a place. PSPACE-hardness of the liveness problem for safe EOS directly follows from the related result for safe p/t nets. We then devise a polynomial space algorithm for this problem and indeed for every property that can be expressed in the temporal logic CTL.