The SODA AOSE Methodology
|
|
- Thomasina Pope
- 5 years ago
- Views:
Transcription
1 The SODA AOSE Methodology Multiagent Systems LM Sistemi Multiagente LM Ambra Molesini & Andrea Omiini {ambra.molesini, Dipartimento di Informatia Sienza e Ingegneria (DISI) Alma Mater Studiorum Università di Bologna a Cesena Aademi Year 2012/2013 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
2 Outline 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
3 Outline SODA: Overview 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
4 SODA: Overview SODA: Soieties in Open and Distributed Agent spaes SODA is an agent-oriented methodology for the analysis and design of agent-based systems... fouses on inter-agent issues, like the engineering of soieties and environment for MAS [Omiini, 2001]... adopts agents and artifats after the A&A meta-model as the main building bloks for MAS development [Molesini et al., 2005]... introdues a simple layering priniple in order to ope with the omplexity of system desription [Molesini et al., 2006]... adopts a tabular representation Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
5 SODA: Overview SODA: Overview Referenes Tables Analysis Requirements Analysis Analysis Requirements Tables Domain Tables Relations Tables Responsibilities Tables Dependenies Tables Topologies Tables Transitions Tables Design Mapping Tables Arhitetural Design Detailed Design Entities Tables Interation Tables Constraints Tables Topologial Tables Agent/Soiety Design Tables Environment Design Tables Interation Design Tables Topologial Design Tables Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
6 SODA: Overview Software Engineering Methodologies: Conerns Methodology [Ghezzi et al., 2002] A methodology is a olletion of methods overing and onneting different stages in a proess The purpose of a methodology is to presribe a ertain oherent approah to solving a problem in the ontext of a software proess by preseleting and putting in relation a number of methods A methodology has two important omponents one that desribe the proess elements of the approah: the abstrations one that fouses on the steps that have to be done, the work produts that have to be produed and their doumentation... : the proess Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
7 Outline SODA: Abstrations 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
8 SODA Abstrations SODA: Abstrations The abstrations supported by SODA are logially divided into three ategories the abstrations for modelling/designing the system ative part (task, role, agent, et.); the abstrations for the reative part (funtion, resoure, artifat, et.); the abstrations for interation and organisational rules (relation, dependeny, interation, rule, et.). Eah of the four SODA s steps models the system by exploiting a speifi subset of the abstrations eah subset always inludes at least one abstration for eah of the above ategories: at least one abstration for the system ative part, one for the reative part, and another for interation and organisational rules. Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
9 SODA: Abstrations SODA Ative Abstrations Requirement Task Ation Role Soiety Agent Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
10 SODA: Abstrations SODA Reative Abstrations Requirement Legay-System Funtion Topology Resoure Operation Spae Aggregate Artifat Workspae Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
11 SODA: Abstrations SODA Interation & Normative Abstrations Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
12 Outline SODA: Abstrations A&A in SODA 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
13 SODA: Abstrations A&A in SODA Artifats Artifats take the form of objets or tools that agents share and use to support their ativities ahieve their objetives Artifats are expliitly designed to provide some funtions whih guide their use by agents Example: oordination artifats Govern soial ativities Enable and mediate agent interation Mediate the interation between individual agents and their environment Capture, express and embody the parts of the environment that support agents ativities Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
14 SODA: Abstrations A&A in SODA Classifiation A possible lassifiation for artifats Individual artifats exploited by one agent only in order to mediate its interation with the environment. In general, individual artifats are not diretly affeted by the ativity of other agents, but an, through linkability, interat with other artifats in the MAS Soial artifats exploited by more than one agent, mediate between two or more agents in a MAS. In general, soial artifats typially provide MAS with a servie whih is in the first plae meant to ahieve a soial goal of the MAS, rather than an individual agent goal Environmental artifats mediate between a MAS and an external resoure. In priniple, environmental artifats an be oneived as a means to raise external MAS resoures up to the agent ognitive level Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
15 SODA: Abstrations Agents & Artifats (A&A) A&A in SODA Artifats onstitute the basi building bloks both for MAS analysis/modelling MAS development Agents and artifats an be assumed as two fundamental abstrations for modelling MAS struture Agents speaking with other agents Agents using artifats to ahieve their objetives Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
16 SODA: Abstrations A&A in SODA A&A Ingredients in SODA Agents model individual and soial ativities Artifats glue agents together, as well as MAS and the environment artifats mediate between individual agents and MAS artifats build up agent soieties artifats wrap up the resoures of MAS and bring them to the ognitive level of agents Workspaes struture agents and artifats organisation & interation Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
17 Outline SODA: Abstrations The SODA meta-model 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
18 SODA: Abstrations The SODA meta-model SODA Abstrations: A Formal Representation? Abstrations??? Methodologies?? Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
19 SODA: Abstrations The SODA meta-model SODA Abstrations: A Formal Representation? Abstrations??? Methodologies?? How an we represent the SODA abstrations?... Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
20 SODA: Abstrations The SODA meta-model SODA Abstrations: A Formal Representation? Abstrations??? Methodologies?? How an we represent the SODA abstrations? and their relationships?... Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
21 SODA: Abstrations The SODA meta-model SODA Abstrations: A Formal Representation? Abstrations??? Methodologies?? How an we represent the SODA abstrations? and their relationships? in a standard way in order to support methodologies omparisons?... Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
22 SODA: Abstrations The SODA meta-model SODA Abstrations: A Formal Representation? Abstrations??? Methodologies?? How an we represent the SODA abstrations? and their relationships? in a standard way in order to support methodologies omparisons?... The meta-modelling tehnique from Software Engineering an help us Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
23 SODA: Abstrations The SODA meta-model Meta-models for Software Engineering Methodologies Definition Meta-modelling is the analysis, onstrution and development of the frames, rules, onstraints, models and theories appliable and useful for the modelling in a predefined lass of problems A meta-model enables heking and verifying the ompleteness and expressiveness of a methodology by understanding its deep semantis, as well as the relationships among onepts in different languages or methods The proess of designing a system onsists of instantiating the system meta-model that the designers have in their mind in order to fulfill the speifi problem requirements [Bernon et al., 2004] Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
24 SODA: Abstrations The SODA meta-model Using Meta-models Meta-models are useful for speifying the onepts, rules and relationships used to define a family of related methodologies Although it is possible to desribe a methodology without an expliit meta-model, formalising the underpinning ideas of the methodology in question is valuable when heking its onsisteny or when planning extensions or modifiations In the speifi ase of AOSE, the onepts in the meta-model assume the name of MAS Meta-model Elements (MMMEs) Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
25 SODA: Abstrations The SODA meta-model SODA Abstrations Adopted at Eah Step Analysis phase Requirements Analysis the system s requirements and the external environment are analysed and modelled Analysis the system s requirements are modelled in terms of tasks, funtions, topologies and dependenies Design phase Arhitetural Design in this phase we analyse the solution domain, the system is modelled in terms of roles, resoures, ations, operations, interations, rules and spaes Detailed Design in this phase we design the system in terms of agents, soieties, artifats, ompositions, aggregates, workspaes, uses, links to, manifests and speaks to Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
26 The SODA Meta-model SODA SODA: Abstrations The SODA meta-model 2010/06/25 JUDE(Free Version) pkg Ator 1 Requirement partiipates Relation partiipates LegaySystem ExternalEnvironment * * * * * * Requirements Analysis 1..* 1..* 1..* 0..* 1..* 1..* Task 1 * partiipates Dependeny * * * 1..* 1 partiipates partiipates Funtion * 1..* * 1 Analysis partiipates 0..* 0..* 1 Topology partiipates * 1 * 1..* 1..* 1..* 1..* Ation * partiipates * Interation partiipates Operation 1..* * * 1..* 0..* 1..* performs onstrains provides 1 1..* Role onstrains Rule onstrains Resoure 1..* 1..* 1..* 1..* 1..* 1..* 1..* * 1..* onstrains * 1..* * partiipates partiipates Spae 1..* Arhitetural Design 1..* 0..* onnetion pereives onnetion 1..* 1..* 1..* Workspae is alloated 1 1 Environmental Artifat Detailed Design * Agent 1..* 1..* Use 1..* 1..* Artifat 1..* 1..* 1..* SpeakTo 1..* 1..* 1..* 1..* partiipates Manifest 1..* 1..* Soial Artifat Individual Artifat 1 Composition partiipates 1..* LinkedTo 1..* Soiety Aggregate Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
27 SODA: Abstrations The SODA meta-model Requirements Analysis Meta-model Ator ExternalEnvironment 1 1 * * Requirement partiipates Relation partiipates LegaySystem * * * * Task partiipates Dependeny * * * 1..* * partiipates * * Funtion partiipates Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
28 SODA: Abstrations The SODA meta-model Requirements Analysis Ator is a user of the systems that needs several funtionalities from the systems. We use the system as an ator in order to express several non-funtional requirements as seurity, standards and so on. The ators are used in order to failitated the trae of the soures of requirements. Requirement is a funtional, non-funtional or domain desription of the system servie and onstraint of the system. External Environment is the external world of the system made by legay systems that will interat with the system. Legay System is a single legay system. Relation is a relationship among requirements and ontexts. Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
29 * SODA: Abstrations The SODA meta-model Analysis Requirement Meta-model * partiipates Relation partiipates * * * 1 LegaySystem * Task * * partiipates * Dependeny 1..* * partiipates * * Funtion partiipates partiipates 1 Topology partiipates * * Ation * partiipates * Interation partiipates * * Operation Molesini & Omiini 1..* (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
30 SODA: Abstrations The SODA meta-model Analysis Task is an ativity that requires one or more ompetenes and the use of funtions Funtion is an reative ativity that aimed at supporting tasks Dependeny is any relationship (interations, onstraints... ) among other (tasks and/or funtions) abstrat entities Topology is any topologial neessity of the environment s struture, often ould be derived from funtions. It is important to note that topology ould influene the tasks beause topology ould onstrains the ahievement of tasks Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
31 partiipates SODA: Abstrations 1 The SODA meta-model Topology partiipates Arhitetural Design Meta-model * * Ation * partiipates * Interation partiipates * * Operation performs Role 1..* 1 1..* onstrains 1..* 1..* partiipates 1..* 0..* onstrains 1..* Spae Rule 1..* onstrains 1..* * 1..* onstrains partiipates 1..* provides 1 1..* Resoure * 0..* onnetion Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
32 SODA: Abstrations The SODA meta-model Arhitetural Design Role is defined as the abstration responsible for the ahievement of one or more tasks Resoure is defined as the abstration that provides some funtions Ation represents an ation that the role potentially ould be able to do Operation represents the operation that the resoure is potentially able to provide Interation represents the ats of the interation among roles, among resoures and between roles and resoures Rule enables and bounds the entities behaviour Spae is a oneptual lous in the environment Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
33 SODA: Abstrations Detailed Design Meta-model The SODA meta-model Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
34 Detailed Design SODA: Abstrations The SODA meta-model Agent is an autonomous entity able to play several roles, and perform ations Soiety is a group of interating agents and artifats whose overall behaviour is essentially an autonomous, proative one Artifat is a reative entity able to provide several funtions, and make operations available to agents Aggregate is a group of interating artifats and agents whose overall behaviour is essentially a funtional, reative one. Workspae is a oneptual lous in the environment Use the at of interation between agent and artifat: agent uses artifat SpeakTo the at of interation among agents: agent speaks with another agent Manifest the at of interation between artifat and agent: artifat manifests itself to agent LinkedTo the at of interation among artifat: artifat is linked to another artifat Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
35 Outline SODA: Proess 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
36 SODA: Proess Development Proess Development Proess [Cernuzzi et al., 2005] The development proess is an ordered set of steps that involve all the ativities, onstraints and resoures required to produe a speifi desired output satisfying a set of input requirements Typially, a proess is omposed by different stages/phases put in relation with eah other Eah stage/phase of a proess identify a portion of work definition to be done in the ontext of the proess, the resoures to be exploited to that purpose and the onstraints to be obeyed in the exeution of the phase Case by ase, the work in a phase an be very small or more demanding Phases are usually omposed by a set of ativities that may, in turn, be oneived in terms of smaller atomi units of work (steps) Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
37 Outline SODA: Proess SPEM 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
38 SODA: Proess SPEM SPEM SPEM (Software Proess Engineering Meta-model) [Objet Management Group, 2008] is an OMG standard objet-oriented meta-model defined as an UML profile and used to desribe a onrete software development proess or a family of related software development proesses SPEM is based on the idea that a software development proess is a ollaboration between ative abstrat entities alled roles whih perform operations alled ativities on onrete and real entities alled work produts Eah role interats or ollaborates by exhanging work produts and triggering the exeution of ativities The overall goal of a proess is to bring a set of work produts to a well-defined state Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
39 SODA: Proess SPEM SPEM Notation Stereotype Ativity Category Composite role and Team Guidane Milestone Proess Proess Component Proess Pattern Symbol Role Definition and Use Task Definition and Use Tool Definition WorkProdut Definition and Use Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
40 Outline SODA: Proess The SODA Proess Mehanisms 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
41 SODA: Proess The SODA Proess Mehanisms Layering: The Intuition A omplex system is any system featuring a large number of interating omponents, whose aggregate ativity is nonlinear and typially self-organisation [Simon, 1996]. Human mind is not able to keep trak of a huge number of different omponents / parts too many details... We need... models apturing systems details at different levels of abstration Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
42 SODA: Proess Layering: Zooming Agents The SODA Proess Mehanisms Agent Artifat Soiety S Artifat Agent Agent Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
43 SODA: Proess Layering: Zooming Agents The SODA Proess Mehanisms Agent Artifat Soiety Artifat Agent Agent Artifat Agent Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
44 SODA: Proess The SODA Proess Mehanisms Layering: Zooming Artifats Artifat Artifat Aggregate Artifat Agent Agent Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
45 SODA: Proess Layering: Zooming Artifats The SODA Proess Mehanisms Artifat Artifat Aggregate Artifat Agent Agent Artifat Agent Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
46 SODA: Proess The SODA Proess Mehanisms Managing Complexity Complexity is inherent in real-life systems Complexity management: balaning between ompleteness and larity Analysis and design of real-life systems proeed middle-out Complex systems all for layered, hierarhial explanations Eah layer is in some sense autonomous at the same time, layers are organised in a hierarhy eah layer is stritly onneted with the upper /lower layers Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
47 SODA: Proess The SODA Proess Mehanisms Layering, Systems & MAS In many branhes of sienes, systems are represented as organised on different layers Eah level is essential to the general understanding of the system s wholeness, but at the same time, no level an be understood in isolation When applied to the engineering of MAS, this priniple suggests that MAS models, abstrations, patterns and tehnologies an be suitably ategorised and ompared using a layered desription that agent-oriented proesses and methods should support some forms of MAS layering Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
48 SODA: Proess The SODA Proess Mehanisms Layering in SODA The layering priniple is ahieved by means of the zoom and projetion mehanisms [Molesini et al., 2006, Molesini et al., 2010] Two kinds of zoom in-zoom from an abstrat to a more detailed layer out-zoom from a detailed to a more abstrat layer The projetion mehanism projets entities from one to another layer Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
49 SODA: Proess Layering in SODA: Proess The SODA Proess Mehanisms new layer? no yes Selet Layer inreases detail inreases abstration In-zoom Out-zoom Projetion Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
50 SODA: Proess The SODA Proess Mehanisms Layering in SODA: Ativities, Tasks, Roles, and Workproduts Zooming table <<input>> SODA Tales <<input>> Zooming table <<input>> SODA Tales <<input>> <<output>> <<performs, Layering Expert primary>> <<output>> In-zoom <<output> > In-zoom <<predeessor>> Selet Layer Selet Layer <<performs, primary>> Layering Expert (L) SODA Tales Zooming table (L+1) SODA Tales SODA Tales Zooming table <<input>> <<input>> Zooming table <<input>> SODA Tales <<input>> <<predeessor>> Projetion <<output>> Projetion SODA Tales <<performs, primary>> Layering Expert <<performs, Out-zoom primary>> Out-zoom <<input>> Layering Expert <<output>> <<output>> Zooming table (L-1) SODA Tales Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
51 SODA: Proess The SODA Proess Mehanisms Layering in SODA: Workproduts & MMMEs R FD Role R FD Ation R FD Task R FD Funtion FD R R Depeneny FD R Topology FD Resoure R FD Operation R FD Interation R FD Rule R FD Spae Zooming table F D F F R R D D R R F D Ator Requirement Relation LegaySystem Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
52 SODA: Proess The SODA Proess Mehanisms Layering Priniple In general, when working with SODA, we start from a ertain layer, we ould all ore layer, and it is labelled with The ore layer is always omplete In the other layer we find only the in/out zoomed entities and the projetion entities. The in-zoomed layers are labelled with +1, +2 and the out-zoomed layers are labelled -1, The projetion entities will be labelled with + if the projetion is from abstrat layer to detailed layer, - otherwise The only relations between layers are the zooming relation express by means of zooming table (in the following) If we have relation between entities belonging different layers we have to projet these entities in the same layer Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
53 Example SODA: Proess The SODA Proess Mehanisms -E1 -r1 E0 C-1 E1 r1 E2 E3 Core Layer E4 r2 E5 +r1 +E2 r5 E10 E11 C+1 r3 E6 +r2 r4 +r1 E7 E8 E9 +E2 C+2 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
54 System s Views SODA: Proess The SODA Proess Mehanisms Horizontal view analyse the system in one level of detail Vertial view analyse one kind of abstrat entity -E1 E0 C-1 -E1 E0 C-1 E1 E2 E3 Core Layer E1 E2 E3 Core Layer E4 E5 +E2 C+1 E4 E5 +E2 C+1 E6 E7 E8 E9 +E2 E10 E11 C+2 E6 E7 E8 E9 +E2 E10 E11 C+2 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
55 Zooming Artifats I SODA: Proess The SODA Proess Mehanisms L L+1 Physial print Environmental Artifat san Artifat Soial Artifat Environmental Artifat Zooming out Zooming in Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
56 Zooming Artifats II SODA: Proess The SODA Proess Mehanisms L L+1 interfae interfae op1.1 op1 op2 Artifat op1.2 op1.3 op2 Artifat Zooming out Zooming in Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
57 Outline SODA: Proess The Proesses 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
58 SODA: Proess The Proesses SODA Proess Organisation Four sub-phases: Requirements Analysis, Analysis, Arhitetural Design, Detailed Design Eah sub-phase is modelled as a separate and independent Method Content A speifi proess is defined for eah sub-phase Reusing of these proesses to reate the whole SODA proess Eah sub-phase and eah model in the sub-proesses is represented as an ativity, related to the orresponding SPEM s Task(s) Adoption of the Layering Capability pattern Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
59 SODA: Proess The Proesses The SODA Proess Life Cyle [Molesini et al., 2008] Layering Requirements Analysis Analysis Arhitetural Design Detailed Design Layering Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
60 SODA: Proess Requirements Analysis Proess The Proesses start new iteration Requirements modelling Environment modelling another layer? another laye? yes yes Requirements layering no no Environment layering another layer? Relations modelling yes Relations layering Are the models well speified? yes no Layering Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
61 SODA: Proess The Proesses Requirements Analysis Proess Requirements modelling ativity requirement and ator are used for modelling the ustomers requirements and the requirement soures Environment modelling ativity external environment notion is used as a ontainer of the legay systems that represent the legay resoures of the environment Relation modelling ativity relation is used for modelling the relationships between requirements and legay systems Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
62 SODA: Proess The Proesses Requirements Analysis: Ativities, Tasks, Roles and Workproduts Requirement Layering <<output>> <<predeessor>> <<predeessor>> Requirements Modelling <<predeessor>> Zooming table <<output>> a Requirements speifiation <<input>> Environment Modelling <<predeessor>> <<predeessor>> <<input>> Environment layering <<output>> Ators Desription a <<input>> <<input >> Requirements speifiation Zooming table <<output>> <<performs, assist>> <<performs, primary>> Ator table <<input>> <<perform s, primary>> Requirement Analyst Domain Expert <<input>> <<performs, assist>> <<input>> a Requirements Desription Requirements speifiation <<output>> <<output>> Ator-Requirement table a Requirements speifiation <<predeessor>> Requirement table Layering <<input>> <<input>> Requirement Analyst <<predeessor>> <<performs, primary>> Relations Modelling Relations Desription <<performs, assist>> <<performs, assist>> <<predeessor>> LegaySystems Desription <<output>> <<input>> <<output>> Domain Tables <<performs, assist>> <<performs, primary>> <<predeessor>> <<predeessor>> Domain Tables Relations Tables Environment Analyst Zooming table Zooming table Domain Expert <<output>> Relation Layering Domain Expert Environment Analyst Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
63 SODA: Proess The Proesses Requirements Analysis: Workproduts & MMMEs D Domain Tables LegaySystem table D LegaySystem D Ator Ator table ExternalEnvironment- LegaySystem table External Environment D Requirement Requirement table Requirements Tables Relation table D Relation R R Q Relations Tables Ator Zooming table Q Q R Requirement Ator-Requirement table Requirement- Relation table Requirement F D F F R R D D R R F D R R Ator Requirement Relation LegaySystem LegaySystem- Relation table Q LegaySystem Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
64 SODA: Proess The Proesses Analysis Proess I new iteration Moving from requirements other layer? yes Layering no Task Analysis Funtion analysis Topology Analysis Task Layering another layer? yes no another layer? another layer? yes yes Topology Layering Funtion Layering no no Dependeny Analysis another layer? yes Dependeny Layering Are the models well speified? yes no Layering Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
65 SODA: Proess The Proesses Analysis Proess II Moving from Requirements ativity: the abstrations identified in the previous step are mapped onto the abstrations adopted in this stage to generate the initial version of the Analysis models Task analysis ativity task is exploited for analysing the system s ative part Funtion analysis ativity funtion is exploited for analysing the system s funtional part Topology analysis ativity topology is exploited for analysing the topologial onstraints over the environment Dependeny analysis ativity dependeny is exploited for the analysis of the relations highlighted in the previous step and for the definition of new relationship among abstrat entities identified in this stage Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
66 SODA: Proess The Proesses Analysis: Ativities, Tasks, Roles and Workproduts Zooming table Relations Tables Domain Tables Requirements Tables System Analyst <<input>> <<input>> <<input>> <<input>> <<performs, primary>> Task Layering <<output>> Referenes Tables <<predeessor>> <<output>> Map Requirements- Analysis <<output>> <<predeessor>> Zooming table <<predeessor>> <<predeessor>> <<predeessor>> Task Desription <<input>> Layering Task Analysis <<input>> Referenes Tables Moving from requirements <<performs, primary>> <<output>> System Analyst <<perf orms, primar y>> Topology Layering <<predeessor>> <<output>> <<output>> Funtion Desription <<input>> Zooming table <<predeessor>> <<predeessor>> Zooming table <<predeessor>> <<predeessor>> <<input>> <<input>> <<predeessor>> Topology Analysis Topology Desription <<predeessor>> Layering Referenes Tables Funtion Analysis Responsibilities Tables <<predeessor>> <<performs, primary>> <<input>> System Analyst <<input>> <<input>> <<output>> <<predeessor>> <<predeessor>> <<input>> <<predeessor>> Dependeny Desription <<performs, primary>> System Analyst Referenes Tables <<input>> <<input>> <<output>> Topologies Tables Referenes Tables <<predeess or>> Dependeny Analysis <<predees sor>> Dependeny Layering <<output >> Zooming table Dependenies Tables Responsibilities Tables Funtion Layering Topologies Tables Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
67 SODA: Proess The Proesses Analysis: Workproduts & MMMEs D Task R Q Requirement Referene Requirement- Task table Responsibilities Tables Task table RF Task D RF Funtion Funtion Table Funtion R Q Requirement Referene Requirement- Funtion table Dependeny table RF Dependeny D Q R Dependeny R Q Requirement Referene Requirement- Dependeny table Dependenies Table Task-Dependeny table Task Q R D D Topology Funtion- Dependeny table Funtion R Q Requirement Referene Requirement- Topology table Referenes Tables Topology- Dependeny table Q Topology R D Funtion R Q LegaySystem D Referene LegaySystem- Funtion table Topology table RF Topology Q R Topology Topologies Tables Task-Topology table Task R Q LegaySystem D Referene LegaySystem- Topology table Zooming table Funtion- Topology table Q Funtion R Dependeny F F F D D D FD R R R R R Q Relation Referene Relation- Dependeny table Task Funtion Dependeny Topology Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
68 SODA: Proess Arhitetural Design Proess The Proesses new iteration other layer? Transition no yes Layering Role Design Resoure Design another layer? another layer? Spae design yes yes another layer? Role Layering no Resoure Layering no yes Spae Layering Interation Design another layer? no yes no Interation Layering Constraint Design need another layer? yes Constraint Layering are all the models well speified? yes no Layering Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
69 Transition ativity the abstrations identified in the previous step are mapped onto the abstrations adopted in this stage so as to generate the initial version of the Arhitetural Design models Role design ativity assignment tasks to roles and identifiation of the ations neessary in order to ahieve eah speifi tasks Resoure design ativity assignment of funtions of responsibilities for providing to resoures and identifiation of the operations neessary for providing eah speifi funtion Spae design ativity identifiation of the spaes starting from the topology onstraints analysed in the previous step Interation design ativity identifiation of the interations that represent the ats of the interation among roles, among resoures and between roles and resoures starting from the dependenies analysed in the previous step Constraint design ativity identifiation of the rules that enable and Molesini & Omiini (DISI, bound Univ. Bologna) the entities behaviour 13 - SODA starting from the A.Y. 2012/2013 dependenies 63 / 132 SODA: Proess Arhitetural Design Proess The Proesses
70 SODA: Proess The Proesses Arhitetural Design: Ativities, Tasks, Roles and Workproduts <<output>> Zooming table <<input>> Layering Arhitetural Designer <<input>> <<input>> <<input>> <<performs, primary>> Map Analysis- ArhDes <<predeessor>> <<predeessor>> Spae Design <<predeessor>> <<predeessor>> <<predeessor>> Spae Layering <<output>> Zooming table <<input>> Arhitetural Designer <<performs, primary>> <<input>> Entities Tables Responsibilities Tables Dependenies Table Topologies Tables <<predeessor>> <<output>> Transition Tables Transition <<predeessor>> <<predeessor>> <<input>> <<predeessor>> <<output>> Spae Design <<output> > Zooming table Constraint Layering Layering <<input>> <<predeessor>> <<predeessor>> <<predeessor>> <<input>> Topologial Arhitetural Tables Designer <<input>> <<performs, primary>> Rule Design <<predeesso r>> Role Design <<predeess or>> Role Layering <<output >> Zooming table <<input>> <<input>> <<performs, primary>> Ation Design Arhitetural Designer <<output>> <<input>> <<performs, primary>> <<output>> <<predeessor>> Operation Design <<input>> Resoure Design <<predeessor>> Zooming table <<predeessor>> Resoure Layering <<output> > <<input>> <<predeessor>> Interation Layering <<input>> <<predeessor>> <<predeessor>> <<output>> Constraint Design Interation Design Zooming table <<predee ssor>> <<input>> <<input>> <<output>> <<output >> Interations Tables Interation Design Constraints Tables Arhitetural Designer <<performs, primary>> Entities Tables Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
71 SODA: Proess The Proesses Arhitetural Design: Workproduts & MMMEs Role D R R RF R Task Q Transition Role- Task table Role Ation Operation Resoure Rule Rule table RF RF RF RF D Q R Ation Role-Ation table Ation table Operation table Resoure- Operation table Role-Rule table Role R Q Transition Task- Ation table Q R Task D Constraints Tables Interation-Rule table Funtion Resoure R Q Funtion Transition Resoure-Funtion table Entities Tables Resoure-Rule table Q Topology Q R R D D Operation Spae-Rule table Topology R Q Funtion D Transition Funtion- Operation table Transition Tables Interation table RF Interation Interation Interations Tables Q R RF R Q Dependeny D Rule R Q Dependeny D Transition Dependeny- Interation table Transition Dependeny- Rule table Role-Interation Role table Q R Resoure-Interation table Resoure Zooming table Topologial Tables Spae table Spae-Connetion table Resoure-Spae table Spae Q R Spae Q Resoure R R Spae Q Topology Transition Topology- Spae table F F F R D R FD R D R FD R D R FD R F D Role Ation Resoure Operation Interation Rule Spae Role-Spae table Q Role R Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
72 Detailed Design Proess SODA: Proess The Proesses Carving Mapping Agent Design Environment Design Workspae Design Interation Detailed Design is the system well speified? yes no Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
73 SODA: Proess The Proesses Carving I In the Arhitetural Design step our system ould be potentially omposed by all the layers deteted in the previously steps Eah omplete layer represents a different system arhiteture... It is not possible to first design and then physially implement a system speified by different levels of abstration So, for eah entity, we need to hoose the appropriate layer of representation the hosen system arhiteture is arved out from all the possible arhitetures So, eah arving represents a speifi development in an iterative inremental proess we an made different arving in order to refine the system Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
74 Carving II SODA: Proess The Proesses Arhitetural Design Carving Opera R1 R2 R1 C C+1 R4 R5 +R2 R4 R5 C+2 R6 R7 R8 R9 R6 R7 R8 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
75 Carving III SODA: Proess The Proesses Arhitetural Design Carving Operation R1 R2 R1 R2 C C+1 R4 R5 +R2 R4 R5 +R2 C+2 R6 R7 R8 R9 R6 R7 R8 R9 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
76 Carving IV SODA: Proess The Proesses Arhitetural Design Carving Operation Detailed Design R1 R2 R1 R2 A1 Soiety A2 C C+1 R4 R5 +R2 R4 R5 +R2 A4 Soiety A5 C+2 R6 R7 R8 R9 R6 R7 R8 R9 A6 A7 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
77 SODA: Proess The Proesses Detailed Design Proess Mapping ativity the arved abstrations are mapped onto the abstrations adopted in this stage, thus generating the initial version of the Detailed Design models Agent design ativity design of agents and soieties Environment design ativity design of artifats and aggregates Workspae design ativity design of workspaes Interations design ativity design of use, manifest, speakto and linkedto Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
78 > SODA: Proess The Proesses Detailed Design: Ativities, Tasks, Roles and Workproduts Zooming table Topologial Tables Constraints Tables Detailed Designer <<input>> <<input>> <<input>> <<performs, primary>> Entities Tables <<input>> <<input>> Carving Interations Tables <<output>> a Carving Diagram Carving <<predeessor> Constraints Tables <<input>> <<input>> <<input>> Entities Tables <<input>> Map ArhDes- DetDes Interations Tables <<input>> <<output>> Topologial Tables Mapping Tables Detailed Designer <<performs, primary>> Workspae Design Workspae Design <<input>> <<output>> Environment Design Tables <<input>> <<input>> Mapping Tables Agent/Soiety Design Tables Topologial Design Tables <<predeessor>> <<predeessor> > Mapping <<predeessor>> <<predeessor>> Agent Design Agent/Soiety Design <<output >> Agent/Soiety Design Tables <<input>> <<performs, primary>> Mapping Tables Detailed Designer <<predeessor>> <<performs, primary>> Interation Detailed Design <<predeessor>> Environment Design Interation Detailed Design Environment Design <<input>> <<output>> Mapping Tables Environment Design Tables <<performs, primary>> <<input>> <<output>> Environment Design Tables <<input>> << input>> Interation Detailed Design Tables Detailed Designer Workspae Design Tables << input>> Agent/Soiety Design Tables Mapping Tables Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
79 SODA: Proess The Proesses Detailed Design: Workproduts & MMMEs D Artifat R Q Ation D Aggregate R Q Resore D Artifat R Q Operation D RF Artifat R Q Rule D Workspae R Q Spae D Manifest R Q Interation D LinkedTo R Q Interation RF Agent Q Mapping R Q Agent-Artifat Artifat-Ation table table Resoure Artifat Mapping Artifat- Resoure table R RF Agent/Soiety D Design Tables R Soiety Artifat Soiety-Agent table Mapping D RF Aggregate- Resoure table Soiety Agent Interation Mapping Agent-Role Detailed Design table R Tables Soiety-Artifat Q Q table Artifat Role D RF R Mapping Artifat- Soiety Artifat- Artifat Operation table Mapping Soiety-Role UsageInterfae table table Q RF R Role Aggregate-Artifat Aggregate table Mapping Rule- Environment RF Artifat table Design Tables Mapping Tables R Aggregate Aggregate-Agent table Q Agent RF Mapping Spae- D Workspae table R Workspae Workspae Use table Mapping Interation- Use table Q Q R Interation Workspae- Workspae Mapping Connetion table Interation- D Manifest table Q R R SpeakTo Workspae Design Tables Workspae- Mapping Interation- Artifat Artifat table SpeakTo table Q Q R Interation Mapping Interation- LinkedTo table Agent-Workspae Agent table RF Use-Protool Use table Q R Agent Agent-Use table Q R Artifat Artifat-Use table RF SpeakTo-Protool SpeakTo table Q R Agent-SpeakTo Agent table RF Manifest-Protool Manifest table Q R Artifat-Manifest Artifat table Q R Agent-Manifest Agent table RF LinkedTo- LinkedTo Protool table Q R Artifat Artifat-LinkedTo table a Carving Diagram Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
80 SODA: Proess The Proesses SODA Workproduts Dependenies Requirements Tables Relations Tables Referenes Tables Responsibilities Tables Dependenies Tables Topologies Tables Transitions Tables Entities Tables Interations Tables Constraints Tables Mapping Tables Agent/Soiety Design Tables Environment Design Tables Interation Detailed Design Tables Domain Tables Zooming table Zooming table Topologial Tables a Carving Diagram Workspae Design Tables Zooming table Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
81 Outline SODA: Notation 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
82 SODA: Notation The SODA Notation The design of a omplex system alls for both a lear and disiplined notation and tools for supporting the onsisteny heks SODA adopts a tabular representation Tables lear way for analysing and designing the systems very easy for automati tools very easy for onsisteny and ompleteness hekers Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
83 Outline SODA: Notation Analysis Phase 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
84 Analysis Phase: Tables SODA: Notation Analysis Phase Referenes Tables Requirements Analysis Analysis Transitions Tables Requirements Tables Domain Tables Relations Tables Responsibilities Tables Dependenies Tables Topologies Tables Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
85 SODA: Notation Analysis Phase Requirements Analysis: Tabular Representation I Requirements Tables: (L)A t, (L)AR t and (L)Re t Ator ator name Ator ator name Requirement requirement name Desription ator desription Requirement requirement names Desription requirement desription Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
86 SODA: Notation Analysis Phase Requirements Analysis: Tabular Representation II Domain Tables: (L)EELS t and (L)LS t External Environment external environment name Legay System legay system name Legay System Legay System names Desription legay system desription Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
87 SODA: Notation Analysis Phase Requirements Analysis: Tabular Representation III Requirements Tables define and desribe the abstrat entities tied to the onept of requirement Ator table ((L)A t ) desribes eah single ator Ator-Requirement Table ((L)AR t ) speifies the list of the requirements for eah ators Requirement Table ((L)Re t ) lists all the requirement and desribe them. Domain Tables define and desribe the abstrat entities tied to the external environment ExternalEnvironment-LegaySystem Table ((L)EELS t ) speifies the list of the ontexts for external environment Legay System Table ((L)LS t ) lists all the ontexts and desribe them Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
88 SODA: Notation Analysis Phase Requirements Analysis: Tabular Representation IV Relations Tables: (L)Rel t, (L)RR t and (L)RLS t Relation relation name Requirement requirement name Legay System legay system name Desription relation desription Relation relation names Relation relation names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
89 SODA: Notation Analysis Phase Requirements Analysis: Tabular Representation V Relations Tables relate the abstrat entities among them Relation Table((L)Rel t ) lists all the relationship among abstrat entities and provides a desription to them Requirement-Relation Table((L)RR t ) speifies the list of relations where requirement is involved LegaySystem-Relation Table ((L)LSR t ) speifies the list of relations where ontext is involved Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
90 SODA: Notation Analysis Phase From Requirements Analysis to Analysis I Referenes Tables in top-down order (L)RRT t (L)RRF t (L)RRTo t (L)RReqD t (L)RLSF t (L)RLST t (L)RRelD t Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
91 SODA: Notation Analysis Phase From Requirements Analysis to Analysis II Requirement requirement name Requirement requirement name Requirement requirement name Requirement requirement name Legay System legay system name Legay System legay system name Relation relation name Task task names Funtion funtion names Topology topology names Dependeny dependeny names Funtion funtion names Topology topology names Dependeny dependeny names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
92 SODA: Notation Analysis Phase From Requirements Analysis to Analysis III Referenes Tables identify the relations among the abstrations of the requirement analysis phase and the abstrations used in analysis phase. Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
93 SODA: Notation Analysis Phase From Requirements Analysis to Analysis IV Referene Requirement-Task Table((L)RRT t ) speifies the mapping between requirement and tasks Referene Requirement-Funtion Table ((L)RRF t ) speifies the mapping between requirement and resoures Referene Requirement-Topology table ((L)RRTo t ) speifies the mapping between eah requirement and the generated topologies Referene Requirement-Dependeny table ((L)RReqD t ) speifies the mapping between eah requirement and the generated dependenies Referene LegaySystem-Funtion Table ((L)RLSF t ) speifies the mapping between legay system and funtions Referene LegaySystem-Topology Table ((L)RLST t ) speifies the mapping between legay system and topologies Referene Relation-Dependeny Table ((L)RRD t ) speifies the mapping between relations and dependenies Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
94 SODA: Notation Analysis Phase Analysis: Tabular Representation I Responsibilities Tables: (L)T t and (L)F t Task task name Funtion funtion name Desription task desription Desription funtion desription Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
95 SODA: Notation Analysis Phase Analysis: Tabular Representation II Dependenies Tables: (L)D t, (L)TD t, (L)FD t and (L)TopD t Dependeny dependeny name Task task name Funtion funtion name Topology topology name Desription dependeny desription Dependeny dependeny names Dependeny dependeny names Dependeny dependeny names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
96 SODA: Notation Analysis Phase Analysis: Tabular Representation III Responsibilities Tables define and desribe the abstrat entities tied to the onept of responsibility Task Table ((L)T t ) lists all the tasks and desribes them Funtion Table ((L)F t ) lists all the funtions and desribe them Dependenies Tables relate the abstrat entities among them Dependeny Table ((L)D t ) lists all the dependeny among abstrat entities and provides a desription to them Task-Dependeny Table ((L)TD t ) speifies the list of dependenies where task is involved Funtion-Dependeny Table ((L)FD t ) speifies the list of dependenies where funtion is involved Topology-Dependeny table ((L)TopD t ) speifies the list of dependenies where eah topology is involved Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
97 SODA: Notation Analysis Phase Analysis: Tabular Representation IV Topologies Tables in top-down order (L)Top t, (L)TTop t, (L)FTop t Topology Topology name Task task name Funtion funtion name Desription topology desription Topology topology names Topology topology names Topologies Tables express the topologial needs Topology Table ((L)Top t ) lists all the topologial requirements and provides a desription to them Task-Topology Table ((L)TTop t ) speifies the list of topologial requirements those influene the task Funtion-Topology Table ((L)FTop t ) speifies the list of topologial requirements affeted by the funtion Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
98 SODA: Notation Zooming: Tabular Representation Analysis Phase Zooming Table: (L)Z t Layer L Layer L+1 out-zoomed entity in-zoomed entities Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
99 Example: In-zoom Task SODA: Notation Analysis Phase T1 L L+1 Zooming Table: (L)Z t Layer L Layer L+1 T1 T1a,T1b,T1,... T1a T1b T1 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
100 SODA: Notation Example: Out-zoom Tasks Analysis Phase T0 L-1 L Zooming Table: (L)Z t Layer L-1 Layer L T0 T1,T2,T3,... T1 T2 T3 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
101 SODA: Notation Analysis Phase Remarks The organisational struture of the system is impliitly managed by means of zooming relation For example when we in-zoom a task, we obtain new tasks, new dependenies and potentially new funtions and topologies. By means of new dependenies we an express all the soial rules that allow to new task to work together to ahieve the original tasks. In the same way in the arhitetural design phase when we in-zoom a role, we obtain new roles, new ations, new interations and potentially new resoures and operations. By means of new interations we an express all the soial rules that allow to new roles to work together to ahieve the soial task(s) assigned to the original role. Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
102 SODA: Notation Analysis Phase Complete Example: In-zoom Task T1 D3 T1a T1b T1 D2 D1 L L+1 Zooming Table: (L)Z t Layer L Layer L+1 T1 T1a,T1b,T1 D1,D2,D3 Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
103 Outline SODA: Notation Design Phase 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
104 Design Phase: Tables SODA: Notation Design Phase Mapping Tables Transitions Tables Arhitetural Design Detailed Design Entities Tables Interation Tables Constraints Tables Topologial Tables Agent/Soiety Design Tables Environment Design Tables Interation Design Tables Topologial Design Tables Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
105 SODA: Notation Design Phase From Analysis to Arhitetural Design I Transition Tables in top-down order (L)TRT t (L)TTA t (L)TRF t (L)TFO t (L)TID t (L)TTopS t Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
106 SODA: Notation Design Phase From Analysis to Arhitetural Design II Role role name Task task name Resoure resoure name Funtion funtion name Dependeny dependeny name Dependeny dependeny name Topology topology name Task task names Ation ation names Funtion funtion names Operation operation names Interation interation names Rule rule names Spae spae names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
107 SODA: Notation Design Phase From Analysis to Arhitetural Design III Transition Tables identify the relations among the abstrations of the requirement analysis phase and the abstrations used in analysis phase Transition Role-Task Table ((L)TRT t ) speifies the mapping between tasks and roles Transition Task-Ation table ((L)TTA t ) relates tasks and ations Transition Resoure-Funtion Table ((L)TRF t ) speifies the mapping between funtions and resoures Transition Funtion-Operation table ((L)TFO t ) relates funtions and operations Transition Interation-Dependeny Table ((L)TID t ) speifies the mapping between dependenies and interation Transition Rule-Dependeny table ((L)TRuD t ) maps dependenies onto rules Transition Topology-Spae Table ((L)TTopS t ) speifies the mapping between topologies and spaes Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
108 SODA: Notation Design Phase Arhitetural Design: Tabular Representation I Entities Tables in top-down order (L)A t, (L)O t, (L)RA t, (L)RO t Ation ation name Operation operation name Role role name Resoure resoure name Desription desription Desription desription Ation ation names Operation operation names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
109 SODA: Notation Design Phase Arhitetural Design: Tabular Representation II The Entities Tables that desribe roles and resoures of the system Ation Table((L)A t ) speifies the ations that roles ould be able to exeute and desribes them the mapping between tasks and roles Operation Table ((L)O t ) speifies the operations that resoures ould provide and desribes them the mapping between tasks and roles Role-Ation Table ((L)RA t ) speifies the list of ations that a speifi role is able to do Resoure-Operation Table ((L)RO t ) speifies the list of operations that a speifi resoure is able to provide Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
110 SODA: Notation Design Phase Arhitetural Design: Tabular Representation III Interations Tables in top-down order (L)I t, (L)AI t, (L)OpI t Interation interation name Ation ation name Operation operation name Desription desription Interation interation names Interation interation names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
111 SODA: Notation Design Phase Arhitetural Design: Tabular Representation IV The Interations Tables that desribe the interation where roles and resoures are involved Interation Table ((L)I t ) speifies the interations and desribes them Ation-Interation table ((L)AI t ) speifies the interations where eah ation is involved Operation-Interation table ((L)OpI t ) speifies the interations where eah operation is involved Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
112 SODA: Notation Design Phase Arhitetural Design: Tabular Representation V Constraints Tables in top-down order (L)Ru t, (L)IRu t, (L)ReRu t, (L)RoRu t, (L)SRu t Rule rule name Interation interation name Resoure resoure name Role role name Spae spae name Desription desription Rule rule names Rule rule names Rule rule names Rule rule names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
113 SODA: Notation Design Phase Arhitetural Design: Tabular Representation VI The Constraints Tables desribe the onstraints over the entities behaviours Rule table ((L)Ru t ) defines the single rule Rule-Interation table ((L)IRu t ) speifies the onstraints over the interations Resoure-Rule table ((L)ReRu t ) speifies the rules where eah resoure is involved Role-Rule table ((L)RoRu t ) speifies the rules where eah role is involved Spae-Rule table ((L)SRu t ) speifies the rules where eah spae is involved Topologial Tables in top-down order (L)S t, (L)SC t, (L)SRe t and (L)SRo t Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
114 SODA: Notation Design Phase Arhitetural Design: Tabular Representation VII Spae spae name Spae spae name Resoure resoure name Role role name Desription desription Connetion spae names Spae spae names Spae spae names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
115 SODA: Notation Design Phase Arhitetural Design: Tabular Representation VIII Topologial Tables Spae table ((L)S t ) speifies the spaes and desribes them Spae-Connetion table ((L)SC t ) shows the onnetions between spaes at the same layer of abstration (the hierarhial relations among spaes are managed by means of zooming table) Spae-Resoure table ((L)SRe t ) shows the alloation of the resoures to spaes: a resoure ould be alloated in several different spaes in partiular, a single, distributed resoure an in priniple be used to model a distributed servie, aessible from more nodes of the network Spae-Role table ((L)sRo t ) shows the list of spae that the roles an pereive in the system. Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
116 SODA: Notation Design Phase From Arhitetural Design to Detailed Design I Mapping Tables in top-down order MAR t, MSR t, MAA t, MArR t, MAggR t, MArOp t, MArRu t, MSW t, MIU t, MIM t, MISp t, MIL t Agent agent name Soiety soiety name (Individual) Artifat artifat name (Environmental) Artifat artifat name Aggregate aggregate name Role role names Role role name Ation ation names Resoure resoure names Resoure resoure name Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
117 SODA: Notation Design Phase From Arhitetural Design to Detailed Design II (Environmental) Artifat artifat name Rule rule name Workspae workspae name Interation interation name Interation interation name Interation interation name Interation interation name Operation operation names Artifat artifat names Spae spae names Use use names Manifest manifest names SpeakTo speak names LinkedTo linked names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
118 SODA: Notation Design Phase From Arhitetural Design to Detailed Design III Mapping Tables Mapping Agent-Role table (MAR t) maps roles onto agents Mapping Soiety-Role table (MSR t) maps role onto soiety Mapping Artifat-Ation table (MAA t) maps ations onto individual artifats Mapping Artifat-Resoure table (MArR t) maps resoures onto artifats Mapping Aggregate-Resoure table (MAggR t) maps resoures onto aggregate Mapping Artifat-Operation table (MArOp t) maps operation onto environmental artifats Mapping Artifat-Rule table (MArRu t) maps the rules speified in the Arhitetural Design onto the artifats that implement and enfore them Mapping Artifat-Operation table (MSW t) maps spaes onto workspaes Mapping Interation-Use table (MIU t) maps interations onto use Mapping Interation-Manifest table (MIM t) maps interations onto manifest Mapping Interation-SpeakTo table (MISp t) maps interations onto SpeakTo Mapping Interation-LinkedTo table (MIL t) maps interations onto linkedto Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
119 SODA: Notation Design Phase Detailed Design: Tabular Representation I Agent/Soiety Design Tables in top-down order (L)AA t, (L)SA t, (L)SAr t Agent agent name Soiety Soiety name Soiety soiety name (Individual) Artifat artifat names Agent agent names Artifat artifat names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
120 SODA: Notation Design Phase Detailed Design: Tabular Representation II Agent/Soiety Design Tables Agent-Artifat Table ((L)AA t ) speifies the (individual) artifats related to agents. Soiety-Agent Table ((L)SA t ) speifies whih agents work in the soiety Soiety-Artifat Table ((L)SAr t ) speifies the artifats related to soieties Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
121 SODA: Notation Design Phase Detailed Design: Tabular Representation III Environment Design Tables in top-down order AUI t, AggArt t, AggAge t Artifat artifat name Aggregate aggregate name Aggregate aggregate name Usage Interfae list of operations Artifat artifat names Agent agent names Environment Design Tables Artifat-UsageInterfae Table ((L)AUI t ) speifies the operations provided by artifats Aggregate-Artifat table (AggArt t ) lists the artifats belonging to a speifi aggregate Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
122 SODA: Notation Design Phase Detailed Design: Tabular Representation IV Interation Design Tables in top-down order UP t, AgeU t, ArtU t, SP t, AgeSp t, MP t, ArtM t, AgeM t, LP t, ArtL t Use use name Agent agent name Artifat artifat name SpeakTo speak name Agent agent name Protool protool desription Use use names Use use names Protool protool desription SpeakTo speak names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
123 SODA: Notation Design Phase Detailed Design: Tabular Representation V Manifest speak name Artifat artifat name Agent artifat name LinkedTo linked name Artifat artifat name Protool protool desription Manifest manifest names Manifest manifest names Protool protool desription LinkedTo linked names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
124 SODA: Notation Design Phase Detailed Design: Tabular Representation VI Interation Design Tables onern the design of interations among entities Use-Protool table (UP t) details the protools for eah use interation Agent-Use table (AgeU t) speifies the use where eah agent is involved Artifat-Use table (ArtU t) speifies the use where eah artifat is involved SpeakTo-Protool table (SP t) details the protools for eah speakto interation Agent-SpeakTo table (AgeSp t) speifies the speakto where eah agent is involved Manifest-Protool table (MP t) details the protools for eah manifest interation Artifat-Manifest table (ArtM t) speifies the manifest where eah artifat is involved Agent-Manifest table (AgeM t) speifies the manifest where eah agent is involved LinkedTo-Protool table (LP t) details the protools for eah linkedto interation Artifa-LinkedTo-table (ArtL t) speifies the linkedto where eah artifat is involved Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
125 SODA: Notation Design Phase Detailed Design: Tabular Representation VII Topologial Design Tables in top-down order: (L)W t, (L)WC t, (L)WArt t and (L)WA t Workspae workspae name Workspae workspae name Workspae workspae name Agent agent name Desription desription Connetion workspae names Artifat artifat names Workspae workspae names Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
126 SODA: Notation Design Phase Detailed Design: Tabular Representation VIII Topologial Design Tables desribe the struture of the environment Workspae table ((L)W t ) desribes the workspaes Workspae-Connetion table ((L)WC t ) shows the onnetions among the workspaes Workspae-Artifat table ((L)WArt t ) shows the alloation of the artifats to workspaes Workspae-Agent table ((L)WA t ) lists the workspaes that eah agent an pereive Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
127 Outline Conlusions & Web Resoures 1 SODA: Overview 2 SODA: Abstrations A&A in SODA The SODA meta-model 3 SODA: Proess SPEM The SODA Proess Mehanisms The Proesses 4 SODA: Notation Analysis Phase Design Phase 5 Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
128 Conlusions & Web Resoures Conlusions & Future Work SODA allows engineers to design soieties design environments support the omplexity of system desription (layering priniple) Future works testing SODA refining the meta-model building the tools extrating fragments from SODA aording to IEEE-FIPA Method Engineering standard [DPDF Working Group, 2011] integration between methodologies and infrastrutures proesses Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
129 Web Site I Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
130 Web Site II Conlusions & Web Resoures Molesini & Omiini (DISI, Univ. Bologna) 13 - SODA A.Y. 2012/ / 132
Verifying Interaction Protocol Compliance of Service Orchestrations
Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, mayer}@pst.ifi.lmu.de Abstrat. An important aspet
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationA service-oriented UML profile with formal support
A servie-oriented UML profile with formal support Roberto Bruni 1, Matthias Hölzl 3, Nora Koh 2,3, Alberto Lluh Lafuente 1, Philip Mayer 3, Ugo Montanari 1, and Andreas Shroeder 3 1 University of Pisa,
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationInterconnection Styles
Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationCA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1
Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationA Formal Hybrid Analysis Technique for Composite Web Services Verification
A Formal Hybrid Analysis Tehnique for Composite Web Servies Verifiation MAY HAIDAR 1,2, HICHAM H. HALLAL 1 1 Computer Siene Department / Department of Eletrial Engineering Fahad Bin Sultan University P.O
More informationThe AMDREL Project in Retrospective
The AMDREL Projet in Retrospetive K. Siozios 1, G. Koutroumpezis 1, K. Tatas 1, N. Vassiliadis 2, V. Kalenteridis 2, H. Pournara 2, I. Pappas 2, D. Soudris 1, S. Nikolaidis 2, S. Siskos 2, and A. Thanailakis
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More information- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.
- 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?
More informationPERSISTENT NAMING FOR PARAMETRIC MODELS
PERSISTENT NAMING FOR PARAMETRIC MODELS Dago AGBODAN, David MARCHEIX and Guy PIERRA Laboratory of Applied Computer Siene (LISI) National Shool of Engineers in Mehanis and Aeronautis (ENSMA) Téléport 2
More informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
More informationThis fact makes it difficult to evaluate the cost function to be minimized
RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationCA Service Desk Manager 14.x Implementation Proven Professional Exam (CAT-181) Study Guide Version 1.3
Exam (CAT-181) Study Guide Version 1.3 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationCA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0
Exam (CAT-720) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationDETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT
DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationFuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis
Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationCA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0
Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer
More informationCoprocessors, multi-scale modeling, fluid models and global warming. Chris Hill, MIT
Coproessors, multi-sale modeling, luid models and global warming. Chris Hill, MIT Outline Some motivation or high-resolution modeling o Earth oean system. the modeling hallenge An approah Sotware triks
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationAutomatic Generation of Transaction-Level Models for Rapid Design Space Exploration
Automati Generation of Transation-Level Models for Rapid Design Spae Exploration Dongwan Shin, Andreas Gerstlauer, Junyu Peng, Rainer Dömer and Daniel D. Gajski Center for Embedded Computer Systems University
More informationZippy - A coarse-grained reconfigurable array with support for hardware virtualization
Zippy - A oarse-grained reonfigurable array with support for hardware virtualization Christian Plessl Computer Engineering and Networks Lab ETH Zürih, Switzerland plessl@tik.ee.ethz.h Maro Platzner Department
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationCA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5
Proven Professional Exam (CAT-480) Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer
More informationType of document: Usebility Checklist
Projet: JEGraph Type of doument: Usebility Cheklist Author: Max Bryan Version: 1.30 2011 Envidate GmbH Type of Doumet Developer guidelines User guidelines Dutybook Speifiation Programming and testing Test
More informationA Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks
A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationConstructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center
Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationMining effective design solutions based on a model-driven approach
ata Mining VI 463 Mining effetive design solutions based on a model-driven approah T. Katsimpa 2, S. Sirmakessis 1,. Tsakalidis 1,2 & G. Tzimas 1,2 1 Researh ademi omputer Tehnology Institute, Hellas 2
More informationCisco Collaborative Knowledge
Ciso Collaborative Knowledge Ciso on Ciso: How Ciso Servies Upskilled 14,400 Employees and Transformed into a Consultative, Solutions-Selling Organization. It is estimated that by 2020, roughly four out
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationTowards an Axiomatic Semantics of P Systems
Towards an Axiomati Semantis of P Systems Roberto Barbuti Andrea Maggiolo Shettini Paolo Milazzo Simone Tini. Dipartimento di Informatia, Università di Pisa, Italy. Dipartimento di Sienze della Cultura,
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationCA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2
CA PPM 14.x Implementation Proven Professional Exam (CAT-222) Study Guide Version 1.2 PROPRIETARY AND CONFIDENTIAL INFMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For
More informationEvolutionary Feature Synthesis for Image Databases
Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationPathRings. Manual. Version 1.0. Yongnan Zhu December 16,
PathRings Version 1.0 Manual Yongnan Zhu E-mail: yongnan@umb.edu Deember 16, 2014-1 - PathRings This tutorial introdues PathRings, the user interfae and the interation. For better to learn, you will need
More informationCA Unified Infrastructure Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1
Management 8.x Implementation Proven Professional Exam (CAT-540) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information.
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationHigh-level synthesis under I/O Timing and Memory constraints
Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,
More informationTorpedo Trajectory Visual Simulation Based on Nonlinear Backstepping Control
orpedo rajetory Visual Simulation Based on Nonlinear Bakstepping Control Peng Hai-jun 1, Li Hui-zhou Chen Ye 1, 1. Depart. of Weaponry Eng, Naval Univ. of Engineering, Wuhan 400, China. Depart. of Aeronautial
More informationOvidSP Quick Reference Card
OvidSP Quik Referene Card Searh in any of several dynami modes, ombine results, apply limits, use improved researh tools, develop strategies, save searhes, set automati alerts and RSS feeds, share results...
More informationCOSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems
COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation
More informationContextualization as an Abstraction Mechanism for Conceptual Modeling
Contextualization as an Abstration Mehanism for Coneptual Modeling Manos Theodorakis 1 2, Anastasia Analyti 1, Panos Constantopoulos 1 2, and Niolas Spyratos 3 1 Institute of Computer Siene, FORTH, P.O.Box
More informationMake your process world
Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,
More informationFast Rigid Motion Segmentation via Incrementally-Complex Local Models
Fast Rigid Motion Segmentation via Inrementally-Complex Loal Models Fernando Flores-Mangas Allan D. Jepson Department of Computer Siene, University of Toronto {mangas,jepson}@s.toronto.edu Abstrat The
More informationSelf-aware and Self-expressive Camera Networks
1 Self-aware and Self-expressive Camera Networks Bernhard Rinner, Lukas Esterle, Jennifer Simonjan, Georg Nebehay, Roman Pflugfelder, Peter R. Lewis and Gustavo Fernández Domínguez Abstrat Reent advanes
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
More informationEffecting Parallel Graph Eigensolvers Through Library Composition
Effeting Parallel Graph Eigensolvers Through Library Composition Alex Breuer, Peter Gottshling, Douglas Gregor, Andrew Lumsdaine Open Systems Laboratory Indiana University Bloomington, IN 47405 {abreuer,pgottsh,dgregor,lums@osl.iu.edu
More informationRouting Protocols for Wireless Ad Hoc Networks Hybrid routing protocols Theofanis Kilinkaridis
Routing Protools for Wireless Ad Ho Networks Hyrid routing protools Theofanis Kilinkaridis tkilinka@.hut.fi Astrat This paper presents a partiular group of routing protools that aim to omine the advantages
More informationDynamic Motion Models
EUROGRAPHICS 2002 / I. Navazo Alvaro and Ph. Slusallek (Guest Editors) Short Presentations Dynami Motion Models Stefan M. Grünvogel, Thorsten Lange and Jens Piesk Laboratory for Mixed Realities, Institute
More informationAn Edge-based Clustering Algorithm to Detect Social Circles in Ego Networks
JOURNAL OF COMPUTERS, VOL. 8, NO., OCTOBER 23 2575 An Edge-based Clustering Algorithm to Detet Soial Cirles in Ego Networks Yu Wang Shool of Computer Siene and Tehnology, Xidian University Xi an,77, China
More informationPROJECT PERIODIC REPORT
FP7-ICT-2007-1 Contrat no.: 215040 www.ative-projet.eu PROJECT PERIODIC REPORT Publishable Summary Grant Agreement number: ICT-215040 Projet aronym: Projet title: Enabling the Knowledge Powered Enterprise
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationAdaptive Implicit Surface Polygonization using Marching Triangles
Volume 20 (2001), Number 2 pp. 67 80 Adaptive Impliit Surfae Polygonization using Marhing Triangles Samir Akkouhe Eri Galin L.I.G.I.M L.I.G.I.M Eole Centrale de Lyon Université Claude Bernard Lyon 1 B.P.
More informationMethods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems
Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS
ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS Ahmed Elaksher a, Mohammed Elghazali b, Ashraf Sayed b, and Yasser Elmanadilli b a Shool of Civil Engineering, Purdue University, West Lafayette,
More informationCreating Adaptive Web Sites Through Usage-Based Clustering of URLs
Creating Adaptive Web Sites Through Usage-Based Clustering of URLs Bamshad Mobasher Dept. of Computer Siene, DePaul University, Chiago, IL mobasher@s.depaul.edu Robert Cooley, Jaideep Srivastava Dept.
More informationFrom Objects to Agents: The Java Agent Middleware (JAM)
From Objects to Agents: The Java Agent Middleware (JAM) Laboratory of Multiagent Systems LM Laboratorio di Sistemi Multiagente LM Elena Nardini elena.nardini@unibo.it Ingegneria Due Alma Mater Studiorum
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationCA Privileged Access Manager 3.x Proven Implementation Professional Exam (CAT-661) Study Guide Version 1.0
Exam (CAT-661) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationBatch Auditing for Multiclient Data in Multicloud Storage
Advaned Siene and Tehnology Letters, pp.67-73 http://dx.doi.org/0.4257/astl.204.50. Bath Auditing for Multilient Data in Multiloud Storage Zhihua Xia, Xinhui Wang, Xingming Sun, Yafeng Zhu, Peng Ji and
More informationSimulation of Crystallographic Texture and Anisotropie of Polycrystals during Metal Forming with Respect to Scaling Aspects
Raabe, Roters, Wang Simulation of Crystallographi Texture and Anisotropie of Polyrystals during Metal Forming with Respet to Saling Aspets D. Raabe, F. Roters, Y. Wang Max-Plank-Institut für Eisenforshung,
More informationIntroduction to the SQL Server Platform
Chapter 1 Introdution to the SQL Server Platform In This Chapter SQL Server Editions SQL Server What s in the Box? Operating System Platforms SQL Server Doumentation and Sample Databases SQL Server Resoures,
More informationPerformance Benchmarks for an Interactive Video-on-Demand System
Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department
More informationPRECEDENTS: Memory Structure in Design Case Libraries
273 PRECEDENTS: Memory Struture in Design Case Libraries Rivka Oxman Robert Oxman Faulty of Arhiteture and Town Planning Tehnion, Israel Institute of Tehnology Haifa, Israel, 32000 The paper presents an
More informationChromaticity-matched Superimposition of Foreground Objects in Different Environments
FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology
More informationTitle: Time-Based Tree Graphs for Stabilized Force Structure Representations
Paper for the 8 th International Command & Control Researh & Tehnology Symposium Title: Time-Based Tree Graphs for Stabilized Fore Struture Representations Submitted by: Sam Chamberlain U.S. Army Researh
More informationA Visualization Technique for Unit Testing and Static Checking with Caller Callee Relationships
A Visualization Tehnique for Unit Testing and Stati Cheking with Caller Callee Relationships Yuko Muto, Kozo Okano, Shinji Kusumoto Graduate Shool of Information Siene and Tehnology Osaka University Suita,
More informationFormal Verification by Model Checking
Formal Verifiation by Model Cheking Jonathan Aldrih Carnegie Mellon University Based on slides developed by Natasha Sharygina 15-413: Introdution to Software Engineering Fall 2005 3 Formal Verifiation
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationImproved flooding of broadcast messages using extended multipoint relaying
Improved flooding of broadast messages using extended multipoint relaying Pere Montolio Aranda a, Joaquin Garia-Alfaro a,b, David Megías a a Universitat Oberta de Catalunya, Estudis d Informàtia, Mulimèdia
More informationUplink Channel Allocation Scheme and QoS Management Mechanism for Cognitive Cellular- Femtocell Networks
62 Uplink Channel Alloation Sheme and QoS Management Mehanism for Cognitive Cellular- Femtoell Networks Kien Du Nguyen 1, Hoang Nam Nguyen 1, Hiroaki Morino 2 and Iwao Sasase 3 1 University of Engineering
More informationManipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
Eletroni Communiations of the EASST Volume 26 (2010) Manipulation of Graphs, Algebras and Pitures Essays Dediated to Hans-Jörg Kreowski on the Oasion of His 60th Birthday Autonomous Units for Solving the
More informationMulti-Level Modeling of Concurrent and Distributed Systems
Multi-Level Modeling of Conurrent and Distriuted Systems Peter Taeling Hasso-Plattner-Institute for Software Systems Engineering P.O. Box 90 04 60, 14440 Potsdam, Germany taeling@hpi.uni-potsdam.de strat
More informationTest Case Generation from UML State Machines
Test Case Generation from UML State Mahines Dirk Seifert Loria Université Nany 2 Campus Sientifique, BP 239 F-54506 Vandoeuvre lès Nany edex Dirk.Seifert@Loria.fr inria-00268864, version 2-23 Apr 2008
More informationAutomated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R.
EngOpt 2008 - International Conferene on Engineering Optimization Rio de Janeiro, Brazil, 01-05 June 2008. Automated System for the Study of Environmental Loads Applied to Prodution Risers Dustin M. Brandt
More informationDeep Rule-Based Classifier with Human-level Performance and Characteristics
Deep Rule-Based Classifier with Human-level Performane and Charateristis Plamen P. Angelov 1,2 and Xiaowei Gu 1* 1 Shool of Computing and Communiations, Lanaster University, Lanaster, LA1 4WA, UK 2 Tehnial
More information