Home Random Page


CATEGORIES:

BiologyChemistryConstructionCultureEcologyEconomyElectronicsFinanceGeographyHistoryInformaticsLawMathematicsMechanicsMedicineOtherPedagogyPhilosophyPhysicsPolicyPsychologySociologySportTourism






Describe FDDI protocol. An example of parallel composition of TA. Parallel composition Timed Automata. Timed temporal Logic - structure of formulas

FDDI - the standard of data transmission in a local network.

In Idle location the station expects a token. GT is an action of get token – arrival of a token

Timer r considers time which passed after the last arrival of a token

After arrival of a token, h is appropriated value r and the timer r is dumped by location B

HPM station sends high-priority messages. It can last no more than 2 å.â. The station finishes transfer of high-priority messages or because they came to an end or because expired 2 å.â.

If passed more than 100 å.â. from the moment of acceptance of a token, the station comes back to the Idle mode. Otherwise it passes into the mode of transfer of low-priority messages.

In the LPM mode the station sends low-priority messages until they don't come to an end, but no more, than 100 å.â., then comes back to the Idle mode.

TA (Timed Automaton) is: the final machine gun (the marked system of transitions)

+fined number synchronous Real-time of hours (timers) (here x – the timer)

+ (perhaps) dumping of some hours on transitions a

+condition on transitions, depending on values of hour

States is a location + values of all parameters In the temporary machine gun hours are also parameters

An example of parallel composition of TA.

Interliving, alternation: The general action of boba of the machine gun is carried out at the same time (interaction of a rendezvous), and each of machine guns nezavisimovypolnyat the independent actions: the machine gun A - action and in locations of s and the machine gun B – internal transition from t' location

 

 

Define graph algorithms. Integer optimizations. Finite games. Tic-tack-toe

The Hamilton way is the way passing through each top of the count precisely on time. NP difficult problem

We enter additional tops, edges, tags in each top of the count

 

 


Date: 2016-01-03; view: 1812


<== previous page | next page ==>
Define comparison logics LTL and CTL. Difference LTL and CTL. Verification problem of Model Checking | Give an example for logical problems farmer, wolf, goat and cabbage. Solving the problems of farmer-wolf -goat cabbafe with spin
doclecture.net - lectures - 2014-2024 year. Copyright infringement or personal data (0.012 sec.)