Abstract
In this chapter a basic model is introduced by extracting information from an intuitive example, given in this section. By doing this some essential features of Petri nets will appear, namely the principles of locality, concurrency, graphical and algebraic representation. For illustration we choose an example where several objects are subject to a coordination procedure. Similar examples can be found in various other fields, e.g. from computer integrated manufacturing to office automation. In our example, a race among a number of cars is started. When the starter receives ready signs from all cars, he gives the starting signal and the cars begin the race. For simplicity, we restrict the example to one starter and two racing cars (Figure 2.1) .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Valk, R. (2003). Essential Features of Petri Nets. In: Petri Nets for Systems Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05324-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-05324-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07447-9
Online ISBN: 978-3-662-05324-9
eBook Packages: Springer Book Archive