DOCSLIB.ORG

From Uml State Machine to Code and Back Again! 285

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
From Uml State Machine to Code and Back Again! 285 Position Papers of the Federated Conference on Computer DOI: 10.15439/2016F485 Science and Information Systems pp. 283–290 ACSIS, Vol. 9. ISSN 2300-5963 From UML State Machines to code and back again! Van Cam Pham, Ansgar Radermacher, Sébastien Gérard CEA-List, Laboratory of Model-Driven Engineering for Embedded Systems (LISE) Gif-sur-Yvette, France Email: fi[email protected] Abstract—UML state machines and their visual representa- move between different representations [8] and stay efficient tions are much more suitable to describe logical behaviors of with their favorite working environment. system entities than equivalent text based description such as IF-THEN-ELSE or SWITH-CASE constructions. Although many Unfortunately, current industrial tools such as for instance industrial tools and research prototypes can generate executable Enterprise Architect [9] and IBM Rhapsody[10] only support code from such a graphical language, generated code could be structural concepts for RTE such as those available from class manually modified by programmers. After code modifications, diagrams and code. Compared to RTE of class diagrams and round-trip engineering is needed to make the model and code code, RTE of USMs and code is non-trivial. It requires a consistent, which is a critical aspect to meet quality and perfor- mance constraints required for software systems. Unfortunately, semantical analysis of the source code, code pattern detection current UML tools only support structural concepts for round- and mapping patterns into USM elements. This is a hard task, trip engineering such as those available from class diagrams. In since mainstream programming languages such as C++ and this paper, we address the round-trip engineering of UML state- JAVA do not have a trivial mapping between USM elements machine and its related generated code. We propose an approach and source code statements. consisting of a forward process which generates code by using transformation patterns, and a backward process which is based For software development, one may wonder whether this on code pattern detection to update the original state machine RTE is doable. That is, why do the industrial tools not support model from the modified code. We implemented a prototype and the propagation of source code modifications back to original conducted several experiments on different aspects of the round- state machines? Several possible reasons to this lack are (1) trip engineering to verify the proposed approach. the gap between USMs and code, (2) not every source code I. INTRODUCTION modification can be reverse engineered back to the original model, and (3) the penalty of using transformation patterns HE so-called Model-Driven Engineering (MDE) ap- facilitating the reverse engineering that may not be the most proach relies on two paradigms, abstraction and automa- T efficient (e.g. a slightly larger memory overhead). tion [1]. It is recognized as very efficient for dealing with complexity of today’s systems. Abstraction provides simplified This paper addresses the RTE of USMs and object-oriented and focused views of a system and requires adequate graph- programming languages such as C++ and JAVA. The main idea ical modeling languages such as Unified Modeling Language is to utilize transformation patterns from USMs to source code (UML). Even, if the latter is not the silver bullet for all that aggregates code segments associated with a USM element software related concerns, it provides better support than into source code methods/classes rather than scatters these text-based solutions for some concerns such as architecture segments in different places. Therefore, the reverse direction and logical behavior of application development. UML state of the RTE can easily statically analyze the generated code machines (USMs) and their visual representations are much by using code pattern detection and maps the code segments more suitable to describe logical behaviors of system entities back to USM elements. Specifically, in the forward direction, than any equivalent text based descriptions. The gap from we extend the double dispatch pattern presented in [11]. USMs to system implementation is reduced by the ability of Traceability information is stored during the transformations. automatically generating code from USMs [2], [3], [4], [3]. We implemented a prototype supporting RTE of state-machine and C++ code, and conducted several experiments on different Ideally, a full model-centric approach is preferred by MDE aspects of the RTE to verify the proposed approach. To the community due to its advantages [5]. However, in industrial best of our knowledge, our implementation is the first tool practice, there is significant reticence [6] to adopt it. On one supporting RTE of SM and code. hand, programmers prefer to use the more familiar textual programming language. On the other hand, software architects, To sum up, our contribution is as followings: working at higher levels of abstraction, tend to favor the • An approach to round-tripping USMs and object-oriented use of models, and therefore prefer graphical languages for code. describing the architecture of the system. The code modified • A first tooling prototype supporting RTE of USMs and by programmers and the model are then inconsistent. Round- C++ code. trip engineering (RTE) [7] is proposed to synchronize different • An evaluation of the proposed approach including: software artifacts, model and code in this case [8]. RTE – An automatic evaluation of the proposed RTE ap- enables actors (software architect and programmers) to freely proach with the prototype. c 2016, PTI 283 284 POSITION PAPERS OF THE FEDCSIS. GDANSK,´ 2016 – A lightweight evaluation of the semantic confor- Forward Engineering mance of the runtime execution of generated code. -Transformation 1a 2a -Code generation using patterns -Storage of traces The remainder of this paper is organized as follows: Our -Storage of traces proposed approach is detailed in Section II. The implementa- tion of the prototype is described in Section III. Section IV UML Model Intermediate UML Model Source Code reports our results of experimenting with the implementation and our approach. Section V shows related work. The conclu- Reverse Engineering sion and future work are presented in Section VI. Model AST Code Syntax Update Transition Analysis II. APPROACH 2b 1b This section presents our RTE approach. At first, it sketches Fig. 1. Outline of state machine and code RTE USM concepts supported by this study. The outline and the detail of the approach are presented afterward. StateMachine A. Scope /Initialize Operating A USM describes the behavior of an active UML class On[x == 0] /entry Prepare Stopped /exit Disable which is called context class. A USM has a number of states / Enable and well-defined conditional transitions. A state is either an Off atomic state or a composite state that is composed of sub- states and has at most one active sub-state at a certain time. Fig. 2. An example of USM for tracing table Transitions between states can be triggered by external or internal events. An action (effect) can also be activated by the example in Fig. 2. It consists of two states (Stopped and trigger while transitioning from one state to another state. A Operating), two external events (On and Off ), transitions, and state can have associated actions such as entry/exit/doActivity an initial and a final pseudo state. Listing 1 shows a code executed when the state is entered/exited or while it is active, portion generated from the USM following our approach. respectively. Listing 1. A segment of C++ generated code 1 c l a s s CompositeState: p u b l i c S t a t e { B. Approach outline p r o t e c t e d : 3 S t a t e ∗ activeSubState; Our RTE approach is based on the double-dispatch pattern p u b l i c : 5 bool dispatchEvent(Event ∗ e v e n t ) { presented in [11] for mapping from USM to a set of classes bool r e t = f a l s e ; with embedded code fragments. Fig. 1 shows the outline of our 7 i f (activeSubState != NULL) { ret = activeSubState −>dispatchEvent(event);} RTE approach consisting of a forward and a backward/reverse 9 r e t u r n r e t | | event −>processFrom( t h i s );}} (engineering) process. In the forward process, a USM is StateMachine :: StateMachine(Client ∗ c t x ) { 11 t h i s −>context = ctx; transformed into UML classes in an intermediate model. The s t o p p e d = new Stopped ( t h i s , c t x ) ; use of the intermediate model facilitates the transformation 13 o p e r a t i n g = new O p e r a t i n g ( t h i s , c t x ) ; t h i s −>setIniDefaultState (); from the USM to code. Each class of the intermediate model 15 t h i s −>activeSubState −>e n t r y ( ) ; } contains attributes, operations and method bodies (block of void StateMachine:: setIniDefaultState (){ 17 t h i s −>c o n t e x t −>Initialize(); text) associated with each implemented operation. The trans- t h i s −>activeSubState = stopped;} 19 bool StateMachine :: transition (Stopped ∗ s t a t e , formation utilizes several patterns which will be presented On∗ e v e n t ) { later. 21 i f ( t h i s −>c o n t e x t −>guard(event)){ t h i s −>activeSubState −> e x i t ( ) ; When the source code is modified, a syntactic analysis 23 t h i s −>c o n t e x t −>Enable(event); process belonging to the backward transformation checks t h i s −>activeSubState = t h i s −>operating; 25 t h i s −>activeSubState −>e n t r y ( ) ; whether the modified code conforms to the USM semantics r e t u r n t r u e ;} 27 return false ;} (see Subsection II-D3 for the detail of the analysis).
Load more

Recommended publications
  • EB GUIDE Documentation Version 6.1.0.101778 EB GUIDE Documentation
    EB GUIDE documentation Version 6.1.0.101778 EB GUIDE documentation Elektrobit Automotive GmbH Am Wolfsmantel 46 D-91058 Erlangen GERMANY Phone: +49 9131 7701-0 Fax: +49 9131 7701-6333 http://www.elektrobit.com Legal notice Confidential and proprietary information. ALL RIGHTS RESERVED. No part of this publication may be copied in any form, by photocopy, microfilm, retrieval system, or by any other means now known or hereafter invented without the prior written permission of Elektrobit Automotive GmbH. ProOSEK®, tresos®, and street director® are registered trademarks of Elektrobit Automotive GmbH. All brand names, trademarks and registered trademarks are property of their rightful owners and are used only for description. Copyright 2015, Elektrobit Automotive GmbH. Page 2 of 324 EB GUIDE documentation Table of Contents 1. About this documentation ................................................................................................................ 15 1.1. Target audiences of the user documentation ......................................................................... 15 1.1.1. Modelers .................................................................................................................. 15 1.1.2. System integrators .................................................................................................... 16 1.1.3. Application developers ............................................................................................... 16 1.1.4. Extension developers ...............................................................................................
    [Show full text]
  • UML 2 Toolkit, Penker Has Also Collaborated with Hans- Erik Eriksson on Business Modeling with UML: Business Practices at Work
    UML™ 2 Toolkit Hans-Erik Eriksson Magnus Penker Brian Lyons David Fado UML™ 2 Toolkit UML™ 2 Toolkit Hans-Erik Eriksson Magnus Penker Brian Lyons David Fado Publisher: Joe Wikert Executive Editor: Bob Elliott Development Editor: Kevin Kent Editorial Manager: Kathryn Malm Production Editor: Pamela Hanley Permissions Editors: Carmen Krikorian, Laura Moss Media Development Specialist: Travis Silvers Text Design & Composition: Wiley Composition Services Copyright 2004 by Hans-Erik Eriksson, Magnus Penker, Brian Lyons, and David Fado. All rights reserved. Published by Wiley Publishing, Inc., Indianapolis, Indiana Published simultaneously in Canada No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rose- wood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 646-8700. Requests to the Pub- lisher for permission should be addressed to the Legal Department, Wiley Publishing, Inc., 10475 Crosspoint Blvd., Indianapolis, IN 46256, (317) 572-3447, fax (317) 572-4447, E-mail: [email protected]. Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose.
    [Show full text]
  • UML Profile for Communicating Systems a New UML Profile for the Specification and Description of Internet Communication and Signaling Protocols
    UML Profile for Communicating Systems A New UML Profile for the Specification and Description of Internet Communication and Signaling Protocols Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakultäten der Georg-August-Universität zu Göttingen vorgelegt von Constantin Werner aus Salzgitter-Bad Göttingen 2006 D7 Referent: Prof. Dr. Dieter Hogrefe Korreferent: Prof. Dr. Jens Grabowski Tag der mündlichen Prüfung: 30.10.2006 ii Abstract This thesis presents a new Unified Modeling Language 2 (UML) profile for communicating systems. It is developed for the unambiguous, executable specification and description of communication and signaling protocols for the Internet. This profile allows to analyze, simulate and validate a communication protocol specification in the UML before its implementation. This profile is driven by the experience and intelligibility of the Specification and Description Language (SDL) for telecommunication protocol engineering. However, as shown in this thesis, SDL is not optimally suited for specifying communication protocols for the Internet due to their diverse nature. Therefore, this profile features new high-level language concepts rendering the specification and description of Internet protocols more intuitively while abstracting from concrete implementation issues. Due to its support of several concrete notations, this profile is designed to work with a number of UML compliant modeling tools. In contrast to other proposals, this profile binds the informal UML semantics with many semantic variation points by defining formal constraints for the profile definition and providing a mapping specification to SDL by the Object Constraint Language. In addition, the profile incorporates extension points to enable mappings to many formal description languages including SDL. To demonstrate the usability of the profile, a case study of a concrete Internet signaling protocol is presented.
    [Show full text]
  • Complete Code Generation from UML State Machine
    Complete Code Generation from UML State Machine Van Cam Pham, Ansgar Radermacher, Sebastien´ Gerard´ and Shuai Li CEA, LIST, Laboratory of Model Driven Engineering for Embedded Systems, P.C. 174, Gif-sur-Yvette, 91191, France Keywords: UML State Machine, Code Generation, Semantics-conformance, Efficiency, Events, C++. Abstract: An event-driven architecture is a useful way to design and implement complex systems. The UML State Machine and its visualizations are a powerful means to the modeling of the logical behavior of such an archi- tecture. In Model Driven Engineering, executable code can be automatically generated from state machines. However, existing generation approaches and tools from UML State Machines are still limited to simple cases, especially when considering concurrency and pseudo states such as history, junction, and event types. This paper provides a pattern and tool for complete and efficient code generation approach from UML State Ma- chine. It extends IF-ELSE-SWITCH constructions of programming languages with concurrency support. The code generated with our approach has been executed with a set of state-machine examples that are part of a test-suite described in the recent OMG standard Precise Semantics Of State Machine. The traced execution results comply with the standard and are a good hint that the execution is semantically correct. The generated code is also efficient: it supports multi-thread-based concurrency, and the (static and dynamic) efficiency of generated code is improved compared to considered approaches. 1 INTRODUCTION Completeness: Existing tools and approaches mainly focus on the sequential aspect while the concurrency The UML State Machine (USM) (Specification and of state machines is limitedly supported.
    [Show full text]
  • Mutating UML State Machine Behavior with Semantic Mutation Operators
    Mutating UML State Machine Behavior with Semantic Mutation Operators Anna Derezinska a and Łukasz Zaremba Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, Warsaw, Poland Keywords: Model-Driven Software Development, State Machine, Code Generation, Mutation Testing, Framework for Executable UML (FXU), C#. Abstract: In Model-Driven Software Development (MDSD), an application can be built using classes and their state machines as source models. The final application can be tested as any source code. In this paper, we discuss a specific approach to mutation testing in which modifications relate to different variants of behavioural features modelled by UML state machines, while testing deals with standard executions of the final application against its test cases. We have proposed several mutation operators aimed at mutating behaviour of UML state machines. The operators take into account event processing, time management, behaviour of complex states with orthogonal regions, and usage of history pseudostates. Different possible semantic interpretations are associated with each operator. The operators have been implemented in the Framework for eXecutable UML (FXU). The framework, that supports code generation from UML classes and state machines and building target C# applications, has been extended to realize mutation testing with use of multiple libraries. The semantic mutation operators have been verified in some MDSD experiments. 1 INTRODUCTION satisfying selected criteria (Jia and Harman, 2011). In a standard mutation testing process, syntactic Model-Driven Software Development (MDSD) can changes, so-called mutations, are injected into a be aimed at production of high quality software in a source code and supposed to be detected by test cases.
    [Show full text]
  • A Formalism for Specifying Model Merging Conflicts Mohammadreza Sharbaf, Bahman Zamani, Gerson Sunyé
    A Formalism for Specifying Model Merging Conflicts Mohammadreza Sharbaf, Bahman Zamani, Gerson Sunyé To cite this version: Mohammadreza Sharbaf, Bahman Zamani, Gerson Sunyé. A Formalism for Specifying Model Merging Conflicts. System Analysis and Modelling (SAM) conference, Oct 2020, Virtual Event, Canada. 10.1145/3419804.3421447. hal-02930770 HAL Id: hal-02930770 https://hal.archives-ouvertes.fr/hal-02930770 Submitted on 4 Sep 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A Formalism for Specifying Model Merging Conflicts Mohammadreza Sharbaf ∗ Bahman Zamani Gerson Sunyé MDSE Group, University of Isfahan MDSE Group, University of Isfahan LS2N, University of Nantes Isfahan, Iran Isfahan, Iran Nantes, France [email protected] [email protected] [email protected] ABSTRACT sites. Each of the participants focuses on specific aspects of the Verifying the consistency of model merging is an important step to- system and locally modifies only a particular part of the model. wards the support for team collaboration in software modeling and When participants deliver locally modified models, those need to evolution. Since merging conflicts are inevitable, this has triggered be integrated into a common relevant model for continuing the soft- intensive research on conflict management in different domains.
    [Show full text]
  • Activity Diagrams & State Machines
    2IW80 Software specification and architecture Activity diagrams & State machines Alexander Serebrenik This week sources Slides by Site by David Meredith, Kirill Fakhroutdinov Aalborg University, DK GE Healthcare, USA Before we start… True or False? 1. A web server can be an actor in a use case diagram. 2. Guarantee is an action that initiates the use case. 3. Use case “Assign seat” includes the use case “Assign window seat”. 4. Generalization is represented by an arrow with a hollow triangle head. 5. Every use case might involve only one actor. / SET / W&I 24-2-2014 PAGE 2 Before we start… T, unless it is a part of the system True or False? you want to model 1. A web server can be an actor in a use case diagram. Guarantee is a postcondition. An action that initiates the use case is called “trigger”. 2. Guarantee is an action that initiates the use case. 3. Use case “Assign seat” includes the use case “Assign window seat”. 4. Generalization is represented by an arrow with a hollow triangle head. 5. Every use case might involve only one actor. / SET / W&I 24-2-2014 PAGE 3 Before we start… True or False? 1. A web server can be an actor in a use case diagram. 2. GuaranteeNo, the correct is an relationaction that here initiates is extension the use (<<extend>>); case. <<include>> suggests that “Assign window seat” is always called whenever “Assign seat” is executed. 3. Use case “Assign seat” includes the use case “Assign window seat”. 4. Generalization is represented by an arrow with a hollow triangle head.
    [Show full text]
  • Institution-Based Encoding and Verification of Simple UML
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Cronfa at Swansea University Institution-based Encoding and Verification of Simple UML State Machines in CASL/SPASS Tobias Rosenberger1;2, Saddek Bensalem2, Alexander Knapp3, and Markus Roggenbach1 1 Swansea University, U.K. ft.rosenberger.971978; [email protected] 2 Université Grenoble Alpes, France [email protected] 3 Universität Augsburg, Germany [email protected] Abstract. We present a new approach on how to provide institution-based seman- tics for UML state machines. Rather than capturing UML state machines directly # as an institution, we build up a new logical framework MD into which UML # state machines can be embedded. A theoroidal comorphism maps MD into the Casl institution. This allows for symbolic reasoning on UML state machines. By utilising the heterogeneous toolset HeTS that supports Casl, a broad range of verification tools, including the automatic theorem prover Spass, can be combined in the analysis of a single state machine. 1 Introduction As part of a longstanding line of research [9,10,19,8], we set out on a general programme to bring together multi-view system specification with UML diagrams and heterogeneous specification and verification based on institution theory, giving the different system views both a joint semantics and richer tool support. Institutions, a formal notion of a logic, are a principled way of creating such joint semantics. They make moderate assumptions about the data constituting a logic, give uniform notions of well-behaved translations between logics and, given a graph of such translations, automatically give rise to a joint institution.
    [Show full text]
  • Network Protocol Design and Evaluation
    Network Protocol Design and Evaluation 04 - Protocol Specification, Part I Stefan Rührup University of Freiburg Computer Networks and Telematics Summer 2009 Overview ‣ In the last chapter: • The development process (overview) ‣ In this chapter: • Specification • State machines and modeling languages • UML state charts and sequence diagrams • SDL and MSC (Part II) Network Protocol Design and Evaluation Computer Networks and Telematics Stefan Rührup, Summer 2009 2 University of Freiburg What are we modeling? Transitional Systems Reactive Systems input-output transformation event-driven e.g. scientific computation, compilers e.g. communication protocols, operating systems, control systems correctness criteria: correctness criteria: - termination - non-termination under normal - correctness of input-output conditions transformation - correctness of event-response actions formal models describe event-response sequences, including state information [S. Leue, Design of Reactive Systems, Lecture Notes, 2002] Network Protocol Design and Evaluation Computer Networks and Telematics Stefan Rührup, Summer 2009 3 University of Freiburg Specification with State Machines ‣ A protocol interacts with the environment • triggered by events • responds by performing actions • behaviour depends on the history of past events, i.e. the state event 1 state 1 state 2 action action event 2 ‣ state machines do not model the data flow, but the flow of control Network Protocol Design and Evaluation Computer Networks and Telematics Stefan Rührup, Summer 2009 4 University of
    [Show full text]
  • Precise Semantics of UML State Machines (PSSM)
    An OMG® Executable UML® Publication Precise Semantics of UML State Machines (PSSM) Version 1.0 __________________________________________________ OMG Document Number: formal/2019-05-01 Date: May 2019 Normative reference: https://www.omg.org/spec/PSSM/1.0 Machine readable file(s): https://www.omg.org/PSSM/20181101 Normative: https://www.omg.org/spec/PSSM/20181101/PSSM_Syntax.xmi http s ://www.omg.org/spec/PSSM/20181101/PSSM_Semantics.xmi https://www.omg.org/spec/PSSM/20181101/PSSM_TestSuite.xmi _________________________________________________ Copyright © 2016 Airbus Group Copyright © 2016, 2018 Commissariat á l'Energie Atomique et Alternatives (CEA) Copyright © 2016, 2018 Data Access Technologies, Inc. (Model Driven Solutions) Copyright © 2016 LieberLieber Software Copyright © 2017, 2019 Object Management Group, Inc. Copyright © 2016 No Magic, Inc. Copyright © 2016 Simula Research Laboratory USE OF SPECIFICATION - TERMS, CONDITIONS & NOTICES The material in this document details an Object Management Group specification in accordance with the terms, conditions and notices set forth below. This document does not represent a commitment to implement any portion of this specification in any company's products. The information contained in this document is subject to change without notice. LICENSES The companies listed above have granted to the Object Management Group, Inc. (OMG) a nonexclusive, royalty-free, paid up, worldwide license to copy and distribute this document and to modify this document and distribute copies of the modified version. Each of the copyright holders listed above has agreed that no person shall be deemed to have infringed the copyright in the included material of any such copyright holder by reason of having used the specification set forth herein or having conformed any computer software to the specification.
    [Show full text]
  • Partial Reconfiguration in the Field of Logic Controllers Design 353
    INTL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS, 2013, VOL. 59, NO. 4, PP. 351–356 Manuscript received November 3, 2013; revised December, 2013. DOI: 10.2478/eletel-2013-0042 Partial Reconfiguration in the Field of Logic Controllers Design Michał Doligalski and Arkadiusz Bukowiec Abstract—The paper presents method for logic controllers Context switching techniques presented in the paper, provide multi context implementation by means of partial reconfigura- adaptation of control algorithm of the production process. tion. The UML state machine diagram specifies the behaviour Context is the alternative specification (version) of particu- of the logic controller. Multi context functionality is specified at the specification level as variants of the composite state. lar function provided by logic control algorithm. Alternative Each composite state, both orthogonal or compositional, de- context is required when production process has two or more scribes specific functional requirement of the control process. alternative formulas, e.g. ingredients may be in the form of The functional decomposition provided by composite states raw material or semi-finished product. It’s not necessary to is required by the dynamic partial reconfiguration flow. The remodel whole control algorithm but only some parts should state machines specified by UML state machine diagrams are transformed into hierarchical configurable Petri nets (HCfgPN). be adjusted to actual conditions. HCfgPN are a Petri nets variant with the direct support of the exceptions handling mechanism. The paper presents places- oriented method for HCfgPN description in Verilog language. II. PARTIAL RECONFIGURATION In the paper proposed methodology was illustrated by means of Classical design flow of LCs implemented in the FPGA simple industrial control process.
    [Show full text]
  • Transforming Erlang Finite State Machines
    Transforming Erlang finite state machines D´anielLuk´acs,Melinda T´oth,Istv´anBoz´o [email protected], [email protected], [email protected] ELTE E¨otv¨osLor´andUniversity Faculty of Informatics Budapest, Hungary Abstract Model driven development approaches help to alleviate the abstraction gap between high-level design and actual implementation, to aid design, development and maintenance of industrial scale software systems. To provide automatic, easily usable tools for stakeholders, model driven development essentially relies on efficient and expressive translations between the program source code and the model. We present a declarative, rule-based approach to deterministically transform Erlang program sources that satisfy a certain syntactical constraint, into valid UML models of state machines. The transforma- tion relies only on static analysis techniques, and the produced model conforms to the state machine metamodel defined in OMG UML 2.0. 1 Introduction In industrial settings there is an always present necessity to use large software applications with over millions of lines of source code. During design, development and maintenance of software, managing the complexity emerging from these large volumes becomes a critical issue in order to realise a successful product lifecycle. The most important resource needed to manage complexity is relevant, up-to-date information, commonly manifested as the design, development and user documentations. As the software evolves during its development and usage, documentations also have to be actualised to mirror the collective knowledge that was incorporated in the system during its changes. To implement this resource intensive process with the highest efficiency, organisations concerned with software development employ various automatic software analysis tools and machine processable documents to support the developers in creating documentations and keeping them up to date.
    [Show full text]