lecture08 - Todays Lecture Introduce the Petri Net...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 8: Petri-Nets Kenneth M. Anderson Foundations of Software Engineering CSCI 5828 - Spring Semester, 2000 February 10, 2000 © Kenneth M. Anderson, 2000 2 Today’s Lecture • Introduce the Petri Net Formalism – Present several examples February 10, 2000 © Kenneth M. Anderson, 2000 3 Petri Nets N = {P,T,A,M 0 } , where P is a finite set of places T is a finite set of transitions A is a finite set of arcs (arrows) M 0 is the initial marking of N • Formal Definition February 10, 2000 © Kenneth M. Anderson, 2000 4 Graphical Representation In 1 In 2 Out 1 Out 2 CR 1 CR 2 Sem
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
February 10, 2000 © Kenneth M. Anderson, 2000 5 Graphical Representation place In 1 In 2 Out 1 Out 2 CR 1 CR 2 Sem February 10, 2000 © Kenneth M. Anderson, 2000 6 Graphical Representation place transition In 1 In 2 Out 1 Out 2 CR 1 CR 2 Sem February 10, 2000 © Kenneth M. Anderson, 2000 7 Graphical Representation arc place transition In 1 In 2 Out 1 Out 2 CR 1 CR 2 Sem February 10, 2000 © Kenneth M. Anderson, 2000 8 Graphical Representation arc token place transition In 1 In 2 Out 1 Out 2 CR 1 CR 2 Sem
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 7

lecture08 - Todays Lecture Introduce the Petri Net...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online