06.11.2014 Views

GRAFCET and Petri Nets Outline Introduction GRAFCET - EPFL

GRAFCET and Petri Nets Outline Introduction GRAFCET - EPFL

GRAFCET and Petri Nets Outline Introduction GRAFCET - EPFL

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Evolution rules<br />

p 1 p 2 p 3<br />

2<br />

Exercise - syntax<br />

For each of the graphs below, answer the following questions:<br />

1. Is it a PN ? 2. What are the validated transitions ?<br />

3. What will be the marking after firing ? 4. What are the validated transitions<br />

t 1<br />

t 2<br />

2<br />

p 4 p 5<br />

p 1 p 2 p 3<br />

p 1 p 2 p 3<br />

A B C D E<br />

2<br />

2<br />

t 1<br />

t 2<br />

t 1<br />

t 2<br />

2<br />

2<br />

p 4 p 5<br />

p 4 p 5<br />

F G H I<br />

Real-Time Programming <strong>GRAFCET</strong> <strong>and</strong> <strong>Petri</strong> nets 73<br />

© J.-D. Decotignie, 2007<br />

Real-Time Programming <strong>GRAFCET</strong> <strong>and</strong> <strong>Petri</strong> nets 74<br />

© J.-D. Decotignie, 2007<br />

Exercise – syntax (2)<br />

PN types<br />

For each of the graphs below, answer the following questions:<br />

1. Is it a PN ? 2. What are the validated transitions ?<br />

3. What will be the marking after firing ? 4. What are the validated transitions<br />

Generalized PNs<br />

There a weight on each arc<br />

Can be transformed into ordinary PN<br />

PNs with predicates<br />

Cannot be transformed into ordinary PN<br />

J K L<br />

Marc<br />

X<br />

Y father of X t 1<br />

Y<br />

X<br />

t 1<br />

Y<br />

Luc<br />

Real-Time Programming <strong>GRAFCET</strong> <strong>and</strong> <strong>Petri</strong> nets 75<br />

© J.-D. Decotignie, 2007<br />

Real-Time Programming <strong>GRAFCET</strong> <strong>and</strong> <strong>Petri</strong> nets 76<br />

© J.-D. Decotignie, 2007

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!