Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: object net

Sortuj według:

Ogranicz wyniki do:

On the Expressiveness of Communication Channels for Object Nets

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

Fundamenta Informaticae

2009

Vol. 93, nr 1-3

205-219

In this work we present object net systems, i.e. Petri nets with nets as token objects, which are equipped with channels that allow to transfer net-tokens in the vertical dimension of the nested marking. These channels are a modelling element powerful enough to describe a direct simulation of counter programs which shows that typical net problems like boundedness, coverability, and reachability are undecidable.

Modelling Global and Local Name Spaces for Mobile Agents Using Object Nets

Farwer B., Köhler M.

Fundamenta Informaticae

2006

Vol. 72, nr 1-3

109-122

While it often makes sense to use pointer-based semantics (sometimes called reference semantics) to model components of a system that are in close proximity, this kind of modelling becomes increasingly infeasible for distant components. The notion of distance here is to be seen relative with respect to the system being modelled. We use local and global name spaces to model the necessary paradigm shift for systems of communicating mobile agents. As a concrete example of modelling that requires discrimination of notions of proximity or distance, we study a scenario of mobile devices with wireless communications capabilities. The communication can be done directly between two agents or via a system of wireless network routers. To model such a system, we introduce object Petri nets that integrate both semantic paradigms found in the literature, i.e. reference semantics and value semantics. Formal definitions are given and some basic properties are proved.

Some Considerations on Higher-Order Petri Nets

Farwer B., Kudlek M., Misra K.

Fundamenta Informaticae

2003

Vol. 54, nr 2,3

185-193

This paper introduces higher-order Petri nets based on multiset rewriting. Some variations of the firing rule for high-level Petri nets following the nets-within-nets paradigm, i.e. allowing Petri nets as tokens, are discussed. All considerations keep in mind the possibile existence of a universal higher-order Petri net.