Please solve

Q1: Explain using illustrations the difference between classical automata and timed automata?

1. Write down the formal specification of clock continent?

2. Write the formal definition of an edge in a timing automaton with a finite

number of states S

3. What is location invariant and how is it different from clock constraint in

terms of functionality?

Q2: State-Chart uses shared memory for communication. Explain the advantages and disadvantages of shared memory communication for the design of local embedded system?

Q3: How is hierarchy modeled in a State-Chart and explain with illustrations of the hierarchical levels in CFSMs?

1. Explain the difference between Basic States and Super States?

2. Explain with illustrations, how concurrency modeled in State-Charts

3. Explain how exceptions are handled in CFSMs using appropriate

illustrations?

Q4: Are State-Chart determinate?

1. How are deadlocks resolved in state-chart?

2. Explain the 3-phase edge evaluation State-Chart semantics

3. How is the 3-phase edge evaluation State-Chart semantics make the

State-Chart determinate? Justify your answer using illustrations

Q5: Explain the main difference between synchronous and asynchronous programing languages?

Q6: Using appropriate illustrations explain the difference between synchronous and asynchronous message passing?