164 research outputs found
Petri nets with may/must semantics: Preserving properties through data refinements
Many systems used in process managements, like workflow systems, are developed in a top-down fashion, when the original design is refined at each step bringing it closer to the underlying reality. Underdefined specifications cannot however be used for verification, since both false positives and false negatives can be reported. In this paper we introduce colored Petri nets where guards can be evaluated to true, false and indefinite values, the last ones reflecting underspecification. This results in the semantics of Petri nets with may- and must-enableness and firings. In this framework we introduce property-preserving refinements that allow for verification in an early design phase. We present results on property preservation through refinements. We also apply our framework to workflow nets, introduce notions of may- and must-soundness and show that they are preserved through refinements. We shortly describe a prototype under implementation
Universal and national cultural features of the naming in sports
The features of the sports language picture of the world in the context of the French culture of language, whose key element is the linguistic personality, who acts as the actor of the communicative process related to sports activities (both professional and amateur
Politician's linguistic personality as key figure of institutional discourse
The article deals with the approaches to studying a politician's linguistic personality. The communicative potential of the manifestation means of a politician's personality is analyzed. The authors present the algorithm of studying the characteristics of an institutional linguistic personalit
Features of French, American and Russian intercultural interaction
The article deals with the functioning of cultural stereotypes in French, American and Russian linguistic consciousness. Cross-cultural interaction is interpreted within the framework of mastering linguocultural communication codes and the worldview of allophones. The analysis of factual data is based on the linguosemiotic approach to its interpretation within a discursive utterance
5-Thienyl-2-Cycloalkylamino-1,3,4-Thiadiazines, Hydrobromides
This research was financially supported by the Ministry of Education of the Russian Federation (Project β 4.6351.2017/8.9)
ΠΠΎΠ΄Ρ ΠΎΠ΄ ΠΊ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΡΠ΅ΠΌΠ΅ΠΉΡΡΠ²Π° ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΡ ΡΠΈΡΡΠ΅ΠΌ ΡΠ°Π·ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΊΠΎΠ½ΡΠ»ΠΈΠΊΡΠΎΠ²
In the paper, we describe a veriο¬cation method for families of distributed systemsΒ generated by context-sensitive network grammar of a special kind. This grammar includes special non-terminal symbols, so called quasi-terminals, which uniquely correspond to grammar terminals. TheseΒ quasi-terminals specify processes which are merging of base system processes, in contrast to simpleΒ nonterminals which specify networks of parallel compositions of the processes. The method is based onΒ model checking technique and abstraction. An abstract representative model for a family of systemsΒ depends on their speciο¬cation grammar and system properties to be veriο¬ed. This model simulates theΒ behaviour of the systems in such a way that the properties which hold for the representative modelΒ are satisο¬ed for all these systems. The properties of the representative model can be veriο¬ed by modelΒ checking method. The properties of a generated system are speciο¬ed by universal branching time logicΒ βCTL with ο¬nite deterministic automata as atomic formulas. We show the use of this method forΒ veriο¬cation of some properties of a multiagent system for conο¬ict resolution, in particular, for context-dependent disambiguation in ontology population. We also suggest that this approach should be usedΒ for veriο¬cation of computations on sub-grids which are sub-graphs of computation grids. In particular,Β we consider the computation of parity of the active processes number in a sub-grid.Π Π΄Π°Π½Π½ΠΎΠΉ ΡΠ°Π±ΠΎΡΠ΅ ΠΌΡ ΠΎΠΏΠΈΡΡΠ²Π°Π΅ΠΌ ΠΌΠ΅ΡΠΎΠ΄ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ Π΄Π»Ρ ΡΠ΅ΠΌΠ΅ΠΉΡΡΠ² ΡΠ°ΡΠΏΡΠ΅Π΄Π΅Π»Π΅Π½Π½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΏΠΎΡΠΎΠΆΠ΄Π°ΡΡΡΡ ΠΊΠΎΠ½ΡΠ΅ΠΊΡΡΠ½ΠΎ-Π·Π°Π²ΠΈΡΠΈΠΌΠΎΠΉ ΡΠ΅ΡΠ΅Π²ΠΎΠΉ Π³ΡΠ°ΠΌΠΌΠ°ΡΠΈΠΊΠΎΠΉ ΡΠΏΠ΅ΡΠΈΠ°Π»ΡΠ½ΠΎΠ³ΠΎ Π²ΠΈΠ΄Π°. ΠΡΠ° Π³ΡΠ°ΠΌΠΌΠ°ΡΠΈΠΊΠ° ΡΠΎΠ΄Π΅ΡΠΆΠΈΡ ΡΠΏΠ΅ΡΠΈΠ°Π»ΡΠ½ΡΠ΅ Π½Π΅ΡΠ΅ΡΠΌΠΈΠ½Π°Π»ΡΠ½ΡΠ΅ ΡΠΈΠΌΠ²ΠΎΠ»Ρ δ· ΠΊΠ²Π°Π·ΠΈ-ΡΠ΅ΡΠΌΠΈΠ½Π°Π»Ρ.Β ΠΠ²Π°Π·ΠΈ-ΡΠ΅ΡΠΌΠΈΠ½Π°Π»Ρ ΠΎΠ΄Π½ΠΎΠ·Π½Π°ΡΠ½ΠΎ ΡΠΎΠΎΡΠ²Π΅ΡΡΡΠ²ΡΡΡ ΡΠ΅ΡΠΌΠΈΠ½Π°Π»Π°ΠΌ Π³ΡΠ°ΠΌΠΌΠ°ΡΠΈΠΊΠΈ ΠΈ ΠΌΠΎΠ³ΡΡ Π·Π°Π΄Π°Π²Π°ΡΡ ΠΏΡΠΎΡΠ΅ΡΡΡ,ΠΊΠΎΡΠΎΡΡΠ΅ ΠΎΠΏΡΠ΅Π΄Π΅Π»ΡΡΡΡΡ ΡΠ»ΠΈΡΠ½ΠΈΠ΅ΠΌ Π±Π°Π·ΠΎΠ²ΡΡ
ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ² ΡΠΈΡΡΠ΅ΠΌΡ, Π² ΡΠΎ Π²ΡΠ΅ΠΌΡ ΠΊΠ°ΠΊ Π½Π΅ΡΠ΅ΡΠΌΠΈΠ½Π°Π»Ρ Π·Π°Π΄Π°ΡΡΒ ΡΠ΅ΡΠΈ ΠΏΠ°ΡΠ°Π»Π»Π΅Π»ΡΠ½ΡΡ
ΠΊΠΎΠΌΠΏΠΎΠ·ΠΈΡΠΈΠΉ ΡΡΠΈΡ
ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ². ΠΠ°Π½Π½ΡΠΉ ΠΌΠ΅ΡΠΎΠ΄ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΠΎΡΠ½ΠΎΠ²Π°Π½ Π½Π° ΡΠ΅Ρ
Π½ΠΈΠΊΠ°Ρ
Β Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ ΠΈ Π°Π±ΡΡΡΠ°ΠΊΡΠΈΠΈ. ΠΠ±ΡΡΡΠ°ΠΊΡΠ½Π°Ρ ΡΠ΅ΠΏΡΠ΅Π·Π΅Π½ΡΠ°ΡΠΈΠ²Π½Π°Ρ ΠΌΠΎΠ΄Π΅Π»Ρ ΡΠ΅ΠΌΠ΅ΠΉΡΡΠ²Π° ΡΠΈΡΡΠ΅ΠΌ Π·Π°Π²ΠΈΡΠΈΡ ΠΎΡ Π·Π°Π΄Π°ΡΡΠ΅ΠΉ ΠΈΡ
Π³ΡΠ°ΠΌΠΌΠ°ΡΠΈΠΊΠΈ ΠΈ Π²Π΅ΡΠΈΡΠΈΡΠΈΡΡΠ΅ΠΌΡΡ
ΡΠ²ΠΎΠΉΡΡΠ² ΡΠΈΡΡΠ΅ΠΌΡ. ΠΡΠ° ΠΌΠΎΠ΄Π΅Π»Ρ ΡΠΈΠΌΡΠ»ΠΈΡΡΠ΅ΡΒ ΠΏΠΎΠ²Π΅Π΄Π΅Π½ΠΈΠ΅ Π·Π°Π΄Π°Π½Π½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ°ΠΊΠΈΠΌ ΠΎΠ±ΡΠ°Π·ΠΎΠΌ, ΡΡΠΎ ΡΠ²ΠΎΠΉΡΡΠ²Π°, ΠΊΠΎΡΠΎΡΡΠ΅ Π²ΡΠΏΠΎΠ»Π½ΡΡΡΡΡ Π² ΡΠ΅ΠΏΡΠ΅Π·Π΅Π½ΡΠ°ΡΠΈΠ²Π½ΠΎΠΉ ΠΌΠΎΠ΄Π΅Π»ΠΈ, ΡΠ°ΠΊΠΆΠ΅ Π²ΡΠΏΠΎΠ»Π½ΡΡΡΡΡ ΠΈ Π²ΠΎ Π²ΡΠ΅Ρ
Π·Π°Π΄Π°Π½Π½ΡΡ
ΡΠΈΡΡΠ΅ΠΌΠ°Ρ
. ΠΡΠΎΠ²Π΅ΡΠΊΡ ΡΠ²ΠΎΠΉΡΡΠ² ΡΠ΅ΠΏΡΠ΅Π·Π΅Π½ΡΠ°ΡΠΈΠ²Π½ΠΎΠΉΒ ΠΌΠΎΠ΄Π΅Π»ΠΈ ΠΌΠΎΠΆΠ½ΠΎ ΠΎΡΡΡΠ΅ΡΡΠ²Π»ΡΡΡ Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΠΌΠ΅ΡΠΎΠ΄Π° ΠΏΡΠΎΠ²Π΅ΡΠΊΠΈ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ. Π‘Π²ΠΎΠΉΡΡΠ²Π° ΠΏΠΎΡΠΎΠΆΠ΄Π°Π΅ΠΌΡΡ
ΡΠΈΡΡΠ΅ΠΌΒ ΡΠΏΠ΅ΡΠΈΡΠΈΡΠΈΡΡΡΡΡΡ Ρ ΠΏΠΎΠΌΠΎΡΡΡ ΡΠ½ΠΈΠ²Π΅ΡΡΠ°Π»ΡΠ½ΠΎΠΉ Π»ΠΎΠ³ΠΈΠΊΠΈ Π²Π΅ΡΠ²ΡΡΠ΅Π³ΠΎΡΡ Π²ΡΠ΅ΠΌΠ΅Π½ΠΈ βCTL Ρ ΠΊΠΎΠ½Π΅ΡΠ½ΡΠΌΠΈ Π΄Π΅ΡΠ΅ΡΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½Π½ΡΠΌΠΈ Π°Π²ΡΠΎΠΌΠ°ΡΠ°ΠΌΠΈ Π² ΠΊΠ°ΡΠ΅ΡΡΠ²Π΅ Π°ΡΠΎΠΌΠ°ΡΠ½ΡΡ
ΡΠΎΡΠΌΡΠ». ΠΡ ΠΏΠΎΠΊΠ°Π·ΡΠ²Π°Π΅ΠΌ, ΡΡΠΎ ΠΏΡΠ΅Π΄Π»ΠΎΠΆΠ΅Π½Π½ΡΠΉ ΠΌΠ΅ΡΠΎΠ΄ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΠΌΠΎΠΆΠ½ΠΎ ΠΏΡΠΈΠΌΠ΅Π½ΡΡΡ Π΄Π»Ρ ΠΏΡΠΎΠ²Π΅ΡΠΊΠΈ Π½Π΅ΠΊΠΎΡΠΎΡΡΡ
ΡΠ²ΠΎΠΉΡΡΠ² ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΡ
ΡΠΈΡΡΠ΅ΠΌ ΡΠ°Π·ΡΠ΅ΡΠ΅Π½ΠΈΡ ΠΊΠΎΠ½ΡΠ»ΠΈΠΊΡΠΎΠ², Π² ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ, ΡΠΈΡΡΠ΅ΠΌ ΡΠ°Π·ΡΠ΅ΡΠ΅Π½ΠΈΡ Π½Π΅ΠΎΠ΄Π½ΠΎΠ·Π½Π°ΡΠ½ΠΎΡΡΠ΅ΠΉ ΠΏΡΠΈ ΠΏΠΎΠΏΠΎΠ»Π½Π΅Π½ΠΈΠΈΒ ΠΎΠ½ΡΠΎΠ»ΠΎΠ³ΠΈΠΉ. Π’Π°ΠΊΠΆΠ΅ ΠΏΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΡΡΠΎ ΡΡΠΎΡ ΠΏΠΎΠ΄Ρ
ΠΎΠ΄ ΠΌΠΎΠΆΠ½ΠΎ ΠΈΡΠΏΠΎΠ»ΡΠ·ΠΎΠ²Π°ΡΡ Π΄Π»Ρ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠΉ Π½Π°Β ΠΏΠΎΠ΄ΡΠ΅ΡΠ΅ΡΠΊΠ°Ρ
, ΡΠ²Π»ΡΡΡΠΈΡ
ΡΡ ΠΏΠΎΠ΄Π³ΡΠ°ΡΠ°ΠΌΠΈ ΡΠ΅ΡΠ΅ΡΠΎΠΊ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΠΉ, Π½Π°ΠΏΡΠΈΠΌΠ΅Ρ, Π΄Π»Ρ Π²ΡΡΠΈΡΠ»Π΅Π½ΠΈΡ ΡΠ΅ΡΠ½ΠΎΡΡΠΈΒ ΡΠΈΡΠ»Π° ΡΠ°Π±ΠΎΡΠ°ΡΡΠΈΡ
ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ²
Ideological narrative in modern American political discourse
The discourse of American politicians like any other political figures prominently features a narrative - a system of interconnected stories that transition from one into another from speech to speech. The ideological narrative in political discourse plays an important part in myth creation in supporting the concept of Exceptional Americ
Synchronous Closing and Flow Analysis for Model Checking Timed Systems
Abstract. Formal methods, in particular model checking, are increas-ingly accepted as integral part of system development. With large soft-ware systems beyond the range of fully automatic verification, however, a combination of decomposition and abstraction techniques is needed. To model check components of a system, a standard approach is to close the component with an abstraction of its environment, as standard model checkers often do not handle open reactive systems directly. To make it useful in practice, the closing of the component should be automatic, both for data and for control abstraction. Specifically for model checking asynchronous open systems, external input queues should be removed, as they are a potential source of a combinatorial state explosion. In this paper we investigate a class of environmental processes for which the asynchronous communication scheme can safely be replaced by a synchronous one. Such a replacement is possible only if the environment is constructed under rather a severe restriction on the behavior, which can be partially softened via the use of a discrete-time semantics. We employ data-flow analysis to detect instances of variables and timers influenced by the data passing between the system and the environment
- β¦