Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Elementary Object Systems

Sortuj według:

Ogranicz wyniki do:

Liveness of Safe Object Nets

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

Fundamenta Informaticae

2011

Vol. 112, nr 1

73-87

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 problemfor safe EOS directly follows fromthe related result for safe p/t nets. We then devise a polynomial space algorithmfor this problem and indeed for every property that can be expressed in the temporal logic CTL.