Lecture 18Petri Nets 2

Table of Contents

Lecture 18Petri Nets 2

This Lecture

Reachability

Infinite Reachability Tree

Computing aFinite Reachability Tree

Simple Example

Finite Reachability Tree

Uses of Reachability Trees

Examples

Modeling Techniques: Durations

Modelling TechniquesProducer/Consumer: Shared Buffer

Producer/Consumer: Synchronous Message Passing

Modelling Techniques:Input Sources and Output Sinks

Modelling Techniques:Alternative Notations

Example (1)

Example (2)

Example (3)

Example (4)

Readers/Writers Problem

Readers/Writers Solution

Semaphores (1)

Semaphores

Dining Philosophers Problem

Dining Philosophers Solution

Dining Philosophers (contd)

Applications: PERT Charts (1)

PPT Slide

Flowcharts

ConcurrentProgramming

Extensions: Colored Petri Nets

Example

Extensions: Hierarchical Nets

Hierarchical Nets (continued)

Last slide

PPT Slide

PPT Slide

Reachability

Example (1)

Communication Protocols

Dining Philosophers Solution

Email: shawnh@cs.cmu.edu

Home Page: http://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15671-f97/www/index.html