scholarly journals Language Preservation Problems in Parametric Timed Automata

Author(s):  
Étienne André ◽  
Nicolas Markey
Author(s):  
Oleg Pustovalov

The territory of Trekhrechiye is the Region of Three Rivers (Sanhe, the District of Hulunbuir, Inner Mongolia, the People's Republic of China). This territory is subject to scientific study by historians and philologists. The research objects of this article are language aspects of modern Trekhrechiye. The aim of the study is to describe language competence of the Russian settlers’ descendants, who live now in the Region of Three Rivers, that place became mass residential centre of the Russian people in the XX century. Moreover, it is important to show dynamics of the people’s competences of the Russian language throughout the entire period of the Russian presence there. The description of the language competence of the Russian settlers’ descendants of different generations is based on the results of scientific expedition to the Region of Three Rivers. The expedition took place in 2017–2018 and was undertaken by the author. It allowed the author to monitor the extent of the Russian language preservation in different generations.


2011 ◽  
Vol 34 (8) ◽  
pp. 1365-1377 ◽  
Author(s):  
Li-Xing LI ◽  
Zhi JIN ◽  
Ge LI

2020 ◽  
Vol 53 (4) ◽  
pp. 136-142
Author(s):  
Ilya Kovalenko ◽  
Dawn Tilbury ◽  
Kira Barton

2020 ◽  
Vol 53 (2) ◽  
pp. 1918-1923
Author(s):  
Mustafa Yavuz Kara ◽  
Ebru Aydin Gol

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.


2014 ◽  
Vol 92 (1) ◽  
pp. 139-155 ◽  
Author(s):  
Jeh-Hsuan Li ◽  
Chuei-Tin Chang ◽  
Da Jiang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document