scholarly journals Automatic Translation of WS-CDL Choreographies to Timed Automata

Author(s):  
Gregorio Diaz ◽  
Juan-José Pardo ◽  
María-Emilia Cambronero ◽  
Valentín Valero ◽  
Fernando Cuartero
1977 ◽  
Vol 16 (03) ◽  
pp. 144-153 ◽  
Author(s):  
E. Vaccari ◽  
W. Delaney ◽  
A. Chiesa

A software system for the automatic free-text analysis and retrieval of radiological reports is presented. Such software involves: (1) automatic translation of the specific natural language in a formalized metalanguage in order to transform the radiological report in a »normalized report« analyzable by computer; (2) content processing of the normalized report to select desired information. The approach used to accomplish point (1) is described in detail referring to a specific application.


Author(s):  
Aliona Kolesnichenko ◽  
Natalya Zhmayeva

The article is devoted to the analysis of grammatical difficulties encountered in the process of automatic translation. The paper discusses the advantages and disadvantages of the SDL Trados automatic translation service. The types of grammatical errors when translating scientific and technical texts in SDL Trados are classified, the ways of overcoming them are outlined. Key words: scientific and technical literature, automatic translation, grammatical difficulties.


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

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.


Sign in / Sign up

Export Citation Format

Share Document