By Louchka Popova-Zeugmann

ISBN-10: 3642411142

ISBN-13: 9783642411144

ISBN-10: 3642411150

ISBN-13: 9783642411151

At first look the techniques of time and of Petri nets are really opposite: whereas time determines the occurrences of occasions in a approach, vintage Petri nets think about their causal relationships and so they signify occasions as concurrent platforms. but when we take a better examine how time and causality are intertwined we become aware of that there are numerous attainable ways that time and Petri nets have interaction. This e-book takes a more in-depth examine 3 time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows.

The writer first explains vintage Petri nets and their basic homes. Then the pivotal contribution of the booklet is the creation of alternative algorithms that permit us to research time-dependent Petri nets. For Time Petri nets, the writer offers an set of rules that proves the behavioral equivalence of a web the place time is designed as soon as with actual and as soon as with ordinary numbers, so one can decrease the nation area and examine the integer states completely. For Timed Petri nets, the writer introduces time-dependent nation equations, offering a enough for the non-reachability of states, and she or he additionally defines a neighborhood transformation for changing those nets into Time Petri nets. eventually, she exhibits that Petri nets with time-windows be ready to become aware of each transition series fired within the internet omitting time restrictions.

These periods of time-dependent Petri nets express that point by myself doesn't swap the facility of a Petri web, in reality time may well or will not be used to strength firing. For Time Petri nets and Timed Petri nets we will say that they're Turing-powerful, and hence extra robust than vintage Petri nets, simply because there's a compulsion to fireplace sooner or later in time. against this, Petri nets with time-windows don't have any compulsion to fireplace, their expressiveness strength is below that of Turing-machines.

This e-book derives from complex lectures, and the textual content is supported all through with examples and workouts. it's compatible for graduate classes in desktop technological know-how, arithmetic, engineering, and similar disciplines, and as a reference for researchers.