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

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

!

2

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

!

3

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

!

4

What are Petri net markings?

!

5

How can you find which Petri net markings are reachable?

!

6

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

!

7

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

!

8

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

!

9

What is TCTL?

!

10

How do you model written restrictions as TCTL properties?

!