Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: integer state

Sortuj według:

Ogranicz wyniki do:

Time Petri nets state space reduction using dynamic programming

Popova-Zeugmann L.

Control and Cybernetics

2006

Vol. 35, no 3

721-748

In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is denned in a discrete way by using the reachable integer-states of the TPN.

Analyzing paths in Time Petri Nets

Popova-Zeugmann L., Schlatter D.

Fundamenta Informaticae

1999

Vol. 37, Nr 3

311-327

In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the mni/max path passes only integer-states. A necessary condition for the reachability of an arbitrary state is given.