. . . "En th\u00E9orie des automates, un automate temporis\u00E9 est un automate fini dot\u00E9 d'un ensemble fini d'horloges \u00E0 valeurs r\u00E9elles. Au cours d'un calcul de l'automate, les valeurs des horloges augmentent toutes \u00E0 la m\u00EAme vitesse. Dans les transitions de l'automate, les valeurs d'horloges sont compar\u00E9es \u00E0 des entiers. Ces comparaisons constituent des gardes qui activent ou inhibent les transitions et imposent ainsi des contraintes aux comportements de l'automate. Les horloges peuvent \u00EAtre r\u00E9initialis\u00E9es. Les automates temporis\u00E9s ont \u00E9t\u00E9 introduits par Alur et Dill en 1994. Les auteurs ont re\u00E7u, pour cet article, le prix Alonzo Church 2016 de l'European Association for Theoretical Computer Science."@fr . . . "\u0422\u0435\u043C\u043F\u043E\u0440\u0430\u043B\u044C\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442[\u0443\u0441\u0442\u0430\u043B\u0435\u043D\u0438\u0439 \u0442\u0435\u0440\u043C\u0456\u043D?] \u0432 \u0442\u0435\u043E\u0440\u0456\u0457 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0456\u0432 \u2014 \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442, \u0440\u043E\u0437\u0448\u0438\u0440\u0435\u043D\u0438\u0439 \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u043E\u044E \u043C\u043D\u043E\u0436\u0438\u043D\u043E\u044E \u0433\u043E\u0434\u0438\u043D\u043D\u0438\u043A\u043E\u0432\u0438\u0445 \u0437\u043C\u0456\u043D\u043D\u0438\u0445. \u0413\u043E\u0434\u0438\u043D\u043D\u0438\u043A\u043E\u0432\u0456 \u0437\u043C\u0456\u043D\u043D\u0456 \u043F\u0440\u0438\u0439\u043C\u0430\u044E\u0442\u044C \u0434\u0456\u0439\u0441\u043D\u0456 \u0437\u043D\u0430\u0447\u0435\u043D\u043D\u044F \u0442\u0430 \u043F\u0440\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0456 \u0434\u043B\u044F \u0432\u0438\u043C\u0456\u0440\u0443 \u0447\u0430\u0441\u043E\u0432\u0438\u0445 \u0445\u0430\u0440\u0430\u043A\u0442\u0435\u0440\u0438\u0441\u0442\u0438\u043A. \u0422\u0435\u043C\u043F\u043E\u0440\u0430\u043B\u044C\u043D\u0456 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0438 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u044E\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u043C\u043E\u0434\u0435\u043B\u044E\u0432\u0430\u043D\u043D\u044F \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u0438\u0445 \u0441\u0438\u0441\u0442\u0435\u043C \u0440\u0435\u0430\u043B\u044C\u043D\u043E\u0433\u043E \u0447\u0430\u0441\u0443."@uk . "Automate temporis\u00E9"@fr . "In automata theory, a timed automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a timed automaton, clock values increase all with the same speed. Along the transitions of the automaton, clock values can be compared to integers. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. Further, clocks can be reset. Timed automata are a sub-class of a type hybrid automata."@en . . . "1121171891"^^ . . . . . . . . "\u0422\u0435\u043C\u043F\u043E\u0440\u0430\u043B\u044C\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442"@uk . "In automata theory, a timed automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a timed automaton, clock values increase all with the same speed. Along the transitions of the automaton, clock values can be compared to integers. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. Further, clocks can be reset. Timed automata are a sub-class of a type hybrid automata. Timed automata can be used to model and analyse the timing behavior of computer systems, e.g., real-time systems or networks. Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years. It has been shown that the state reachability problem for timed automata is decidable, which makes this an interesting sub-class of hybrid automata. Extensions have been extensively studied, among them stopwatches, real-time tasks, cost functions, and timed games. There exists a variety of tools to input and analyse timed automata and extensions, including the model checkers UPPAAL, , and the schedulability analyser TIMES. These tools are becoming more and more mature, but are still all academic research tools."@en . . . "35707540"^^ . . . . . . . . . . . . "\u0422\u0435\u043C\u043F\u043E\u0440\u0430\u043B\u044C\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442[\u0443\u0441\u0442\u0430\u043B\u0435\u043D\u0438\u0439 \u0442\u0435\u0440\u043C\u0456\u043D?] \u0432 \u0442\u0435\u043E\u0440\u0456\u0457 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0456\u0432 \u2014 \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u0438\u0439 \u0430\u0432\u0442\u043E\u043C\u0430\u0442, \u0440\u043E\u0437\u0448\u0438\u0440\u0435\u043D\u0438\u0439 \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u043E\u044E \u043C\u043D\u043E\u0436\u0438\u043D\u043E\u044E \u0433\u043E\u0434\u0438\u043D\u043D\u0438\u043A\u043E\u0432\u0438\u0445 \u0437\u043C\u0456\u043D\u043D\u0438\u0445. \u0413\u043E\u0434\u0438\u043D\u043D\u0438\u043A\u043E\u0432\u0456 \u0437\u043C\u0456\u043D\u043D\u0456 \u043F\u0440\u0438\u0439\u043C\u0430\u044E\u0442\u044C \u0434\u0456\u0439\u0441\u043D\u0456 \u0437\u043D\u0430\u0447\u0435\u043D\u043D\u044F \u0442\u0430 \u043F\u0440\u0438\u0437\u043D\u0430\u0447\u0435\u043D\u0456 \u0434\u043B\u044F \u0432\u0438\u043C\u0456\u0440\u0443 \u0447\u0430\u0441\u043E\u0432\u0438\u0445 \u0445\u0430\u0440\u0430\u043A\u0442\u0435\u0440\u0438\u0441\u0442\u0438\u043A. \u0422\u0435\u043C\u043F\u043E\u0440\u0430\u043B\u044C\u043D\u0456 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0438 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u044E\u0442\u044C\u0441\u044F \u0434\u043B\u044F \u043C\u043E\u0434\u0435\u043B\u044E\u0432\u0430\u043D\u043D\u044F \u0441\u043A\u0456\u043D\u0447\u0435\u043D\u043D\u0438\u0445 \u0441\u0438\u0441\u0442\u0435\u043C \u0440\u0435\u0430\u043B\u044C\u043D\u043E\u0433\u043E \u0447\u0430\u0441\u0443."@uk . "1"^^ . "En th\u00E9orie des automates, un automate temporis\u00E9 est un automate fini dot\u00E9 d'un ensemble fini d'horloges \u00E0 valeurs r\u00E9elles. Au cours d'un calcul de l'automate, les valeurs des horloges augmentent toutes \u00E0 la m\u00EAme vitesse. Dans les transitions de l'automate, les valeurs d'horloges sont compar\u00E9es \u00E0 des entiers. Ces comparaisons constituent des gardes qui activent ou inhibent les transitions et imposent ainsi des contraintes aux comportements de l'automate. Les horloges peuvent \u00EAtre r\u00E9initialis\u00E9es. Les automates temporis\u00E9s ont \u00E9t\u00E9 introduits par Alur et Dill en 1994. Les auteurs ont re\u00E7u, pour cet article, le prix Alonzo Church 2016 de l'European Association for Theoretical Computer Science. Les automates temporis\u00E9es peuvent \u00EAtre utilis\u00E9s pour mod\u00E9liser et analyser le comportement temporel de syst\u00E8mes informatiques, par exemple, des syst\u00E8mes ou des r\u00E9seaux op\u00E9rant en temps r\u00E9el. Des m\u00E9thodes pour v\u00E9rifier les propri\u00E9t\u00E9s de s\u00FBret\u00E9 et de vivacit\u00E9 ont \u00E9t\u00E9 d\u00E9velopp\u00E9es et \u00E9tudi\u00E9es depuis l'introduction des automates temporis\u00E9es en 1994. Un automate temporis\u00E9 accepte des mots temporis\u00E9s \u2014 des suites infinies o\u00F9 une valeur r\u00E9elle de moment d'occurrence est associ\u00E9 \u00E0 chaque symbole."@fr . . . . . "1"^^ . . . . "Timed automaton"@en . . "10093"^^ . . . .