PARTIALLY SYNCHRONOUS ALGORITHMS. PRESENTED BY: BINAMRA DUTTA. Deepest Distinctions among models based on timing assumptions, namely Synchronous Models Lock Step Synchronization with executions proceeding in synchronous steps.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
main task increments a counter count as long as a Boolean flag is false and the
number of tasks.
If acts(A), then (s, ,s’) trans(A’) exactly if all the following conditions hold
(a) If C, then s.first(C) s.now
(b) If C is enabled in both s.basic and s’.basic and C, then s.first(C) = s’.first(C)
and s.last( C ) = s’.last ( C ).
(c) If C is enabled in s’.basic and either C is not enabled in s.basic or C, then s’.first( C) = s.now + lower( C ) and s’.last( C ) = s.now + upper( C )
(d)) If C is not enabled in s’.basic, then s’.first( C ) =0 and s’.last( C ) =
If = (t), then (s, ,s’) trans(A’) exactly if all the following conditions hold:
(b) s’.first( C ) = s.first ( C ) and s’.last ( C ) = s.last ( C ).
Theorem – If (A,b) is any MMT timed automaton, then gen(A,b) is a general timed automaton. Moreover, attraces(A,b) = attraces(gen(A,B)).
Lemma – Following holds in any reachable state of gen(A,b) and for any task C of A