Exercise Sheet 5 Problem 1: Lamport's Mutual Exclusion Algorithm ...
Exercise Sheet 5 Problem 1: Lamport's Mutual Exclusion Algorithm ...
Exercise Sheet 5 Problem 1: Lamport's Mutual Exclusion Algorithm ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Problem</strong> 3: Configurations and Firing SequencesLet C = {e 1 , . . . , e n } be a configuration with normal event ordering: i < j if e i < e j . Prove thate 1 . . . e n is a possible firing sequence in the unfolding, producing the marking ({e ⊥ } • ∪ C • )\ • C.<strong>Problem</strong> 4: Unfoldings, Configurations, and CutsConsider the Petri net depicted below:(a) unfold the Petri net and outline one of its prefixes;(b) describe/list all the configurations and cuts of your unfolding.p 1 p 2t 1 t 2p 3t 3p 4 p 5t 4p 6 p 7Why is your unfolding finite?
Change language