Wyniki wyszukiwania - BazTech

Ograniczanie wyników

4 Fundamenta Informaticae

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: object Petri-net

Sortuj według:

Ogranicz wyniki do:

Safeness for Object Nets

Köhler-Bußmeier M., Heitmann F.

Fundamenta Informaticae

2010

Vol. 101, nr 1/2

29-43

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.

Decidability Problems of a Basic Class of Object Nets

Dietze R., Kudlek M., Kummer O.

Fundamenta Informaticae

2007

Vol. 79, nr 3-4

295-302

It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dickson's Lemma for a certain class of multisets, and a modified Karp Miller algorithm, is applied. This presents another class of nets with different decidability behaviour for reachability and boundedness.

Separation of Control and Data Flow in High-Level Petri Nets: Transforming Dual Flow Nets into Object Petri Nets

Farwer B., Varea M.

Fundamenta Informaticae

2006

Vol. 72, nr 1-3

123-137

This paper summarises two approaches, Dual Flow Nets (DFN) and Object Petri Nets (OPN), and offers a translation mechanism between them. While the DFN model tackles the separation of control and data flow computing aspects, the OPN model has a more generalised structure. The separation between control and data flow can enhance the readability of models, and allows different tools to operate on distinct parts of the model. The aim of this paper is to show how the modelling based on control/data-flow analysis can benefit from an object-based Petri net approach. Tool support and a translation mechanism that is faithful are presented, giving an extra dimension (hierarchy) to the existing paradigm of control and data flow interacting in a model. Our methodology provides a comprehensive separation of these two parts, which can be used to feed analysis or synthesis tools, while still being able to reason about both parts through formal methods of verification.

A New Synchronisation Model for Multi-Level Object Petri Nets

Farwer B., Kudlek M.

Fundamenta Informaticae

2004

Vol. 60, nr 1-4

131--142

The present paper continues work from [7]. One goal of this work is to find a class of (object) Petri nets of lesser power than Turing machines, such that there exists a universal Petri net within that class. Another goal is to surpass the restricted synchronisation of transitions in object and system nets in the case of value semantics. Finally, an encoding of the proposed class of object Petri nets into linear logic Petri nets (LLPNs) is given, which directly leads to a specification that can be model-checked by existing tools.