MAPPING THE IMPACT OF REQUIREMENT CHANGES USING LABELLED TRANSITION SYSTEM FOR REQUIREMENT CHANGE (LTS-RC)

Size: px
Start display at page:

Download "MAPPING THE IMPACT OF REQUIREMENT CHANGES USING LABELLED TRANSITION SYSTEM FOR REQUIREMENT CHANGE (LTS-RC)"

Transcription

1 315 MAPPING THE IMPACT OF REQUIREMENT CHANGES USING LABELLED TRANSITION SYSTEM FOR REQUIREMENT CHANGE (LTS-RC) Martasari Widiastuti *, Daniel Siahaan Informatics Department, Information Technology Faculty, Institute Technology of Sepuluh Nopember Surabaya, Indonesia ABSTRACT Labelled Transition System for Requirement Change (LTS-RC) is a state transition system of requirement changes where transitions of changes in requirements are labeled. Transition labels represent weights of changes dependency between requirements. The states represent requirements as basic elements of system. LTS-RC is used to model software requirement changes. It describes interaction between requirements in certain software system. We use requirement dependencies as variable to determine the direction of edge transition. By using LTS-RC the user is enabled to analyze alternative paths based on an initial requirement that was chosen by stakeholder to be changed. This paper focus on mapping the impact of requirement changes using Labeled Transition System for Requirement Change (LTS-RC). By mapping the impact of requirement changes, it is expected that the stakeholder is assisted to choose changing steps and to validate the cost of changes being implemented. Keywords: Requirement changes, Labelled Transition System for Requirement Change (LTS-RC). 1 INTRODUCTION Requirement changes are complex problem that we need to solve by managing them regularly because they can make another changing. When faced with a single change request that requires a developer to add new functionality to a system or change an existing function, there is always the risk of even the smallest requirement change snowball into a large project. This snowball effect can have several causes. When changing a system requirement, that requirement will likely have dependencies on other requirements, and other requirements will in turn depend on that requirement. When this is the case, a requirement change is not isolated to a single requirement. It can turn into a large project while dealing with the changes that need to be made to satisfy the requirement dependencies. There is also the case that changing a single requirement may introduce a conflict with an existing requirement. In this case, both requirements must be modified so that the new functionality can coexist with the other requirements. If any principle software functions are affected by a single requirement change, then those functions must be changed to ensure the change is successful. Another issue is that of performance. When a single change is made that reduces a quality factor such as CPU performance, then this change may require the hardware components or the system allocation of processes to change [1] [3]. Schneidewind points out that there are numerous risks associated with changing software requirements. Many of these bring about the snowball effect when making a software change. He recommends performing dependency checks among risk factors to determine how a change will affect the various aspects of a system. Once this check is completed, a systematic planned approach can be developed to handle dependencies and properly estimate the cost and schedule requirements of the change [1][3]. LTS-RC is a state transition system of requirement changes where transitions are labeled. Transition labels represent weight of changes dependency between requirements. The states represent requirements as basic elements of system [2]. This paper focus on mapping the impact of requirement changes using Labeled Transition System for Requirement Change (LTS-RC). The paper is organized as follows: Chapter 2 describes about describes about design, FSP formulation, DFD, and s of LTS- RC. Chapter 3 details how visualizations are specified using certain cases study and describes

2 316 4 th International Conference Information & Communication Technology and System how our approach can analyze maps of impact for requirement change. The paper concludes with a discussion and further work. 2 MODEL AND IMPLEMENTATION Chapter 2 describes about design, FSP formulation, DFD, and s of LTS- RC. 2.1 Design of LTS-RC In this section we describe design of model system in LTS-RC tool, begin from domain expert (Figure 1). Domain expert analyze requirement dependencies to model interaction between requirements in certain software system. Knowing data about requirement dependencies we model that data using which ready on LTS- RC tool. To design interaction between requirements or to determine requirement dependencies, domain expert with representation of stakeholder should create workshop or other mechanism such as card sorting workshop, meeting, etc. The aim is helping stakeholder to get validity of data about requirement dependencies or another. LTS-RC tool is easily to analyze alternative path of requirement change based on initial requirement which stakeholders firstly choosed. So that LTS-RC tool can be used as decision support tool to optimally requirement change according to the available resources. After domain expert design the data model then we analyze alternative path formed by requirement dependencies data. The result gives support to map the impact of requirement change deciding available resources. Domain Expert Question aer Rule Analysis of Dependency Model Design Transformation from list requirement and its atribute to of LTS-RC Graphical Model Figure. 1 Design of LTS-RC Model of LTS-RC 2.2 Formulations of LTS-RC Using FSP Rule Requirement Change Map & Alternative Path and Budget LTS-RC model was developed and based on Labeled Transition System (LTS) [2]. A LTS is a state transition system where transitions are labeled [2] [4]. Definition (States and Labels) [4]. We define States as the universal set of states where states π and ε are designated as the error and end states. We define Labels as the universal set of message labels and Labels τ =Labels {τ} where τ is denote an internal component action that is unobservable to other components. Definition (Labeled Transition Systems) [4]. A LTS P is a structure (S, L,, q) where: 1) S States is a finite set of states. 2) L = α(p) {τ} where α(p) Labels is a set of labels that denotes the communicating alphabet of P. 3) (S\{π,ε} L S) defines the labeled transitions between states, and 4) q S is the. The LTS that has π as its only state - ({π}, Labels τ, {}, π) - is referred to as the error LTS, denoted Π. LTS of the form P= ({ε}, L, {}, ε) is referred to as successfully terminated LTS, denoted Σ L. We say that a LTS P is deterministic if there are no transitions labeled with τ and (s, l, s 1 ). And (s, l, s 2 ) implies s 1 =s 2, otherwise it is nondeterministic. In addition we say that a label l is enabled in a state s if there is a state s' such that (s, l, s'). FSP (Finite State Process) is a specification language with well-defined semantics in terms of LTS, which provides a concise way of describing LTS [4]. Each FSP expression E can be mapped onto a finite LTS, we use LTS(E) to denote the LTS that corresponds to it. We now discuss briefly the syntax of FSP [4]. If x and y range over actions, and P and Q range over FSP processes. FSP introduces the following operators [4] : 1) Action prefix : (x P) describes a process that initially engages in the action x and then behaves as described by the auxiliary process P. 2) Choice : (x P y Q) describes a process which initially engages in either x or y, and whose subsequent behavior is described by auxiliary processes P or Q, respectively. 3) Recursion: the behavior of a process may be defined in terms of itself, in order to express repetition.

3 056 Mapping The Impact Of Requirement Changes Using Labelled Transition System For Requirement Change (LTS-RC) Martasari Widiastuti 4) End state END : describes a process that has terminated successfully and cannot perform any more actions. 5) Sequential composition ; : (P;Q) where P is a process with an END state, describes a process that behaves as P and when it reaches the END state of P starts behaving as the auxiliary process Q. 6) Parallel composition : (P Q) describes the parallel composition of processes P and Q. 7) Trace equivalence minimization deterministic : deterministic P describes the minimal trace equivalent process to P. If no terminating traces are proper prefixes of other traces, then it also preserves END states. 8) Strong semantic equivalence minimization minimal : minimal P describes the minimal strong semantic equivalent process to P. Si stem Analyst Designer 1 list of requirement Designing model LTS-RC 2 Creating edge and node edge transition weighted relation data of dependency interaction model of requirement 4 visualization of model Compose the data valid interaction model alternative of budget 7 Budget analysis alternative of path budget requirement list of budget Figure 3. DFD level 1 3 Adding weight of dependency 5 Change requirement requirement change 6 Path analysis 2.3 DFD of LTS-RC Data Flow Diagram (DFD) from LTS-RC tool describes system in LTS-RC that use graphical notation to model the data flow. It begins from DFD level 0, level 1, up to level 2 as sub process from previous process. DFD level 0 describes generally about interaction between process in the system and external entities related to the process. Designer list of requirement data of dependency 0 Designing Model of LTS-RC + visualization of model Figure 2 DFD Levels 0 Si stem Analyst Figure 2 describes relation between process creating design and any entities, such as: designer, system analyst, and user entity. Data list of requirement, dependency of requirement, and visualization of model are related to input and output from process designing model of LTS-RC, entity designer is able to design interaction model of requirement change manually and entity system analysts receive the visualization of model. DFD level 1 depict sub process of creating design in DFD level 0. It describes on Figure 3. Figure 3 is decomposition of process creating LTS-RC design in DFD level 0. From figure 3, we can conclude if list of requirement has been entered by user then requirement database can be analyzed by user to determine requirement dependencies. That requirement dependencies will be modeled to be network model based on namely Label Transition System for Requirement Change (LTS-RC). Designing model can be done in two ways. Firstly, LTS-RC tool automatically creates graphical model of requirement change based on user input. Secondly, users as domain expert or system analyst can directly create graphical model of requirement change by drug the default notation provided LTS-RC tool on default notation template. By Using LTS-RC, it is possible that user clearly know the visualization of interaction between requirements based on data input. 2.4 Graphical Notations of LTS-RC Graphical notations on this LTS-RC tool are new definition to visualize the variables of graphical model. It was detailed in table 1. Notation Description node containing ReqID with optional priority

4 318 4 th International Conference Information & Communication Technology and System as related to path after must priority must priority and related to path after must priority and related to path before optional priority optional priority and related to path after must priority when the directed RegID is smaller Table 1 Graphical Notations of LTS-RC 3 RESULT Chapter 3 details how visualizations are specified using two cases study and describes how our approach can analyze maps of impact for requirement change. We use cases from Functional General Requirement of PhotoBox and Mediboard. They have different characteristic: PhotoBox with its small dependencies and Mediboard with its large dependencies between requirements. For the first case study, we analyze Functional General Requirement of PhotoBox. The input of model is list of requirement with its attributes such as: reqid, description, priority, budget, weight of change dependency. Table 2 shows dependency matrix containing weight of change dependency (%) from FR PhotoBox Table 2 Dependency Matrix of FR PhotoBox [5] The result of LTS-RC model is map of requirement change as bellow: Figure 4. Requirement Change Map of FR PhotoBox Figure 4 shows that modification of FR6 causes changing of another requirement such as: FR8, FR9, and FR10. If stakeholders need to modify requirement FGR6 there are several path as mapping the impact of requirement change. Stakeholders can arbitrary choose an as initial requirement that want to be changed, for example FR6 and LTS-RC automatically shows the mapping of requirement change related to initial state (FR6). Table 3 shows the result of analysis path and budget if stakeholders modify 70%of requirement FR6. Table 3 Alternative Path and Budget PhotoBox The second case study, we analyze Functional General Requirement of Mediboard. Table 4 shows dependency matrix containing weight of change dependency (%) from FR Mediboard

5 056 Mapping The Impact Of Requirement Changes Using Labelled Transition System For Requirement Change (LTS-RC) Martasari Widiastuti Table 4 Dependency Matrix of FR Mediboard [6] For further development, we would like to add more complex variable to model requirement change, use another type of dependencies to model interaction between requirements, and analyze the effectiveness of LTS-RC for tracing some problem in software system. The result of LTS-RC model is map of requirement change as bellow: Figure 5. Requirement Change Map of FR Mediboard Figure 5 shows that modification of FR2 causes changing of another requirement such as: FR1, FR7, FR8, and FR9. If stakeholders need to delete requirement FR2 there are several path as mapping the impact of requirement change. Stakeholders can arbitrary choose an as initial requirement that want to be changed or delete, for example FR2 and LTS-RC automatically shows the mapping of requirement change related to initial state (FR2). Table 3 shows the result of analysis path and budget if stakeholders delete (modify 100%) requirement FR2. Table 4 Alternative Path and Budget Mediboard 4 CONCLUSION We have done modeling of requirements change and mapping their impact using LTS-RC tool. This tool enables user to design interaction model of requirement changes. This tool is expected to assists the stakeholder to choose changing steps and to validate the cost of changes being implemented REFERENCE [1] B.J. Williams, J. Carver, and R.Vaughn, Change Risk Assessment: Understanding Risks Involved in Changing Software Requirements, in The 2006 International Conference on Software Engineering Research and Practice (SERP), Department of Computer Science and Engineering Mississippi State University, 2006, MS [2] M. Widiastuti, and D. Siahaan, Labeled Transition System for Requirement Change (LTS-RC): Pemodelan Perubahan Kebutuhan Perangkat Lunak Berdasarkan Labelled Transition System, Prosiding Seminar Nasional Manajemen Teknologi VII, ISBN: , 2008, pp. C-11-1 to C [3] N.F. Schneidewind, Investigation of the Risk to Software Reliability and Maintainability of Requirements Changes, Proceedings of the IEEE International Conference on Software Maintenance, Florence, 2001, pp [4] S. Uchitel, Incremental Elaboration of Scenario-Based Specifications and Behaviour Models Using Implied Scenarios, Ph.D Thesis, Imperial College of Science, Technology and Medicine, Department of Computing, University of London, 2003 [5] D. Siahaan, Dependency Matrix of PhotoBox Functional General Requirement, Informatics Department, Information Technology Faculty of ITS, Surabaya, Indonesia, 2008 [6] P.D. Sene, Dependency Matrix of Mediboard Functional General Requirement, Informatics Department, Information Technology Faculty of ITS, Surabaya, Indonesia, 2008.

FSP Language Specification

FSP Language Specification FSP Language Specification V2.0 additions 1 V2.0 -Additions FSP Language Specification This document describes the additions that have been made to the FSP input notation to the LTSA tool since its initial

More information

Lecture 2: Modeling Introduction

Lecture 2: Modeling Introduction Concurrent Programming 19530-V (WS01) Lecture 2: Modeling Introduction Dr. Richard S. Hall rickhall@inf.fu-berlin.de Concurrent programming October 23, 2001 Our Approach to Concurrency Start with concurrency

More information

The Language for Specifying Lexical Analyzer

The Language for Specifying Lexical Analyzer The Language for Specifying Lexical Analyzer We shall now study how to build a lexical analyzer from a specification of tokens in the form of a list of regular expressions The discussion centers around

More information

Specification and Generation of Environment for Model Checking of Software Components *

Specification and Generation of Environment for Model Checking of Software Components * Specification and Generation of Environment for Model Checking of Software Components * Pavel Parizek 1, Frantisek Plasil 1,2 1 Charles University, Faculty of Mathematics and Physics, Department of Software

More information

Finite automata in the mathematical theory of programming

Finite automata in the mathematical theory of programming Proceedings of the 7 th International Conference on Applied Informatics Eger, Hungary, January 28 31, 2007. Vol. 1. pp. 91 98. Finite automata in the mathematical theory of programming Valerie Novitzká,

More information

Oracle Data Modeling and Relational Database Design

Oracle Data Modeling and Relational Database Design Oracle University Contact Us: +632 976 8896, 1800 16516277 Oracle Data Modeling and Relational Database Design Duration: 4 Days What you will learn This Oracle Data Modeling and Relational Database Design

More information

Raising Level of Abstraction with Partial Models: A Vision

Raising Level of Abstraction with Partial Models: A Vision Raising Level of Abstraction with Partial Models: A Vision Marsha Chechik 1, Arie Gurfinkel 2, Sebastian Uchitel 3, and Shoham Ben-David 1 1 Department of Computer Science, University of Toronto 2 SEI/CMU

More information

Lecture Notes on Program Equivalence

Lecture Notes on Program Equivalence Lecture Notes on Program Equivalence 15-312: Foundations of Programming Languages Frank Pfenning Lecture 24 November 30, 2004 When are two programs equal? Without much reflection one might say that two

More information

Verification Finite-state process modeling and reachability analysis

Verification Finite-state process modeling and reachability analysis Verification Finite-state process modeling and reachability analysis Topics: Finite-state process modeling Verification through interactive simulation Concurrent composition of processes Verification through

More information

Introduction to Software Specifications and Data Flow Diagrams. Neelam Gupta The University of Arizona

Introduction to Software Specifications and Data Flow Diagrams. Neelam Gupta The University of Arizona Introduction to Software Specifications and Data Flow Diagrams Neelam Gupta The University of Arizona Specification A broad term that means definition Used at different stages of software development for

More information

Model-based Analysis of Event-driven Distributed Real-time Embedded Systems

Model-based Analysis of Event-driven Distributed Real-time Embedded Systems Model-based Analysis of Event-driven Distributed Real-time Embedded Systems Gabor Madl Committee Chancellor s Professor Nikil Dutt (Chair) Professor Tony Givargis Professor Ian Harris University of California,

More information

Chapter 2 Overview of the Design Methodology

Chapter 2 Overview of the Design Methodology Chapter 2 Overview of the Design Methodology This chapter presents an overview of the design methodology which is developed in this thesis, by identifying global abstraction levels at which a distributed

More information

Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems

Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems Insup Lee 1, Oleg Sokolsky 1, Anna Philippou 2 1 RTG (Real-Time Systems Group) Department of

More information

Enterprise Architect Training Courses

Enterprise Architect Training Courses On-site training from as little as 135 per delegate per day! Enterprise Architect Training Courses Tassc trainers are expert practitioners in Enterprise Architect with over 10 years experience in object

More information

VETRI VINAYAHA COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

VETRI VINAYAHA COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING VETRI VINAYAHA COLLEGE OF ENGINEERING AND TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6403 SOFTWARE ENGINEERING II year/ IV sem CSE (Regulation 2013) UNIT 1- SOFTWARE PROCESS AND PROJECT

More information

Chapter 4. In this chapter, you will learn:

Chapter 4. In this chapter, you will learn: Chapter Entity Relationship (ER) Modeling Database Systems: Design, Implementation, and Management, Seventh Edition, Rob and Coronel 1 In this chapter, you will learn: The main characteristics of entity

More information

David Griol Barres Computer Science Department Carlos III University of Madrid Leganés (Spain)

David Griol Barres Computer Science Department Carlos III University of Madrid Leganés (Spain) David Griol Barres dgriol@inf.uc3m.es Computer Science Department Carlos III University of Madrid Leganés (Spain) OUTLINE Introduction: Definitions The role of the Lexical Analyzer Scanner Implementation

More information

Chapter : Analysis Modeling

Chapter : Analysis Modeling Chapter : Analysis Modeling Requirements Analysis Requirements analysis Specifies software s operational characteristics Indicates software's interface with other system elements Establishes constraints

More information

POTENTIAL DIFFERENCES AT RISK ASSESSMENT AND RISK TREATMENT PLANNING BETWEEN ISO/IEC 27001:2005 AND ISO/IEC 27001:2013

POTENTIAL DIFFERENCES AT RISK ASSESSMENT AND RISK TREATMENT PLANNING BETWEEN ISO/IEC 27001:2005 AND ISO/IEC 27001:2013 POTENTIAL DIFFERENCES AT RISK ASSESSMENT AND RISK TREATMENT PLANNING BETWEEN ISO/IEC 27001:2005 AND ISO/IEC 27001:2013 Eka Pramudita Purnomo 1) and R. V. Hari Ginardi 2) Master s Program in Management

More information

LTSA User Manual.

LTSA User Manual. LTSA User Manual www.doc.ic.ac.uk/~jnm/book/firstbook/ltsa/ltsa-doc/usermanual.html User manual It is the hope of the designers of LTSA that this manual should be largely unnecessary. In most cases, the

More information

Lesson 06. Requirement Engineering Processes

Lesson 06. Requirement Engineering Processes Lesson 06 Requirement Engineering Processes W.C.Uduwela Department of Mathematics and Computer Science Objectives To describe the principal requirements engineering activities and their relationships To

More information

Lexical Analysis. Implementation: Finite Automata

Lexical Analysis. Implementation: Finite Automata Lexical Analysis Implementation: Finite Automata Outline Specifying lexical structure using regular expressions Finite automata Deterministic Finite Automata (DFAs) Non-deterministic Finite Automata (NFAs)

More information

Work with design rules that can be applied to check and enforce the integrity and consistency of your

Work with design rules that can be applied to check and enforce the integrity and consistency of your Oracle - Oracle Data Modeling and Relational Database Design Code: Lengt h: URL: D56497GC20 4 days View Online This Oracle Data Modeling and Relational Database Design training covers the Data Modeling

More information

Specifying Precise Use Cases with Use Case Charts

Specifying Precise Use Cases with Use Case Charts Specifying Precise Use Cases with Use Case Charts Jon Whittle Dept of Information & Software Engineering George Mason University 4400 University Drive Fairfax, VA 22030 jwhittle@ise.gmu.edu Abstract. Use

More information

Modeling Systems Using Design Patterns

Modeling Systems Using Design Patterns Modeling Systems Using Design Patterns Jaroslav JAKUBÍK Slovak University of Technology Faculty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia jakubik@fiit.stuba.sk

More information

Theoretical Part. Chapter one:- - What are the Phases of compiler? Answer:

Theoretical Part. Chapter one:- - What are the Phases of compiler? Answer: Theoretical Part Chapter one:- - What are the Phases of compiler? Six phases Scanner Parser Semantic Analyzer Source code optimizer Code generator Target Code Optimizer Three auxiliary components Literal

More information

CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards

CompuScholar, Inc. Alignment to Nevada Computer Science Course Standards CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards Nevada Course Details: Course Name: Computer Science Primary Cluster: Information and Media Technologies Standards Course Code(s):

More information

The Method for Verifying Software Architecture with FSP Model

The Method for Verifying Software Architecture with FSP Model The Method for Verifying Software Architecture with FSP Model Kim, Jungho SKC&C Inc., SK u-tower 25-1, Jeongja-dong, Bundang-gu, Seongnam-si, Gyeonggi-do 463-844, Korea kimjh@skcc.com Abstract C&C view

More information

A Formalization of Transition P Systems

A Formalization of Transition P Systems Fundamenta Informaticae 49 (2002) 261 272 261 IOS Press A Formalization of Transition P Systems Mario J. Pérez-Jiménez and Fernando Sancho-Caparrini Dpto. Ciencias de la Computación e Inteligencia Artificial

More information

Lexical Analysis. Prof. James L. Frankel Harvard University

Lexical Analysis. Prof. James L. Frankel Harvard University Lexical Analysis Prof. James L. Frankel Harvard University Version of 5:37 PM 30-Jan-2018 Copyright 2018, 2016, 2015 James L. Frankel. All rights reserved. Regular Expression Notation We will develop a

More information

Observable Behaviour Observable behaviour can be defined in terms of experimentation.

Observable Behaviour Observable behaviour can be defined in terms of experimentation. Observable Behaviour Observable behaviour can be defined in terms of experimentation. Consider a coffee machine. We don t need to understand and don t what to understand how the coffee machine works. All

More information

EXTENDED DISTRIBUTED UML-BASED PROTOCOL SYNTHESIS METHOD

EXTENDED DISTRIBUTED UML-BASED PROTOCOL SYNTHESIS METHOD EXTENDED DISTRIBUTED UML-BASED PROTOCOL SYNTHESIS METHOD Jehad Al Dallal Department of Information Science, Kuwait University, Kuwait ABSTRACT Synthesizing specifications for real time applications that

More information

Requirements Analysis. SE 555 Software Requirements & Specification

Requirements Analysis. SE 555 Software Requirements & Specification Requirements Analysis Goals of Requirements Analysis Create requirements containing sufficient detail and of high enough quality to allow realistic project planning as well as successful design and implementation.

More information

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: Management Information Systems

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: Management Information Systems Sample Questions: Section I: Subjective Questions 1. Which factors are considered critical for the success/failure of the Decision Support System? 2. List the categories of data warehousing tools. 3. "MIS

More information

The Comparison of CBA Algorithm and CBS Algorithm for Meteorological Data Classification Mohammad Iqbal, Imam Mukhlash, Hanim Maria Astuti

The Comparison of CBA Algorithm and CBS Algorithm for Meteorological Data Classification Mohammad Iqbal, Imam Mukhlash, Hanim Maria Astuti Information Systems International Conference (ISICO), 2 4 December 2013 The Comparison of CBA Algorithm and CBS Algorithm for Meteorological Data Classification Mohammad Iqbal, Imam Mukhlash, Hanim Maria

More information

Compiler Design Aug 1996

Compiler Design Aug 1996 Aug 1996 Part A 1 a) What are the different phases of a compiler? Explain briefly with the help of a neat diagram. b) For the following Pascal keywords write the state diagram and also write program segments

More information

CT32 COMPUTER NETWORKS DEC 2015

CT32 COMPUTER NETWORKS DEC 2015 Q.2 a. Using the principle of mathematical induction, prove that (10 (2n-1) +1) is divisible by 11 for all n N (8) Let P(n): (10 (2n-1) +1) is divisible by 11 For n = 1, the given expression becomes (10

More information

Finite State Automata as a Data Storage

Finite State Automata as a Data Storage Finite State Automata as a Data Storage Marian Mindek and Martin Hynar Finite State Automata as Data Storage Department of Computer Science, VŠB Technical University of Ostrava 17. listopadu 15, 708 33

More information

efmea RAISING EFFICIENCY OF FMEA BY MATRIX-BASED FUNCTION AND FAILURE NETWORKS

efmea RAISING EFFICIENCY OF FMEA BY MATRIX-BASED FUNCTION AND FAILURE NETWORKS efmea RAISING EFFICIENCY OF FMEA BY MATRIX-BASED FUNCTION AND FAILURE NETWORKS Maik Maurer Technische Universität München, Product Development, Boltzmannstr. 15, 85748 Garching, Germany. Email: maik.maurer@pe.mw.tum.de

More information

1. i. What are the 3 major components of a information system and show their relationship input output

1. i. What are the 3 major components of a information system and show their relationship input output Higher National Diploma in Information Technology First Year, Second semesterexamination-2011 IT2005: System Analysis and Design Answer Script No. of pages: 11 1. i. What are the 3 major components of

More information

Automatic Metadata Generation By Clustering Extracted Representative Keywords From Heterogeneous Sources

Automatic Metadata Generation By Clustering Extracted Representative Keywords From Heterogeneous Sources ALI RIDHO BARAKBAH 106 Automatic Metadata Generation By Clustering Extracted Representative Keywords From Heterogeneous Sources Ali Ridho Barakbah Abstract In the information retrieval, the generation

More information

Overview. Probabilistic Programming. Dijkstra s guarded command language: Syntax. Elementary pgcl ingredients. Lecture #4: Probabilistic GCL

Overview. Probabilistic Programming. Dijkstra s guarded command language: Syntax. Elementary pgcl ingredients. Lecture #4: Probabilistic GCL Overview Lecture #4: Probabilistic GCL 1 Joost-Pieter Katoen 2 3 Recursion RWTH Lecture Series on 2018 Joost-Pieter Katoen 1/31 Joost-Pieter Katoen 2/31 Dijkstra s guarded command language: Syntax Elementary

More information

COMP-421 Compiler Design. Presented by Dr Ioanna Dionysiou

COMP-421 Compiler Design. Presented by Dr Ioanna Dionysiou COMP-421 Compiler Design Presented by Dr Ioanna Dionysiou Administrative! [ALSU03] Chapter 3 - Lexical Analysis Sections 3.1-3.4, 3.6-3.7! Reading for next time [ALSU03] Chapter 3 Copyright (c) 2010 Ioanna

More information

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY (DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures

More information

Languages and Compilers

Languages and Compilers Principles of Software Engineering and Operational Systems Languages and Compilers SDAGE: Level I 2012-13 3. Formal Languages, Grammars and Automata Dr Valery Adzhiev vadzhiev@bournemouth.ac.uk Office:

More information

CS SOFTWARE ENGINEERING QUESTION BANK SIXTEEN MARKS

CS SOFTWARE ENGINEERING QUESTION BANK SIXTEEN MARKS DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS 6403 - SOFTWARE ENGINEERING QUESTION BANK SIXTEEN MARKS 1. Explain iterative waterfall and spiral model for software life cycle and various activities

More information

Automatic Reconstruction of the Underlying Interaction Design of Web Applications

Automatic Reconstruction of the Underlying Interaction Design of Web Applications Automatic Reconstruction of the Underlying Interaction Design of Web Applications L.Paganelli, F.Paternò C.N.R., Pisa Via G.Moruzzi 1 {laila.paganelli, fabio.paterno}@cnuce.cnr.it ABSTRACT In this paper

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS SOFTWARE ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS SOFTWARE ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS 6403 - SOFTWARE ENGINEERING QUESTION BANK TWO MARKS UNIT I SOFTWARE PROCESS AND PROJECT MANAGEMENT 1. What is software engineering? Software engineering

More information

Compiler Construction

Compiler Construction Compiler Construction Thomas Noll Software Modeling and Verification Group RWTH Aachen University https://moves.rwth-aachen.de/teaching/ss-16/cc/ Conceptual Structure of a Compiler Source code x1 := y2

More information

Suggesting Edits to Explain Failing Traces

Suggesting Edits to Explain Failing Traces Suggesting Edits to Explain Failing Traces Giles Reger University of Manchester, UK Abstract. Runtime verification involves checking whether an execution trace produced by a running system satisfies a

More information

Concurrent Execution

Concurrent Execution Concurrent Execution Overview: concepts and definitions modelling: parallel composition action interleaving algebraic laws shared actions composite processes process labelling, action relabeling and hiding

More information

COP4020 Programming Languages. Syntax Prof. Robert van Engelen

COP4020 Programming Languages. Syntax Prof. Robert van Engelen COP4020 Programming Languages Syntax Prof. Robert van Engelen Overview n Tokens and regular expressions n Syntax and context-free grammars n Grammar derivations n More about parse trees n Top-down and

More information

Requirements Engineering process

Requirements Engineering process Requirements Engineering process Used to discover, analyze, validate and manage requirements Varies depending on the application domain, the people involved and the organization developing the requirements

More information

Joint Entity Resolution

Joint Entity Resolution Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute

More information

Lecture 9 Requirements Engineering II

Lecture 9 Requirements Engineering II Lecture 9 Requirements Engineering II Software Engineering ITCS 3155 Fall 2008 Dr. Jamie Payton Department of Computer Science University of North Carolina at Charlotte September 23, 2008 Announcements

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

Computer Science Department Carlos III University of Madrid Leganés (Spain) David Griol Barres

Computer Science Department Carlos III University of Madrid Leganés (Spain) David Griol Barres Computer Science Department Carlos III University of Madrid Leganés (Spain) David Griol Barres dgriol@inf.uc3m.es Introduction: Definitions Lexical analysis or scanning: To read from left-to-right a source

More information

The Automatic Design of Batch Processing Systems

The Automatic Design of Batch Processing Systems The Automatic Design of Batch Processing Systems by Barry Dwyer, M.A., D.A.E., Grad.Dip. A thesis submitted for the degree of Doctor of Philosophy in the Department of Computer Science University of Adelaide

More information

A Small Interpreted Language

A Small Interpreted Language A Small Interpreted Language What would you need to build a small computing language based on mathematical principles? The language should be simple, Turing equivalent (i.e.: it can compute anything that

More information

A Model Transformation from Misuse Cases to Secure Tropos

A Model Transformation from Misuse Cases to Secure Tropos A Model Transformation from Misuse Cases to Secure Tropos Naved Ahmed 1, Raimundas Matulevičius 1, and Haralambos Mouratidis 2 1 Institute of Computer Science, University of Tartu, Estonia {naved,rma}@ut.ee

More information

Agent-Oriented Software Engineering

Agent-Oriented Software Engineering Agent-Oriented Software Engineering Lin Zuoquan Information Science Department Peking University lz@is.pku.edu.cn http://www.is.pku.edu.cn/~lz/teaching/stm/saswws.html Outline Introduction AOSE Agent-oriented

More information

Component Placement in Distributed Environment w.r.t. Component Interaction

Component Placement in Distributed Environment w.r.t. Component Interaction Component Placement in Distributed Environment w.r.t. Component Interaction Barbora Zimmerova Faculty of Informatics, Masaryk University Brno, Czech Republic zimmerova@fi.muni.cz Abstract. The paper identifies

More information

Processes & Threads. Concepts: processes - units of sequential execution.

Processes & Threads. Concepts: processes - units of sequential execution. Chapter 2 Processes & Threads concurrent processes We structure complex systems as sets of simpler activities, each represented as a sequential process. Processes can overlap or be concurrent, so as to

More information

Chapter 2. Processes & Threads. Concurrency: processes & threads 1. Magee/Kramer

Chapter 2. Processes & Threads. Concurrency: processes & threads 1. Magee/Kramer Chapter 2 Processes & Threads Concurrency: processes & threads 1 concurrent processes We structure complex systems as sets of simpler activities, each represented as a sequential process. Processes can

More information

COP4020 Programming Languages. Syntax Prof. Robert van Engelen

COP4020 Programming Languages. Syntax Prof. Robert van Engelen COP4020 Programming Languages Syntax Prof. Robert van Engelen Overview Tokens and regular expressions Syntax and context-free grammars Grammar derivations More about parse trees Top-down and bottom-up

More information

A Semi-group of Hashing Functions & Hash Tables

A Semi-group of Hashing Functions & Hash Tables A Semi-group of Hashing Functions & Hash Tables Arthur Hughes University of Dublin, Trinity College, Dublin, Ireland e-mail: Arthur.P.Hughes@cs.tcd.ie January 19, 1997 Abstract A model of a hash table

More information

for TOGAF Practitioners Hands-on training to deliver an Architecture Project using the TOGAF Architecture Development Method

for TOGAF Practitioners Hands-on training to deliver an Architecture Project using the TOGAF Architecture Development Method Course Syllabus for 3 days Expert led Enterprise Architect hands-on training "An Architect, in the subtlest application of the word, describes one able to engage and arrange all elements of an environment

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Written ssignments W assigned today Implementation of Lexical nalysis Lecture 4 Due in one week :59pm Electronic hand-in Prof. iken CS 43 Lecture 4 Prof. iken CS 43 Lecture 4 2 Tips on uilding Large Systems

More information

A Consistency Check of Dependability Case (D-case) Produced from Data Flow Diagram (DFD)

A Consistency Check of Dependability Case (D-case) Produced from Data Flow Diagram (DFD) A Consistency Check of Dependability Case (D-case) Produced from Data Flow Diagram (DFD) Nada Olayan 1 and Shuichiro Yamamoto 2 1 Graduate School of Information Sciences, Nagoya University, Nagoya, Aichi,

More information

Requirement Engineering within an Agile Environment BY KEJI GIWA. Digital Bananas Technology

Requirement Engineering within an Agile Environment BY KEJI GIWA. Digital Bananas Technology Requirement Engineering within an Agile Environment BY KEJI GIWA HLR Workshop Requirement Catalogue Product Planning Sprint Planning Meeting Keyscreens Use Case / Epic Stories Implement Wireframes DBT

More information

Introduction to Software Engineering. ECSE-321 Unit 9 Architectural Design Approaches

Introduction to Software Engineering. ECSE-321 Unit 9 Architectural Design Approaches Introduction to Software Engineering ECSE-321 Unit 9 Architectural Design Approaches Requirement Elicitation Analysis (Software Product Design) Architectural Design Detailed Design Architectural Design

More information

Implementation of Lexical Analysis

Implementation of Lexical Analysis Implementation of Lexical Analysis Lecture 4 (Modified by Professor Vijay Ganesh) Tips on Building Large Systems KISS (Keep It Simple, Stupid!) Don t optimize prematurely Design systems that can be tested

More information

The Markov Reformulation Theorem

The Markov Reformulation Theorem The Markov Reformulation Theorem Michael Kassoff and Michael Genesereth Logic Group, Department of Computer Science Stanford University {mkassoff, genesereth}@cs.stanford.edu Abstract In this paper, we

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

More information

Lower bounds and recursive methods for the problem of adjudicating conflicting claims

Lower bounds and recursive methods for the problem of adjudicating conflicting claims Lower bounds and recursive methods for the problem of adjudicating conflicting claims Diego Dominguez University of Rochester March 31, 006 Abstract For the problem of adjudicating conflicting claims,

More information

Handout 9: Imperative Programs and State

Handout 9: Imperative Programs and State 06-02552 Princ. of Progr. Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 9: Imperative Programs and State Imperative

More information

RDFGraph: New Data Modeling Tool for

RDFGraph: New Data Modeling Tool for RDFGraph: New Data Modeling Tool for Semantic Web Daniel Siahaan, and Aditya Prapanca Abstract The emerging Semantic Web has been attracted many researchers and developers. New applications have been developed

More information

LATENT SEMANTIC ANALYSIS AND WEIGHTED TREE SIMILARITY FOR SEMANTIC SEARCH IN DIGITAL LIBRARY

LATENT SEMANTIC ANALYSIS AND WEIGHTED TREE SIMILARITY FOR SEMANTIC SEARCH IN DIGITAL LIBRARY 6-02 Latent Semantic Analysis And Weigted Tree Similarity For Semantic Search In Digital Library LATENT SEMANTIC ANALYSIS AND WEIGHTED TREE SIMILARITY FOR SEMANTIC SEARCH IN DIGITAL LIBRARY Umi Sa adah

More information

Program Syntax; Operational Semantics

Program Syntax; Operational Semantics 9/5 Solved Program Syntax; Operational Semantics CS 536: Science of Programming, Fall 2018 A. Why Our simple programming language is a model for the kind of constructs seen in actual languages. Step-by-step

More information

Lexical Analysis. Note by Baris Aktemur: Our slides are adapted from Cooper and Torczon s slides that they prepared for COMP 412 at Rice.

Lexical Analysis. Note by Baris Aktemur: Our slides are adapted from Cooper and Torczon s slides that they prepared for COMP 412 at Rice. Lexical Analysis Note by Baris Aktemur: Our slides are adapted from Cooper and Torczon s slides that they prepared for COMP 412 at Rice. Copyright 2010, Keith D. Cooper & Linda Torczon, all rights reserved.

More information

Cluster quality assessment by the modified Renyi-ClipX algorithm

Cluster quality assessment by the modified Renyi-ClipX algorithm Issue 3, Volume 4, 2010 51 Cluster quality assessment by the modified Renyi-ClipX algorithm Dalia Baziuk, Aleksas Narščius Abstract This paper presents the modified Renyi-CLIPx clustering algorithm and

More information

Guided Test Generation from CSP Models

Guided Test Generation from CSP Models Guided Test Generation from CSP Models Sidney Nogueira 1,2, Augusto Sampaio 1, and Alexandre Mota 1 1 Centro de Informática, Universidade Federal de Pernambuco Caixa Postal 7851-50732-970 - Recife/PE -

More information

Study Programme Description

Study Programme Description Study Programme Description Title of the study Software Engineering Official name of the institution, faculty (s) Vilnius University, Faculty of Mathematics and Informatics, Department of Software Engineering

More information

Concurrent processes. Processes and Threads. Processes and threads. Going back to Concurrency. Modelling Processes. Modeling processes

Concurrent processes. Processes and Threads. Processes and threads. Going back to Concurrency. Modelling Processes. Modeling processes Processes and Threads Abhik Roychoudhury CS 3211 National University of Singapore Modified from Kramer and Magee s lecture notes. Reading material: Chapter 2 of Textbook. Concurrent processes We structure

More information

Compatibility Verification for Web Service Choreography

Compatibility Verification for Web Service Choreography Compatibility Verification for Choreography Howard Foster, Sebastian Uchitel, Jeff Magee, Jeff Kramer Imperial College London, 180 Queen s Gate, London SW7 2BZ, UK {hf1, su2, jnm, jk}@doc.ic.ac.uk Abstract

More information

SAMPLING AND THE MOMENT TECHNIQUE. By Sveta Oksen

SAMPLING AND THE MOMENT TECHNIQUE. By Sveta Oksen SAMPLING AND THE MOMENT TECHNIQUE By Sveta Oksen Overview - Vertical decomposition - Construction - Running time analysis - The bounded moments theorem - General settings - The sampling model - The exponential

More information

Unit 1 Introduction to Software Engineering

Unit 1 Introduction to Software Engineering Unit 1 Introduction to Software Engineering João M. Fernandes Universidade do Minho Portugal Contents 1. Software Engineering 2. Software Requirements 3. Software Design 2/50 Software Engineering Engineering

More information

Chapter 4. Capturing the Requirements. 4th Edition. Shari L. Pfleeger Joanne M. Atlee

Chapter 4. Capturing the Requirements. 4th Edition. Shari L. Pfleeger Joanne M. Atlee Chapter 4 Capturing the Requirements Shari L. Pfleeger Joanne M. Atlee 4th Edition It is important to have standard notations for modeling, documenting, and communicating decisions Modeling helps us to

More information

Shared variables in CSP

Shared variables in CSP Shared variables in CSP FRANTISEK BURES, FRANTISEK SCUGLIK Faculty of Information Technology Brno University of Technology Bozetechova 2, 602 00 Brno Czech Republic Abstract: The algebra of Communicating

More information

A COMPUTER-AIDED SIMULATION ANALYSIS TOOL FOR SIMAN MODELS AUTOMATICALLY GENERATED FROM PETRI NETS

A COMPUTER-AIDED SIMULATION ANALYSIS TOOL FOR SIMAN MODELS AUTOMATICALLY GENERATED FROM PETRI NETS A COMPUTER-AIDED SIMULATION ANALYSIS TOOL FOR SIMAN MODELS AUTOMATICALLY GENERATED FROM PETRI NETS Albert Peñarroya, Francesc Casado and Jan Rosell Institute of Industrial and Control Engineering Technical

More information

Systems Analysis and Design in a Changing World, Fourth Edition

Systems Analysis and Design in a Changing World, Fourth Edition Systems Analysis and Design in a Changing World, Fourth Edition Systems Analysis and Design in a Changing World, 4th Edition Learning Objectives Explain the purpose and various phases of the systems development

More information

Capturing and Formalizing SAF Availability Management Framework Configuration Requirements

Capturing and Formalizing SAF Availability Management Framework Configuration Requirements Capturing and Formalizing SAF Availability Management Framework Configuration Requirements A. Gherbi, P. Salehi, F. Khendek and A. Hamou-Lhadj Electrical and Computer Engineering, Concordia University,

More information

Business Architecture Implementation Workshop

Business Architecture Implementation Workshop Delivering a Business Architecture Transformation Project using the Business Architecture Guild BIZBOK Hands-on Workshop In this turbulent and competitive global economy, and the rapid pace of change in

More information

Answer the first question and two further questions. i. action prefix ( -> ) [3 marks]

Answer the first question and two further questions. i. action prefix ( -> ) [3 marks] 1 Answer the first question and two further questions. 1. a. Define the meaning of the following constructs of the Finite State Process (FSP) notation. i. action prefix ( -> ) If x is an action and P a

More information

1 Executive Overview The Benefits and Objectives of BPDM

1 Executive Overview The Benefits and Objectives of BPDM 1 Executive Overview The Benefits and Objectives of BPDM This is an excerpt from the Final Submission BPDM document posted to OMG members on November 13 th 2006. The full version of the specification will

More information

Lecture 8 Requirements Engineering

Lecture 8 Requirements Engineering Lecture 8 Requirements Engineering Software Engineering ITCS 3155 Fall 2008 Dr. Jamie Payton Department of Computer Science University of North Carolina at Charlotte September 18, 2008 Lecture Overview

More information

Thesis Defense: Developing Real-Time Collaborative Editing Using Formal Methods

Thesis Defense: Developing Real-Time Collaborative Editing Using Formal Methods Thesis Defense: Developing Real-Time Collaborative Editing Using Formal Methods Lars Tveito September 9th, 2016 Department of Informatics, University of Oslo Outline Introduction Formal Semantics of Editing

More information

Analyzing Snapshot Isolation

Analyzing Snapshot Isolation Analyzing Snapshot Isolation Andrea Cerone Alexey Gotsman IMDEA Software Institute PODC 2016 presented by Dima Kuznetsov Andrea Cerone, Alexey Gotsman (IMDEA) Analyzing Snapshot Isolation PODC 2016 1 /

More information

Petri Net Arithmetic Models for Scalable Business Processes

Petri Net Arithmetic Models for Scalable Business Processes Petri Net Arithmetic Models for Scalable Business Processes Abd. Charis Fauzan, Riyanarto Sarno, Muhammad Ainul Yaqin Department of Informatics Institut Teknologi Sepuluh Nopember Surabaya, Indonesia fauzancharis@gmail.com,

More information

Requirements Engineering Process

Requirements Engineering Process Requirements Engineering Process Requirement A description of a service that the system is expected to provide and the constraints under which it must operate. 1 Requirement Types Functional Requirement

More information