Marked Graphs (Event Graphs)

Description:

Marked or event graphs are Petri Nets with the following restriction: each place can have at most one input and one output with each arc weighing 1. Thus we can eliminate places altogether identify transitions with events and end up with a simple event graph - an analog of state automaton.

Another names commonly used for those is a classical task graph.

Formal Definition:

A Marked or Event Graph is a 4-tuple

(I, E, f, e₀)

where

I – is an input set of time durations

E – is a finite set of events

f – is an event transition function.

e₀ – is initial event.

Examples:

References:

1. K.Kant, Introduction to computer system performance evaluation, McGraw-Hill, 1992.