Tutorial 4: 27th November 2019 Flashcards

Petri nets and timed automata

1
Q

How can you make a Petri net to model a given system?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How can you make a Petri net to model mutual exclusion?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do you find the reachability graph of a Petri net?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are Petri net markings?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How can you find which Petri net markings are reachable?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How can Petri nets modelling real systems be changed to allow for multiple instances at once?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What changes does allowing multiple instances of Petri net models to be present simultaneously give?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How do Petri nets modelling given real-world systems differ from TSes doing the same thing?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is TCTL?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How do you model written restrictions as TCTL properties?

A

!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly