Tutorial 2: 6th November 2019 Flashcards
1
Q
How do you represent processes as program graphs?
A
!
2
Q
How do you combine two program graphs into a single transition system?
A
!
3
Q
How do you find the reachable parts of a transition system?
A
!
4
Q
How can you determine whether mutual exclusion in a transition system of multiple joined TSes or PGs?
A
!
5
Q
How do you make TSes from verbal descriptions of compute systems and their requirements?
A
!
6
Q
How do you perform parallel composition on TSes?
A
!
7
Q
How did we implement the additional LTL oeprator “release”?
A
!
