Automated Generation of BSP Automata

2017 ◽  
Vol 27 (01) ◽  
pp. 1740002 ◽  
Author(s):  
Thibaut Tachon ◽  
Chong Li ◽  
Gaétan Hains ◽  
Frédéric Loulergue
Keyword(s):  
Code Generation ◽  
Finite Automata ◽  
Model Performance ◽  
Performance Model ◽  
Regular Expressions ◽  
Automated Generation ◽  
Bulk Synchronous Parallel ◽  
Finite State ◽  
Initial Description ◽  
Automatic Code

Bulk-Synchronous Parallel (BSP) is a bridging model between abstract execution and concrete parallel architectures that retains enough information to model performance scalability. In order to model BSP program executions, Hains adapted the theory of finite automata to the BSP paradigm by introducing BSP automata [12]. In the initial description of the theory, BSP automata had to be explicitly defined as structured sets of states and transitions. The lack of a clean and efficient algorithm for generating them from regular expressions would have prevented this theory from being used in practice. To alleviate this problem we introduce in this paper an algorithm that generates a BSP automaton recognizing a BSP language defined by a BSP regular expression. The main practical use of BSP automata developed in this paper is the parallelization of finite state automata with an explicit distribution and a performance model, that enable parallel matching of regular expressions. Secondarily, BSP regular expressions provide a convenient structure for automatic code generation of imperative BSP programs that is also developed in this paper.

scholarly journals Bootstrapping MDE development from ROS manual code: Part 2—Model generation and leveraging models at runtime

2021 ◽  
Author(s):  
Nadia Hammoudeh García ◽  
Harshavardhan Deshpande ◽  
André Santos ◽  
Björn Kahl ◽  
Mirko Bordignon
Keyword(s):  
Code Generation ◽  
Special Focus ◽  
Domain Experts ◽  
Automated Generation ◽  
Model Driven ◽  
Static Code Analysis ◽  
Wide Range ◽  
Automatic Code ◽  
Hardware Platforms ◽  
Software Practitioners

AbstractModel-driven engineering (MDE) addresses central aspects of robotics software development. MDE could enable domain experts to leverage the expressiveness of models, while implementation details on different hardware platforms would be handled by automatic code generation. Today, despite strong MDE efforts in the robotics research community, most evidence points to manual code development being the norm. A possible reason for MDE not being accepted by robot software developers could be the wide range of applications and target platforms, which make all-encompassing MDE IDEs hard to develop and maintain. Therefore, we chose to leverage a large corpus of open-source software widely adopted by the robotics community to extract common structures and gain insight on how and where MDE can support the developers to work more efficiently. We pursue modeling as a complement, rather than imposing MDE as separate solution. Our previous work introduced metamodels to describe components, their interactions, and their resulting composition. In this paper, we present two methods based on metamodels for automated generation of models from manually written artifacts: (1) through static code analysis and (2) by monitoring the execution of a running system. For both methods, we present tools that leverage the potentials of our contributions, with a special focus on their application at runtime to observe and diagnose a real system during its execution. A comprehensive example is provided as a walk-through for robotics software practitioners.

Enterprise WAE: A Lightweight UML Extension for the Characterization of the Presentation Tier of Enterprise Applications with MDD-Based Mockup Generation

2017 ◽  
Vol 27 (08) ◽  
pp. 1291-1331
Author(s):  
Humberto Cortés ◽  
Antonio Navarro
Keyword(s):  
Code Generation ◽  
Web Application ◽  
Service Oriented Architecture ◽  
Low Cost ◽  
Unified Modeling Language ◽  
Automatic Generation ◽  
Role Based Access Control ◽  
Enterprise Applications ◽  
Uml Extension ◽  
Automatic Code

Nowadays, the Unified Modeling Language (UML) is the most successful notation for the design of object-oriented applications. However, plain UML is not enough to characterize the web presentation tier of enterprise applications, including the navigational, structural and role-based access control (RBAC) features present in these applications. In this paper, we present Enterprise Web Application Extension (E-WAE), a lightweight UML extension for the modeling of these elements, which permits the inclusion of multitier, Service-Oriented Architecture (SOA) and security design-level patterns in the models. Our approach follows a Model-Driven Development (MDD) approach, which enables the automatic generation of intermediate platform-specific models and automatic code generation for JavaServer Faces (JSF) and Active Server Pages.NET Model-View-Controller (ASP.NET MVC) frameworks. In addition, this generated code can be used as a low-cost mockup for early client validation of the navigational, structural and RBAC features of enterprise applications. E-WAE has been used with different applications. In this paper, we refer to the checkout process in the Amazon website, the delete resources use case in OdAJ2EE, an educational application developed by us, and the US Library of Congress Online Catalog search facility as examples of its applicability.

BORDERS AND FINITE AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 859-871
Author(s):  
MARTIN ŠIMŮNEK ◽  
BOŘIVOJ MELICHAR
Keyword(s):  
Pattern Matching ◽  
Hamming Distance ◽  
Finite Automata ◽  
Music Analysis ◽  
Theoretical Description ◽  
Specific Form ◽  
Distance Measures ◽  
Computer Assisted ◽  
Finite State ◽  
Finite State Transducer

A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper offers the automata-theoretical description of Iliopoulos's ALL_BORDERS algorithm. The algorithm finds all borders of a string with don't care symbols. We show that ALL_BORDERS algorithm is an implementation of a finite state transducer of specific form. We describe how such a transducer can be constructed and what should be the input string like. The described transducer finds a set of lengths of all borders. Last but not least, we define approximate borders and show how to find all approximate borders of a string when we concern Hamming distance definition. Our solution of this problem is based on transducers again. This allows us to use analogy with automata-based pattern matching methods. Finally we discuss conditions under which the same principle can be used for other distance measures.

Rapid Control Prototyping Design of DSP-Based Motion Controller

2011 ◽  
Vol 383-390 ◽  
pp. 308-314
Author(s):  
Lin Li ◽  
Zhi Ming Peng ◽  
Bi Cong Zhang ◽  
Zhang Tie
Keyword(s):  
Code Generation ◽  
Automatic Code Generation ◽  
Motion Controller ◽  
Application System ◽  
Pid Algorithm ◽  
Development Platform ◽  
Development Cycle ◽  
Rapid Control ◽  
Rapid Control Prototyping ◽  
Automatic Code

This paper presents a Rapid Control Prototyping (RCP) development platform based on Matlab/Simulink, Real-Time Workshop and Embedded Target for C2000 and DSP development board. It also designs TMS320F2812 DSP-based motion controller under the proposed RCP. The controller using saturated integral PID algorithm produces PWM signal to control DC motor. Experimental results show that the designed controller can control motor accurately. Engineers can complete all design tasks such as modeling, automatic code generation, and download, running and parameters adjustment on this RCP platform when developing DSP application system. Thus the proposed RCP can shorten the DSP development cycle and improve the portability and modularity of program.

scholarly journals A Direct-Steam Linear Fresnel Performance Model for NREL’S System Advisor Model

2012 ◽  
Author(s):  
Michael J. Wagner ◽  
Guangdong Zhu
Keyword(s):  
Heat Loss ◽  
Mathematical Formulation ◽  
Model Performance ◽  
Performance Model ◽  
Electricity Production ◽  
Steam Generation ◽  
Time Step ◽  
Wide Range ◽  
Direct Steam ◽  
Solar Field

This paper presents the technical formulation and demonstrated model performance results of a new direct-steam-generation (DSG) model in NREL’s System Advisor Model (SAM). The model predicts the annual electricity production of a wide range of system configurations within the DSG Linear Fresnel technology by modeling hourly performance of the plant in detail. The quasi-steady-state formulation allows users to investigate energy and mass flows, operating temperatures, and pressure drops for geometries and solar field configurations of interest. The model includes tools for heat loss calculation using either empirical polynomial heat loss curves as a function of steam temperature, ambient temperature, and wind velocity, or a detailed evacuated tube receiver heat loss model. Thermal losses are evaluated using a computationally efficient nodal approach, where the solar field and headers are discretized into multiple nodes where heat losses, thermal inertia, steam conditions (including pressure, temperature, enthalpy, etc.) are individually evaluated during each time step of the simulation. This paper discusses the mathematical formulation for the solar field model and describes how the solar field is integrated with the other subsystem models, including the power cycle and optional auxiliary fossil system. Model results are also presented to demonstrate plant behavior in the various operating modes.

Sign in / Sign up

Export Citation Format

Share Document