Business process modeling is utilized by organizations for defining and reengineering their business processes. On the other hand, software requirements analysis activities are performed for determining the system boundaries, specifying software requirements using system requirements and resolving conflicts between requirements. From this point of view, these two activities are considered in different disciplines. An organization requiring its business processes to be defined and supported with information systems would benefit from performing business process modeling and requirements analysis concurrently. In this study, an approach enabling concurrent execution of business process modeling and requirements analysis is developed. The approach includes two business process modeling notations adapted to the research needs, a process defining the steps for implementing the approach and the requirements generation tool that generates natural language specification documents by using business process models. Within this study, two case studies are introduced / one describing the development of the approach and the other exploring if the total efficiency of performing business process modeling and requirements analysis activites would be increased by using the approach.

CE MEMOIRE EST COMPOSE DE TROIS CHAPITRES. LE PREMIER POSE LE PROBLEME DE LA SPECIFICATION DES SYSTEMES DE COMMANDE COMPLEXES FORMES D'UN ENSEMBLE D'AUTOMATISMES COMMUNICANTS. APRES AVOIR INTRODUIT LES RESEAUX DE PETRI EN TANT QU'OUTIL FORMEL POUR LA SPECIFICATION, IL EST MONTRE QUE CET OUTIL N'EST PAS CONTRADICTOIRE AVEC UNE APPROCHE STRUCTUREE. QUELQUES REGLES DE STRUCTURATION SONT PROPOSEES. CETTE DEMARCHE EST ILLUSTREE PAR UN EXEMPLE CONCRET. LE SECOND CHAPITRE MONTRE COMMENT UNE SPECIFICATION STRUCTUREE PEUT ETRE VALIDEE. LE TROISIEME CHAPITRE PROPOSE UN LANGAGE DE SPECIFICATION ADAPTE A LA DESCRIPTION STRUCTUREE D'AUTOMATISMES INTERCONNECTES. CE LANGAGE EST FONDE SUR L'UTILISATION DES RESEAUX DE PETRI. UN LOGICIEL D'ANALYSE SYNTAXIQUE ET SEMANTIQUE A ETE DEVELOPPE SUR MICROCALCULATEUR EN LANGAGE PASCAL. CE LOGICIEL TRADUIT LA SPECIFICATION EN TABLES ET EST CONCU DE FACON A PERMETTRE LE TELECHARGEMENT D'AUTOMATES PROGRAMMABLES SPECIALISES

Die Dissertationsschrift stellt eine Toolkette zum abstrakten Entwurf von Mikrosystemen vor. Mikrosysteme können aus Elementen verschiedener physikalischer Domänen bestehen und zusätzlich digitale Hardware sowie Software enthalten. Die Erfassung und Formalisierung dieser heterogenen Systeme stellt den ersten Schritt im Entwurfsprozess dar, die damit verbundene neue Methodik des Designs von Mikrosystemen bildet den Kern der vorliegenden Arbeit. Zur Erfassung der analogen Spezifikationsteile enthält die Arbeit die Schilderung und Implementierung neuer Datenstrukturen, die ausgehend von einer ausführlichen Anforderungsanalyse geschaffen wurden. Das abstrakte Systemverhalten wird mit Hilfe hybrider Automaten modelliert, die sowohl mit speziellen hybriden Werkzeugen als auch mit SystemC-AMS simulierbar sind. Darüber hinaus beschäftigt sich die Arbeit mit der Erfassung von Signalverläufen und Schaltplaninformationen. Die formalisierten Anforderungen ermöglichen erste Prüfungen der Spezifikation auf Konsistenz. Zur Unterstützung niedriger Abstraktionsebenen wie der Differentialgleichungsebene steht ein Wandler von SystemC-AMS nach VHDL-AMS bereit. In die Systembeschreibung mit SystemC-AMS ist die Definition und Verknüpfung von Kostenparametern integrierbar. Das daraus entstehende globale Gütemaß hilft dem Entwerferteam, die optimale Systemrealisierung zu finden. / The PhD thesis proposes a toolflow for the design of microsystems on higher abstraction levels. Microsystems may consist of components using effects in different physical domains plus additional digital hardware and software. The collection and formalization of these heterogeneous systems is a first step in the design process, the associated design method ist the key point of this work. The system behavior is modeled using hybrid automata, which are checkable using hybrid modelcheckers and simulable using SystemC-AMS. Furthermore the work deals with signal forms and circuit parameters. To support modeling on lower abstraction levels like differential algebraic equations a syntax conversion from SystemC-AMS to VHDL-AMS was included. The integration of cost factors into SystemC-AMS allows design space exploration during system simulation.

Code modularization provides benefits throughout the software life cycle; however, the presence of crosscutting concerns (CCCs) in software hinders its complete modularization. Traditional modularization techniques work well under the assumption that code being modularized is functionally orthogonal to the rest of the code; as a result, software engineers try to separate code segments that are orthogonal in their functionality into distinct modules. However, in practice, software does not decompose neatly into modules with distinct, orthogonal functionality. In this thesis, we investigate the modularization of CCCs in software using two different techniques. Firstly, we discuss IVCon, a GUI-based tool that provides a novel approach to the modularization of CCCs. We have designed IVCon to capture the multi-concern nature of code. IVCon enables users to create, examine, and modify their code in two different views, the woven view and the unwoven view. The woven view displays program code in colors that indicate which CCCs various code segments implement, while the unwoven view displays code in two panels, one showing the core of the program and the other showing all the code implementing each concern in an isolated module. IVCon aims to provide an easy-to-use interface for conveniently creating, examining, and modifying code in, and translating between, the woven and unwoven views. Secondly, we discuss LoPSiL, which is a location-based policy-specification language. LoPSiL is Turing-complete and provides users with language constructs that enable them to manipulate location information; hence, LoPSiL can be used to specify and enforce generic policies that might involve location-based constraints. We have implemented a LoPSiL compiler using AspectJ, and we observe and discuss how the use of traditional units of modularization---aspects in this case---help modularize functionally orthogonal CCCs such as security and auditing.

To ensure compliance with specifications during construction, a formal review process, called the submittals process is typically implemented, whereby the contractor is required to submit proposals for materials, equipment, and processes for the owner’s approval within a short period of time. This procedure can be a difficult task because of lack of time, lack of information in the submittal package, difficulty in retrieving related data, and lack of defined criteria for evaluation. This research introduces development of a framework for submittal evaluation that considers the operational impact of any minor variation in the required specifications. The evaluation mechanism uses the Multi-Attribute Utility Theory (MAUT) approach, which is adaptable to the varying requirements of organizations. Through the process of analyzing the current submittal mechanism, a list of key submittals is defined and the top one (chiller) is selected to be the focus of the research. The governing criteria (evaluation parameters) are defined for the selected submittal item and categorized into two categories: inflexible and flexible. The inflexible parameters have been dealt with using checklists with predefined threshold that must be met without tolerance. Flexible parameters have been analyzed using utility functions that represent decision maker preferences and tolerance levels. Accordingly, the evaluation process considers multi-parameters to determine an overall utility for the submittal and the value-based condition for accepting it, incorporating LEED requirements. The investigation is based on data provided by three main organizations, as well as intensive meetings and interviews with experts from each participating organization. The outcome of this investigation is the development of evaluation criteria and checklist parameters that are used as the basis of a value-based evaluation, which is the core of the developed decision support system. In summary, it has been demonstrated that a decision support system for the evaluation of construction submittals can be constructed and that it will provide numerous benefits: an expedited decision process, an audit trail for decisions, more consistent and objective decisions, risk identification, internal alignment of organizational values, and improved lifecycle asset performance. The benefits were validated by demonstration, and by experts' evaluations.

Darbe nagrinėjamas realiojo laiko sistemų, specifikuotų agregatiniu metodu, verifikavimo uždavinys. Sprendžiant šį uždavinį, naudojama pasiekiamų būsenų grafo sudarymo metodika, leidžianti įvertinti laiko intervalus, kuriais įvyksta sistemoje apibrėžti įvykiai. Darbe nagrinėjami pasiekiamų būsenų grafo sudarymo algoritmai ir pateikta prototipinėse programose naudojama duomenų struktūra. Suformuluoti ir įrodyti teiginiai apie pasiekiamų būsenų grafo sudarymo algoritmo sudėtingumą (maksimalaus vienos būsenos galimų perėjimų skaičiaus; grafo viršūnių skaičiaus augimo priklausomybės nuo įvykių skaičiaus; maksimalaus įvykių skaičiaus elgsenoje laiko intervale; maksimalaus viršūnių skaičiaus laiko intervale.) Pateikta trijų testinių sistemų grafų automatizuoto sudarymo analizė. Parodyta, kad Simplekso optimizavimo procedūra laiko momentų palyginimui gali būti naudojama tik atskirais atvejais. / The work deals with a verification task of real time system specified by aggregate method. While solving the task, a technique for creation a reachable state graph is used. The technique permits to evaluate intervals of time when the defined system events occur. Reachable state graph creation algorithms are analysed in the work. A data structure used in prototype software is presented in the work too. Assertions about a complexity of algorithm for reachable state graph creation are formulated and proved. These assertions concern maximum number of transitions from single state, dependency of number of graph verteles growth on a number of events, maximum number of events in a behaviour during time interval, and maximum number of vertexes during time interval. Analysis of automated creation of graphs for three test systems is presented. It is shown that Simplex optimisation procedure for comparison of time intervals can be used only in certain cases.

Reikalavimų inžinerija yra bene svarbiausias etapas informacinės sistemos kūrime. Tik tikslus reikalavimų specifikavimo proceso valdymas leis sėkmingai projektuoti, realizuoti ir įdiegti informacines sistemas kompiuterizuojamose srityse. Dažnai neefektyvus reikalavimų rinkimo procesas tampa projekto nesėkmės ar programinės įrangos defekto pagrindu. Be to, aptiktų netikslumų pašalinimo kaina kyla eksponentiškai, kai jie atrandami vėlyvosiose projekto stadijose. Todėl įmonės ar asmenys, siekiantys pagerinti projekto kokybę ir produktyvumą, turėtų ypatingai atkreipti dėmesį į reikalavimų valdymo procesą. Pastebėta, jog reikalavimų specifikavimo procesas vis labiau kompiuterizuojamas, o reikalavimų valdymo įrankių bei šablonų naudojimas gerina reikalavimų specifikacijos ir būsimo produkto kokybę. Šis magistrinis darbas yra skirtas reikalavimų specifikavimo šablonų pagrindu eksperimentiniam tyrimui ir jo vertinimui. / The usage of computers takes more important place in our modern life. It was noticed that more and more enterprises use requirement management tools and specification templates to increase quality of requirement specification and projects. Very often ineffective requirements-gathering processes are the source of project failures and software defects. In addition, the cost of fixing defects rises exponentially as their discovery occurs later in the development process. However, a solid requirements process is fundamental to an effective overall process, and companies seeking increased quality and productivity should start with the requirements process. The intention of this work is to make the experimental research of requirements specification using templates and evaluate it.

In this thesis, we present a hybrid semantic web service discovery framework that exploits both the signatures and specifications of a web service, whilst adopting logical and non-logical service matching methods. For signature level service matching, we have developed two techniques: (i) logical similarity measures applied to the services’ input/output concepts; and (b) non-logical matching based on a Structure Preserving Semantic Matching algorithm. For specification level service matching, we have applied a unique short sentence matching approach on the textual-description of a web service. We evaluated the performance of our S5 Web Service Matchmaker using the OWLS-TC dataset, and furthermore compared its performance with the OWLS-MX discovery model. Our results indicate that S5 Web Service Matchmaker offers an improved web service matching performance with a significant increase in recall and subtle improvements in precision. / Web services are independent software systems designed to offer machine-to-machine interactions over the WWW to achieve well-described operations. The description of a web service entails (a) a syntactic component detailing the service’s operations and data structures in terms of the Web Services Description Language (WSDL), and (b) a semantic component that offers a semantic description, in terms of an ontology, of the services’ data and operations. Typically, service providers expose their services to the public by providing brief descriptions of the service’s operations; the challenge is to discover the right service based on rather sparse service descriptions in response to a specific service request. In this thesis, we present a hybrid semantic web service discovery framework that offer semantic web service discovery at both the signature and specification levels of a web service, whilst exploiting logical and non-logical service matching methods. For signature level service matching, we have developed two techniques: (i) logical similarity measures applied to the services’ input/output concepts; and (b) non-logical matching based on a Structure Preserving Semantic Matching algorithm. For specification level service matching, we have applied a unique short sentence matching approach on the textual-description of a web service. The cumulative similarly measures determine the overall similarity of a services’ description with the service request. We evaluated the performance of our S5 Web Service Matchmaker using the OWLS-TC dataset, and furthermore compared its performance with the OWLS-MX discovery model. Our results indicate that S5 Web Service Matchmaker offers an improved web service matching performance with a significant increase in recall and subtle improvements in precision.

Informacijos sistemų (IS) kūrimo procesas turi gan nusistovėjusią struktūrą, tačiau ji neužtikrina aukštos kuriamų sistemų kokybės ir optimalaus atitikimo vartotojų poreikiams. Paprastai IS kūrimas susideda iš šių etapų: reikalavimų surinkimo, analizės ir specifikavimo, projektavimo, realizavimo, testavimo, diegimo ir sistemos palaikymo. Būtent išsamus ir teisingas reikalavimų specifikacijos sudarymas užtikrina tolimesnę projekto sėkmę. Tai inicijuoja naujų metodų kūrimą, kurie akcentuoja veiklos taisyklių (VT) koncepciją. Pagal šią koncepciją IS kūrimo metu taisyklės atskiriamos nuo kitų sistemą sudarančių objektų, taip sukuriant prielaidas tikslesniam reikalavimų fiksavimui. Šio darbo tikslas išnagrinėti KTU Informacijos sistemų katedroje sukurtą veiklos taisyklėmis grindžiamos reikalavimų specifikacijos sudarymo metodą ir pagerinti tiriamo metodo pritaikomumą sistemos projektavimo stadijoje. Pagal minėtą metodą, baigus reikalavimų specifikavimo procesą, visi surinkti ir struktūrizuoti reikalavimai fiksuojami saugykloje. Analizuojant šiuos duomenis siekiama turimus reikalavimus transformuoti į UML kalbos diagramas. / Information system (IS) development process has a relatively consistent structure, although it does not guarantee that all user requirements are represented correctly in the final system. Typically IS development consists of the following phases: requirements capture, analysis and specification, design, development, testing, installation and system support. The complete and correct requirement specification facilitates the further success of the project, therefore it is extremely important. This simple fact is one of the reasons why new approaches, such as those based on the business rules (BR) concept, keep on emerging. According to the BR concept, the business rules are separated from other system constitutive objects, thus creating an environment for a more accurate requirement capture. The main goal of this work was to examine the business rules based requirements specification method developed at KTU Department of Information system and come up with the ways of how to use the specified requirements during the system design phase. The decision was made to create the requirements-to-UML diagrams transformation methodology, which is presented in this document. The methodology was evaluated using a partial prototype implementation showing it can be applied in practice.

Many software systems eventually undergo changes to their basic architectural structure. Such changes may be prompted by new feature requests, new quality attribute requirements, changing technology, or other reasons. Whatever the causes, architecture evolution is commonplace in real-world software projects. Today’s software architects, however, have few techniques to help them plan such evolution. In particular, they have little assistance in planning alternatives, making trade-offs among these different alternatives, or applying best practices for particular domains. To address this, we have developed an approach for assisting architects in planning and reasoning about software architecture evolution. Our approach is based on modeling and analyzing potential evolution paths that represent different ways of evolving the system. We represent an evolution path as a sequence of transitional architectural states leading from the initial architecture to the target architecture, along with evolution operators that characterize the transitions among these states. We support analysis of evolution paths through the definition and application of constraints that express rules governing the evolution of the systemand evaluation functions that assess path quality. Finally, a set of these modeling elements may be grouped together into an evolution style that encapsulates a body of knowledge relevant to a particular domain of architecture evolution. We evaluate this approach in three ways. First, we evaluate its applicability to real-world architecture evolution projects. This is accomplished through case studies of two very different software organizations. Second, we undertake a formal evaluation of the computational complexity of verifying evolution constraints. Finally, we evaluate the implementability of the approach based on our experiences developing prototype tools for software architecture evolution.