Improving lazy abstraction for SCR specifications through constraint relaxation

2018 ◽  
Vol 28 (2) ◽  
pp. e1657 ◽  
Author(s):  
Renzo Degiovanni ◽  
Pablo Ponzio ◽  
Nazareno Aguirre ◽  
Marcelo Frias
Keyword(s):  
Constraint Relaxation ◽  
Lazy Abstraction

The Electrophysiological Mechanisms of Constraint Relaxation Studied with A Chinese Logogriph Task

2013 ◽  
Vol 45 (5) ◽  
pp. 508-516 ◽  
Author(s):  
Qiang XING ◽  
Zhonglu ZHANG ◽  
Mengruo WANG ◽  
Jinlian ZHANG ◽  
Jing WANG ◽  
...  
Keyword(s):  
Constraint Relaxation

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

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.

Morphological Analysis of Ill-Formed Arabic Verbs for Second Language Learners

2012 ◽  
pp. 383-397 ◽  
Author(s):  
Khaled Shaalan ◽  
Marwa Magdy ◽  
Aly Fahmy
Keyword(s):  
Second Language ◽  
Language Learners ◽  
Test Data ◽  
Morphological Analysis ◽  
Second Language Learners ◽  
Recall Rate ◽  
Relaxation Techniques ◽  
Informative Feedback ◽  
Constraint Relaxation ◽  
Real Test

Arabic is a language of rich and complex morphology. The nature and peculiarity of Arabic make its morphological and phonological rules confusing for second language learners (SLLs). The conjugation of Arabic verbs is central to the formulation of an Arabic sentence because of its richness of form and meaning. In this research, we address issues related to the morphological analysis of ill-formed Arabic verbs in order to identify the source of errors and provide an informative feedback to SLLs of Arabic. The edit distance and constraint relaxation techniques are used to demonstrate the capability of the proposed system in generating all possible analyses of erroneous Arabic verbs written by SLLs. Filtering mechanisms are applied to exclude the irrelevant constructions and determine the target stem which is used as the base for constructing the feedback to the learner. The proposed system has been developed and effectively evaluated using real test data. It achieved satisfactory results in terms of the recall rate.

Bridging protein rigidity theory and normal modes using kino‐geometric analysis with hierarchical constraint relaxation

PAMM ◽  
2018 ◽  
Vol 18 (1) ◽  
Author(s):  
Dominik Budday ◽  
Sigrid Leyendecker ◽  
Henry van den Bedem
Keyword(s):  
Geometric Analysis ◽  
Normal Modes ◽  
Rigidity Theory ◽  
Constraint Relaxation
Sign in / Sign up

Export Citation Format

Share Document