Flashcards in Tutorial 2: 6th November 2019 Deck (7)
How do you represent processes as program graphs?
How do you combine two program graphs into a single transition system?
How do you find the reachable parts of a transition system?
How can you determine whether mutual exclusion in a transition system of multiple joined TSes or PGs?
How do you make TSes from verbal descriptions of compute systems and their requirements?
How do you perform parallel composition on TSes?