Tutorial 4: 27th November 2019 Flashcards Preview

CS4052 Logic and Software Verification > Tutorial 4: 27th November 2019 > Flashcards

Flashcards in Tutorial 4: 27th November 2019 Deck (10)
Loading flashcards...
1
Q

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

A

!

2
Q

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

A

!

3
Q

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

A

!

4
Q

What are Petri net markings?

A

!

5
Q

How can you find which Petri net markings are reachable?

A

!

6
Q

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

A

!

7
Q

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

A

!

8
Q

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

A

!

9
Q

What is TCTL?

A

!

10
Q

How do you model written restrictions as TCTL properties?

A

!