An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
PN2: An Elementary Model for Design and Analysis of Multi-agent Systems
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
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
Petri Nets as Token Objects: An Introduction to Elementary Object Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Theoretical Aspects of Recursive Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Modelling the Structure and Behaviour of Petri Net Agents
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Concurrency in mobile object net systems
Fundamenta Informaticae - Concurrency specification and programming
Decidability Problems of a Basic Class of Object 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
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
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
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
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
Conservative Elementary Object Systems
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
Hi-index | 0.00 |
In this paper we discuss the concept of safeness for Elementary Object Nets (EOS). Object nets are Petri nets which have Petri nets as tokens - an approach known as the nets-within-nets paradigm. Object nets are called elementary if the net system has a two levelled structure. The well known p/t nets can be considered as a special case of EOS. For p/t nets the concept of safeness means that there is at most one token on each place. Since object nets have nested markings there are different possibilities to generalise this idea for EOS. In this paper we define different variants of EOS safeness, discuss their relationships, show that they all coincide for p/t-like EOS, and address the complexity of well known Petri net problems like reachability and liveness for this new class of object nets.