Specification of requirements models

The main aim of this chapter is to present and discuss a set of modeling and specification techniques, in what concerns their ontology and support in the requirements representation of computer-based systems. A systematic classification of meta-models, also called models of computation, is presented. This topic is highly relevant since it supports the definition of sound specification methodologies in relation to the semantic definition of the modeling views to adopt for a given system. The usage and applicability of Unified Modeling Language (UML) diagrams is also related to their corresponding meta-models. A set of desirable characteristics for the specification methodologies is presented and justified to allow system designers and requirements engineers to more consciously define or choose a particular specification methodology. A heuristic-based approach to support the transformation of user into system requirements is suggested, with some graphical examples in UML notation.(undefined

Tool Support for DFD-UML Model-Based Transformations

This paper presents a model-based approach that combines the data-flow and object-oriented computing paradigms to model embedded systems. The rationale behind the approach is that both views are important for modelling purposes in embedded systems environments, and thus a combined and integrated usage is not only useful, but also fundamental for developing complex systems. We also show that by using models we were able to implement automated transformations between different views of the system under design. We exemplify the approach with an IPv6 router case study.HPY Research Foundation; CIMO - HH-02-383; Fundação para a Ciência e Tecnologia; Fundo Europeu de Desenvolvimento Regional - Project METHODES: Methodologies and Tools for Developing Complex Real-Time Embedded Systems (POSI/37334/CHS/2001)

Transformation of UML models for service-oriented software architectures

Comunicação apresentada ao IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ECBS 2005), 12, Washington, 2005.The main aim of this paper is to present how to transform user requirements models into a software architecture for mobile applications. The technique (called "4SRS") is essentially based on the mapping of UML use case diagrams into UML object diagrams. UML sequence, activity, and state diagrams and other artifacts can also be considered within the transformation decisions. The applicability of this technique is illustrated by presenting some results from an e-government mobile application. The development of mobile applications typically follow a service-oriented approach. A service is a software entity running on one or more machines and providing a particular type of function to a priori unknown clients. These services must communicate with each other, whose combination makes up a service-oriented architecture. The communication can involve either simple data passing or it could involve two or more services coordinating some activity. Some means of connecting services to each other is needed, so workflow is a critical part of making services effective. When those services react to changes on user context, application are context-aware. For mobile applications, the definition of the underlying service-oriented software architecture must consider the services themselves as user requirements, as well as the mobile operators entry-points and the final clients interfaces, and use them to characterize the platform.USE-ME.GOV - IST-2002-002294 ; Fundação para a Ciência e a Tecnologia - METHODES (POSI/CHS/37334/2001), STACOS (POSI/CHS/48875/2002)

Integration of DFDs into a UML - based model-driven engineering approach

The main aim of this article is to discuss how the functional and the object-oriented views can be inter-played to represent the various modeling perspectives of embedded systems.We discuss whether the object-oriented modeling paradigm, the predominant one to develop software at the present time, is also adequate for modeling embedded software and how it can be used with the functional paradigm.More specifically, we present how the main modeling tool of the traditional structured methods, data flow diagrams, can be integrated in an object-oriented development strategy based on the unified modeling language. The rationale behind the approach is that both views are important for modeling purposes in embedded systems environments, and thus a combined and integrated model is not only useful, but also fundamental for developing complex systems. The approach was integrated in amodel-driven engineering process, where tool support for the models used was provided. In addition, model transformations have been specified and implemented to automate the process.We exemplify the approach with an IPv6 router case study.FEDER -Fundação para a Ciência e a Tecnologia(HH-02-383

Air Traffic Management Abbreviation Compendium

As in all fields of work, an unmanageable number of abbreviations are used today in aviation for terms, definitions, commands, standards and technical descriptions. This applies in general to the areas of aeronautical communication, navigation and surveillance, cockpit and air traffic control working positions, passenger and cargo transport, and all other areas of flight planning, organization and guidance. In addition, many abbreviations are used more than once or have different meanings in different languages. In order to obtain an overview of the most common abbreviations used in air traffic management, organizations like EUROCONTROL, FAA, DWD and DLR have published lists of abbreviations in the past, which have also been enclosed in this document. In addition, abbreviations from some larger international projects related to aviation have been included to provide users with a directory as complete as possible. This means that the second edition of the Air Traffic Management Abbreviation Compendium includes now around 16,500 abbreviations and acronyms from the field of aviation

A Business User Model-Driven Engineering Method for Developing Information Systems

This thesis is all about raising the level of abstraction at which information systems are built, using business end-users knowledge and MDE to achieve the result. The work intro- duces, first, Micro-Modelling Language (μML), a lightweight modelling language that is used to express basic structural and behavioural aspects of information systems using effectivily business-users knowledge of their desired system. Throughout the work, graphical notation and semantics for the language concepts are identified, providing a simpler and semantically cleaned modelling language than standard UML and other UML-based languages. The work also proposes BUILD (Business-User Information-Led Development), an End- User MDE approach to support the construction of information systems using high-level specifications and accelerate the development process using layered model transformation and code generation. Throughout the thesis, a number of development phases and model transformation steps are identified to allow the low-level technical detail be introduced and developed automatically by rules, with less end-users engagement. Domain-Specific code generators, for generating executable Java Swing Applications code and MySQL script, are used to demonstrate the validity of the research

ADAM : a decentralized parallel computer architecture featuring fast thread and data migration and a uniform hardware abstraction

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 247-256).The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms.(cont.) An implementation of this architecture could migrate a null thread in 66 cycles - over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies.by Andrew "bunnie" Huang.Ph.D

ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction

The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms. An implementation of this architecture could migrate a null thread in 66 cycles -- over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies