To see the other types of publications on this topic, follow the link: SDL.
Dissertations / Theses on the topic 'SDL'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'SDL.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Schröder, Ralf. "SDL-Datenkonzepte." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2003. http://dx.doi.org/10.18452/14926.
Full textAbstract:
SDL in der 1996 standardisierten Sprachversion ist zur Zeit die im Telekommunikationsbereich am weitesten verbreitete Sprache zur Spezifikation von Protokollen. Ein wesentlicher Aspekt der Sprachentwicklung seit 1988 ist auch die Verfügbarkeit einer formalen Basis semantischer Konzepte. Für das Datenkonzept der Sprache wurde auf die algebraischen Technik ACT ONE zurückgegriffen. Obwohl Anspruch als auch praktischer Wert von SDL in der Ausführbarkeit als Spezifikationstechnik liegt, wird dieses gerade durch das verwendete Datenmodell beeinträchtigt. Verdeckt wird dieses Problem durch die Bereitstellung von vordefinierten Datentypen. Durch die Erweiterung von SDL um objektorientierte Konzepte im Jahr 1992 und durch die allgemein wachsende Bedeutung der Daten in Protokollbeschreibungen treten die vorhandenen Sprachprobleme bei den Daten immer mehr in der Vordergrund. Individuelle Lösungen zur Spezifikation von Daten in verfügbaren SDL-Werkzeugen sind die Folge. In der vorliegenden Arbeit werden sowohl die praxismotivierten Unzulänglichkeiten als auch die formalen Unstimmigkeiten im SDL-Datenkonzept aufgezeigt. Auf der Grundlage einer systematischen Analyse werden ein allgemeiner Anforderungskatalog und eine Methodik für Veränderungen am Datenkonzept erarbeitet. Zusätzlich werden wichtige Sprachmodifikationen mit dem Schwerpunkten Ausdruckskraft und Ausführbarkeit vorgestellt und bewertet. Es steht somit ein Instrumentarium zur Verfügung, das den unterschiedlichen SDL-Interessengruppen bei der Bewertung und Nutzung von SDL-Veränderungen dienlich ist. Die in der Arbeit vorgestellten Modifikationen des Datenkonzepts basieren auf den langjährigen Erfahrungen des Autors bei der Implementierung und dem Einsatz von Werkzeugen, die mit verschiedenen projektspezifischen Zielstellungen SDL-Beschreibungen in ausführbare Programme überführen. Die Kombination von SDL mit einer weiteren Spezifikationstechnik, ASN.1, spielt hier eine besondere Rolle. Durch die aktive Mitarbeit des Autors bei der SDL-Sprachstandardisierung werden in der Arbeit auch Vorschläge präsentiert, die über das Potential der vorhandenen Werkzeuge hinausgehen. Das schließt beispielsweise die Bewertung der neuen, in der Praxis noch nicht etablierten, SDL-Version aus dem Jahr 2000 mit ein.SDL in the language version which was standardized in 1996 is the most-used language in the telecommunication domain for the specification of protocols today. An essential aspect of the language development since 1998 is the availability of a formal basis for semantic concepts. The algebraic technique ACT ONE is used for the data concept of the language. Although the requirement and the practical value of SDL is the execution a specification technique, this is impaired straight by the used data model. The problem is hidden by the supply of pre-defined data types. Because of the introduction of object oriented concepts in 1992 and because of the generally increasing importance of data for the protocol description the existing language problems are taking more and more attention. Individual solutions for the specification of data are the consequence with available SDL tools. In the presented document are pointed out the praxis motivated inadequacies as well as the formal discrepancy of the data concept. A general requirement catalogue and a methodology are designed for language modifications based on a systematic inspection of the SDL data concept. Furthermore important language modifications are introduced and evaluated with the focus to expression power and to execution. Instruments are provided thus, which are helpful to different SDL interest groups for the evaluation and for the application of SDL modifications. In the document presented data modifications are based on years of experience of the author in the implementation and application of tools that compile SDL specifications with different project-specific objectives into executable programs. The combination of SDL with a further specification technology, ASN.1, plays an important role here. Because of the active role of the author in the SDL standardization process also suggestions are presented going beyond the potential of the existing tools. That includes for example the evaluation of the new, in practice not yet established SDL version, published in 2000.
2
Wang, Xiaoyu 1968. "Variables abstraction in SDL." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33856.
Full textAbstract:
State explosion problem is an essential impediment in practical applications of formal languages such as SDL, Specification and Description Language. In the context of validation and testing, one of the possible solutions is to abstract a constructed formal specification by removing certain, unimportant from some viewpoint, variables. The resulting system could be more tractable by existing validation and testing tools. In this thesis, we first elaborate methods for abstracting variables in the Extended FSM model and then methods to treat SDL specifications that are based on the EFSM model. The methods are implemented in a tool that is successfully tested on a real life SDL specification.
3
Prinz, Andreas. "Formal Semantics for SDL." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2001. http://dx.doi.org/10.18452/13752.
Full textAbstract:
In dieser Habilitationsschrift wird die formale Semantik der standardisierten Spezifikationssprache SDL (Specification and Description Language) beschrieben. Da SDL eine sehr umfangreiche Sprache ist, wurde eine repräsentative eingeschränkte Sprache RSDL (Restricted SDL) ausgewählt, um die Konzepte der formalen Definition von SDL darzustellen. Die vorliegende Habilitationsschrift umfaßt zwei große Teile: die Definition der formalen Semantik von RSDL und ihre Implementierung. Die formale Definition der Semantik von RSDL ist verständlich, leicht mit der informalen Beschreibung zu vergleichen und repräsentiert die grundsätzliche Vorstellung von RSDL. Für die Beschreibung werden zwei Teile unterschieden, nämlich die statische Semantik und die dynamische Semantik. Die statische formale Sprachdefinition besteht aus einer konkreten Syntax, einer Menge von Korrektheitsbedingungen, einer Menge von Transformationsregeln und einer abstrakten Syntax als Basis für die dynamische Semantik. Das Ergebnis der statischen Beschreibung ist eine Repräsentation der Spezifikation in abstrakter Syntax. Die Formalisierung der dynamischen Semantik beginnt mit der abstrakten Syntax. Aus dieser abstrakten Syntax wird ein Verhaltensmodell abgeleitet, das auf der mathematischen Theorie der Abstrakten Zustandmaschinen ASM (Abstract State Machines) basiert. Um die Definition der Semantik besonders übersichtlich zu gestalten, wird eine Spezielle Abstrakte Maschine (SAM) unter Nutzung von ASM definiert. Diese abstrakte Maschine stellt eine abstrakte SDL-Maschine dar. Die formale Semantik beschreibt die Eigenschaften von SDL exakt. Um jedoch herauszufinden, ob die Semantik korrekt ist, muß sie mit der Sprachbeschreibung und den Intentionen der Sprachentwickler verglichen werden. Dies geschieht am einfachsten durch eine korrekte Implementierung der Semantik. Die Implementierung der formalen Semantik basiert auf einer Repräsentation der Eingabe als abstrakter Syntaxbaum. Um die Semantik mit minimalem Aufwand zu implementieren, werden existierende Werkzeuge verwendet. Der Compiler wird mit den Standardwerkzeugen lex und yacc generiert. Nach der Syntaxanalyse wird die weitere Verarbeitung über dem abstrakten Syntaxbaum der Eingabe definiert. Die Verarbeitung von abstrakten Syntaxbäumen wird durch ein Werkzeug namens kimwitu erledigt. Mit der hier vorgestellten Technologie wurde die formale Semantik von RSDL implementiert. Entsprechend wird die formale Semantik von SDL implementiert.In this habilitation thesis the formal semantics of the standardised specification language SDL (Specification and Description Language) is described. Because of the size of the language SDL a representative subset of the language called RSDL (Restricted SDL) was selected to present the concepts of the formal definition. In this thesis two major parts are covered: the definition of the formal semantics and its implementation. The RSDL formal semantics is intelligible, easily comparable with the informal description and represents the general understanding of RSDL. We distinguish between two phases of the definition, namely the static semantics and the dynamic semantics. The static semantics comprises the definition of a concrete grammar, a set of correctness constraints, a set of transformation rules and an abstract syntax as basis for the dynamic semantics. The result of the static semantics is a representation of the specification in abstract syntax. The dynamic semantics starts with the abstract syntax. From here a behaviour model is derived based on the theory of Abstract State Machines (ASM). In order to keep the presentation intelligible a special abstract machine is defined using ASM. This abstract machine in fact represents an abstract SDL-machine. The formal semantics describes the properties of SDL exactly. However, in order to check the correctness of the formalisation, it has to be compared with the informal language description and the intentions of the language designers. This is most easily done using a correct implementation of the semantics. The implementation of the semantics is based on a representation of the input as an abstract syntax tree. For implementing the semantics with minimal effort existing tools are used. The compiler is produced using the standard tools lex and yacc. After parsing the remaining processing is defined over abstract syntax trees, which is covered by a tool called kimwitu. The formal semantics of RSDL is implemented using these tools. The same approach is applicable for SDL.
4
Bay, Till G. "Eiffel SDL multimedia library (ESDL)." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Professur für Software Engineering /Chair of Software Engineering, 2003. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=195.
Full text
5
Schröder, Ralf. "SDL-Datenkonzepte - Analyse und Verbesserungen." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=969065582.
Full text
6
Záň, Stanislav. "SDL model pro Source Specific Multicast." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217545.
Full textAbstract:
This work deals with questions of IP net communication, with using metod Source-Specific Multicast. It focused on questions of registration, unregistration and administration of clients in multicast group and IGMP protocol, which is made for this communication. Work deals also about problems of signalization between source of data and clients of multicast group.In the introduction of this work questions of communications in multicast are analyse. I tis followed by the chapter focused on the specific metod of multicast – Source Specific Multicast (SSM). Next chapter is based on the protocols in SSM, which are used for distribution of data stream in source to clients direction and also in the reverse direction. The net chapter deals with signalization of communication in SSM. It specializes for reflection and summarization metods, which are used here. This chapter also shows basic matematics formules for sending signalization packets and proposes other solutions and ways for simplify communication and minimalize delay, which is for signallization very important. After that, the work deals with differences between these two metods of signalization. The aplicationis builded in practical part of work from the knowlidge of theory from previous chapters and it simulates the real communication between data source and clients situated to multicast group. This communication is explained in MSC diagrams. The aplication also simulates both used metods of signalization and real count of cients in multicast group. The results of simulation are interpreted in the last part of work.
7
Ribeiro, Júlio Resende. "J-sdl: um framework para a simulação de especificações em sdl e geração automática de casos de teste." Instituto Nacional de Pesquisas Espaciais (INPE), 2008. http://urlib.net/sid.inpe.br/mtc-m18@80/2008/12.02.12.01.
Full textAbstract:
O objetivo, dos testes de software, é detectar faltas latentes antes que produtos de software sejam colocados em funcionamento. Existem métodos para a geração automática de casos de testes, desde que o comportamento do software esteja representado como uma Máquina de Estados Finitos (MEF). São exemplos desses métodos: T, UIO, D e Switch Cover. Devido a algumas limitações das MEFs, investiga-se a geração automática de casos de teste a partir de técnicas formais de descrição que permitam a representação explícita de hierarquia e paralelismo, características muito necessárias para a representação dos softwares modernos. Isso já foi explorado por meio de uma metodologia baseada na representação do comportamento de software por meio de Statecharts. Essa metodologia consiste em converter a representação Statecharts em uma MEF a partir da qual possam ser aplicados os métodos de geração de testes. Essa dissertação de mestrado possui o objetivo de investigar uma outra técnica de modelagem: SDL. Será estudada a viabilidade de derivar casos de teste a partir de especificações em SDL, de forma direta, sem a necessidade de converter a especificação para MEFs. Para isso foi desenvolvido um framework denominado J-SDL que permite a simulação de comportamento, em termos de mudança de estados e consequentemente a geração automática de casos de teste.The objective of tests in software is to detect faults before it can be released. Methods exist to generate test cases as long as the software behavior is represented as a Finite State Machine (FSM), for example: T, UIO, D e Switch Cover. Due to some limitations in FSM, it is necessary to investigate specification techniques that enable explicit representation of parallel activities and hierarchy very much necessary to model modern software. This has already been explored by using Statecharts in which the Statecharts representation is converted into a FSM from which test cases are generated. The approach used in this dissertation is to investigate the feasibility of using SDL to generate automatically test cases in a straightforward manner, i.e., without the necessity to convert into a FSM. A framework J-SDL has been developed to simulate the behavior in terms of state changes and by simulating this behavior it will be shown that test cases can be generated.
8
Löwis, of Menar Martin von. "Formale Semantik des Datentypmodells von SDL-2000." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=970263821.
Full text
9
Abdalla, Mohamed Musa. "Automatic generation of SDL specifications from MSCs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0017/MQ47822.pdf.
Full text
10
Figueiredo, Renato Jansen de Oliveira. "Sintese comportamental de circuitos digitais utilizado SDL." [s.n.], 1995. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261438.
Full textAbstract:
Orientador: Ivanil Sebastião BonattiDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-20T15:34:37Z (GMT). No. of bitstreams: 1 Figueiredo_RenatoJansendeOliveira_M.pdf: 5779228 bytes, checksum: b2fb963a793332e11d4da83c66486ada (MD5) Previous issue date: 1995
Resumo: Metodologias de projeto de sistemas digitais em alto nível têm por objetivos principais permitir a descrição de sistemas cada vez mais complexos, mantendo a visão sistêmica do projeto durante todo o seu ciclo de desenvolvimento, e diminuir o tempo de desenvolvimento de projetos. Este trabalho apresenta uma abordagem à metodologia de projeto de sistemas digitais através do uso de uma linguagem de especificação(SDL - Specification and Description Language)para o projeto de circuitos. Um algoritmo de mapeamento de um sub-conjunto da linguagem SDL para VHDL (Very High Speed Integrated Circuit Hardware Description Language) sintetizável é apresentado, juntamente com exemplos de aplicação, e implementado em um programa de domínio público (Stoht - SDL to Hardware Translator) que realiza este mapeamento de maneira automática
Abstract: System-level design methodologies allow the description of more complex systems, keeping the view of the system as a whole throughout all its developing cycle, and also allow the shortening of project development schedule. This work presents an approach to system-level design by using a specification language (SDL - Specification and Description Language) to hardware design. An algorithm for the translation of a subset of SDL to synthesis able VHDL (Very High Speed Integrated Circuit Hardware Description Language) is presented together with examples of implementation. This algorithm has been implemented in a software translator (Stoht - SDL to Hardware Translator) that performs the language mapping automatically
Mestrado
Mestre em Engenharia Elétrica
11
Menar, Martin von Löwis of. "Formale Semantik des Datentypmodells von SDL-2000." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2003. http://dx.doi.org/10.18452/15005.
Full textAbstract:
Mit der aktuellen Überarbeitung der Sprache SDL (Specification and Description Language) der ITU-T wurde die semantische Fundierung der formalen Definition dieser Sprache vollständig überarbeitet; die formale Definition basiert nun auf dem Kalkül der Abstract State Machines (ASMs). Ebenfalls neu definiert wurde das um objekt-orientierte Konzepte erweiterte Datentypsystem. Damit musste eine formale semantische Fundierung für diese neuen Konzepte gefunden werden. Der bisher verwendete Kalkül ACT.ONE sollte nicht mehr verwendet werden, da er schwer verwendbar, nicht implementierbar und nicht auf Objektsysteme erweiterbar ist. In der vorliegenden Arbeit werden die Prinzipien einer formalen Sprachdefinition dargelegt und die Umsetzung dieser Prinzipien für die Sprache SDL-2000 vorgestellt. Dabei wird erläutert, dass eine konsistente Sprachdefinition nur dadurch erreicht werden konnte, dass die Definition der formalen Semantik der Sprache parallel mit der Entwicklung der informalen Definition erfolgte. Dabei deckt die formale Sprachdefinition alle Aspekte der Sprache ab: Syn-tax, statische Semantik und dynamische Semantik. Am Beispiel der Datentypsemantik wird erläutert, wie jeder dieser Aspekte informal beschrieben und dann formalisiert wurde. Von zentraler Rolle für die Anwendbarkeit der formalen Semantikdefinition in der Praxis ist der Einsatz von Werkzeugen. Die Arbeit erläutert, wie aus der formalen Sprachdefinition voll-automatisch ein Werkzeug generiert wurde, das die Sprache SDL implementiert, und wie die durch die Umsetzung der formalen Semantikdefinition in ein Werkzeug Fehler in dieser Definition aufgedeckt und behoben werden konnten.With the latest revision of ITU-T SDL (Specification and Description Language), the semantic foundations of the formal language definition were completely revised; the formal definition is now based on the calculus of Abstract State Machines (ASMs). In addition, the data type system of SDL was revised, as object-oriented concepts were added. As a result, a new semantical foundation for these new concepts had to be defined. The ACT.ONE calculus that had been used so far was not suitable as a foundation any more, as it is hard to use, unimplementable and not extensible for the object oriented features. In this thesis, we elaborate the principles of a formal language definition, and the realisation of these principles in SDL-2000. We explains that a consistent language definition can only be achieved by developing the formal semantics definition in parallel with the development of the informal definition. The formal language definition covers all aspects of the language: syntax, static semantics, and dynamic semantics. Using the data type semantics as an example, we show how each of these aspects is informally described, and then formalized. For the applicability of the formal semantics definition for practitioners, usage of tools plays a central role. We explain how we transform the formal language definition fully automatically into a tool that implements the language SDL. We also explain how creating the tool allowed us to uncover and correct errors in the informal definition.
12
Best, André. "Konzept zur Modellierung fehlertoleranter zyklischer Prozesse mit SDL /." Berlin : Logos-Verl, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=2997432&prov=M&dok_var=1&dok_ext=htm.
Full text
13
Crutcher, L. A. "A computer architecture for the implementation of SDL." Thesis, University of Bristol, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234938.
Full text
14
Ritthiruangdech, Panitee. "Test suite reduction using SDL and EFSM dependency analysis." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26758.
Full textAbstract:
A reduction of a requirement-based test suite can be achieved without significantly reducing the fault-detection capabilities of the original test suite. This is done by eliminating all but one of the equivalent test cases from each class of equivalent test cases of the original test suite. A requirement-based reduction technique proposed in [1] uses EFSM dependency analysis to define classes of equivalent test cases. Two types of dependencies, namely control and data dependencies, are identified in an EFSM/SDL model.
In this thesis, based on [1], we have proposed algorithms to generate interaction patterns of a test case w.r.t. a requirement under test, algorithms to compare interaction patterns and determine whether or not they are equivalent, and an algorithm to identify a set of interaction patterns (w.r.t. the requirement under test) that are not covered by any test case from a given test suite. Also, Test Suite Reduction (TSR) program has been developed based on these algorithms, which contributes towards object oriented testing. (Abstract shortened by UMI.)
15
Henniger, Olaf [Verfasser]. "Testgenerierung aus Spezifikationen in Estelle und SDL / Olaf Henniger." Aachen : Shaker, 2003. http://d-nb.info/1172611041/34.
Full text
16
Kolloch, Thomas. "Scheduling with message deadlines for hard real-time SDL systems." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965601870.
Full text
17
Li, Qing. "SIMPL-T: SDL intended for management and planning of tests." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26694.
Full textAbstract:
The correctness and completeness of the requirement specifications are critical in the software lifecycle. Validation of the specifications against the user requirements is essential for ensuring software quality and reducing development cost. SDL (Specification and Description Language) specifications may be validated using TTCN (Testing and Test Control Notation); however TTCN has a much wider scope and broader purpose. For testing SDL specifications, only a small part of TTCN is needed. Therefore, for many projects and organizations, it is not economical or efficient to use TTCN to validate SDL specifications. This thesis introduces a new language SIMPL-T (SDL Intended for Management and Planning of Tests), which is a simple test language for SDL specifications. It is defined as a minimal extension of existing SDL features so as to provide essential test specification functionality. It is understandable to persons familiar with SDL, and therefore immediately useful for SDL users.
18
Bourduas, Stephan. "Generation of SDL specifications from UML and MSC use cases." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ64058.pdf.
Full text
19
Maerz, Peter. "Implementierung einiger OAM-Funktionen zur Evaluation der Sprache SDL und des Frameworks ObjectGEODE." [S.l.] : Universität Stuttgart , Fakultät Informatik, 1997. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB6783437.
Full text
20
Wörn, Michael. "Spezifikation einer Steuerungssoftware für eine CAN-Bus gesteuerte Kraftfahrzeugtüre in SDL." [S.l.] : Universität Stuttgart , Fakultät Informatik, 1998. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB6783611.
Full text
21
le, Clercq Anton, and Kristoffer Almroth. "Comparison of Rendering Performance Between Multimedia Libraries Allegro, SDL and SFML." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-259756.
Full textAbstract:
In this report the rendering performances of the multimedia libraries Allegro, SDL and SFML have been compared. Highest performance is achieved by writing code directly to the low level graphical APIs, though it requires much more work than using the multimedia libraries graphical functions built on one of these graphical APIs. Thus it is common to use a multimedia library or similar for visualization tasks. The total number of frames rendered in one second was counted for static, alpha blended, rotating, and moving images in each library. Every test was run with few to very many images, and the programs were tested on six different computers: three laptops with integrated GPUs and low power dual core CPUs, and three desktop computers with external GPUs and quad core CPUs with unlocked clock rate. Allegro performed best of the three on laptops when the image load was very high, but fell behind by up to 50% in all other cases. SDL had the strongest performance on desktop computers, especially when rendering very many images, making it a prime candidate for high load graphical applications on desktops. SFML performed best overall, making it the best choice when targeting a wide range of different machines.I denna rapport jämförs renderingsprestandan mellan multimediabiblioteken Allegro, SDL och SFML. Den högsta prestandan uppnås genom att skriva kod direkt till en lågnivå-API för grafik, men det kräver mycket mer kod än att använda ett multimediabibliotek. Därför är det vanligt att använda ett multimediabibliotek eller något med liknande funktioner för visualiseringsarbeten. Jämförelsen bestod av att räkna det totala antalet skärmbilder som renderades under en sekund för statiska, semitransparanta, rotarande och rörliga bilder. Varje test kördes med 50 till 10 000 bilder som renderades samtidigt, och programmen testades på sex olika datorer, tre bärbara med integrerade GPUs och tvåkärniga energieffektiva CPUs, och tre stationära med externa GPUs och fyrkärniga CPUs med upplåst klockfrekvens. Allegro presterade bäst på bärbara datorer under en hög belastning, men var upp till 50% sämre i alla övriga tester. SDL presterade bäst på stationära datorer, därför är det ett bra val för krävande grafiska program på stationära datorer. SFML presterade bäst överlag, vilket gör det till det bästa valet för att skapa grafiska program som är tänkta att köras på olika starka datorer.
22
Banys, Povilas. "Difuzijų, turinčių stacionarųjį tankį, parametrų vertinimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20140702_190707-67965.
Full textAbstract:
Darbe yra nagrinėjama vienmačių homogeninių difuzinių procesų parametrų, įeinančių į difuzijos ir poslinkio koeficientus, vertinimas. Vertinimui naudojama stacionariųjų tankių išraiškos. Panaudojant skaitinius metodus lygtys yra modeliuojamos kompiuteriu, skaičiavimams naudojant SAS statistikos paketą.We consider the estimation of unknown parameters in the drift and diffusion coefficients of a one-dimension diffusion X when the observation is a discrete sample. For the estimation we use stationary distribution function. Using numerical methods we approximate SDE and realize the algorithm with computer.
23
Muth, Annette. "SDL-based design of application specific hardware for hard real-time systems." [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=964752905.
Full text
24
Sugeta, Tatiana. "Uma contribuição para o teste de especificações SDL: aspectos teóricos e empíricos." Universidade de São Paulo, 2004. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-09122014-094349/.
Full textAbstract:
Atividades sistemáticas e rigorosas no processo de desenvolvimento são fundamentais para a obtenção de produtos de software de qualidade, entre elas a utilização de técnicas formais. Apesar do rigor estabelecido pelo uso dessas técnicas nas fases iniciais de desenvolvimento, a qualidade da especificação pode não ser satisfatória. A condução de atividades de W&T Verificação, Validação e Teste, paralelamente às atividades de desenvolvimento, visa a assegurar a qualidade adequada a cada passo do processo. Este trabalho tem como objetivo contribuir para o teste de especificações SDL. SDL é uma técnica formal que surgiu da necessidade de se desenvolver uma linguagem padrão de especificação para a área de telecomunicações. Mais recentemente, SDL tem sido utilizada para a descrição de arquiteturas de software. Diversas técnicas têm sido propostas e utilizadas para garantir a qualidade de especificações SDL, como simulação e model checking; no entanto, não propiciam a análise quantitativa da atividade de validação, como por exemplo, a análise de cobertura, um dos aspectos fundamentais reconhecidos por diversos pesquisadores para avaliar a qualidade das atividades de teste e validação. Neste trabalho foram propostos critérios de teste baseados em fluxo de controle, em fluxo de dados e em mutação, além de estratégias de teste associadas para o teste dos processos de especificações SDL. Também foi definida uma família de critérios de fluxo de controle, FCCSDL, considerando o comportamento de todo o sistema, representado pela Arvore de Alcançabilidade para SDL proposta no escopo deste trabalho. Também foram definidas facilidades para a depuração de especificações SDL, com base nas informações de cobertura de teste. As ferramentas CATSDL e SmartDsDL foram desenvolvidas para apoiar as atividades de teste e depuração de especificações SDL. Com base no estudo de caso conduzido, foram fornecidas evidências da viabilidade da aplicação dos critérios de teste definidos e estabelecida uma estratégia de teste para guiar a atividade de teste de especificações SDL.Systematic and rigorous activities during the development process are fundamental to the quality of the final software product. One of these activities is the use of formal techniques. Although formal techniques can provide rigor in the initial phases of development, the quality of the specification can be unsatisfactory. To guarantee the quality to each development process phase, VV&T - Verification, Validation and Testing - activities should be conducted. This work aims at contributing to the testing activity of SDL specifications. SDL is a formal technique proposed to be a standard specification language for the telecommunication area. Recently, SDL has been used to describe software architecture. Many techniques have been proposed to guarantee the quality of SDL specifications, such as simulation and model checking. However, these techniques do not provide a quantitative measure for the validation activity Many researchers have consider coverage analysis as a fundamental aspect to assess the quality of testing and validation activities. In this work, testing criteria based on control flow, data flow and mutation were proposed to test SDL processes. Testing strategies associated to these criteria were also established. To test the behavior of the SDL system modelled by a reachability tree, a family of control flow-based criteria were defined. Aiming at aiding the SDL debugging activity, some facilities were defined based on testing coverage information. Two tools were developed to support testing and debugging of SDL specifications, CATSDL and SmartDsDL, respectively. A case study was conducted and its results have shown that to use the testing criteria defined in this work to test SDL specifications is feasible. Based on the results of this case study, an incremental testing strategy was defined to guide the testing of SDL specifications.
25
Peng, Yuan. "Modeling of intelligent networks using SDL and an approach for feature interaction detection." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39490.pdf.
Full text
26
Gunnbäck, Johannes, and Helena Mischel. "A situation analysis of the security awareness at Software Vendors and how to best inform them about the Microsoft Security Development Lifecycle." Thesis, Linköping University, Department of Computer and Information Science, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-53708.
Full textAbstract:
In January 2002 Bill Gates sent out the renowned "Trustworthy Computing" memo where he announced that the company would shift their focus from adding new features and functionality to security and privacy. This was what led to the formulation of the Security Development Lifecycle (SDL). This process is now mandatoryfor all development at Microsoft with meaningful business risk and/or with accessto sensitive data. The SDL led to great improvements of the number and severityof vulnerabilities in the products that went through the process. When the vulnerabilitiesin the Operation System (OS) were diminished Microsoft noticed thatthe threats moved to the application layer. This led to them wanting to spread their model to application developers. One interesting target group is mid-sized Independent Software Vendors (ISVs), mainly because there are so many of them. Finding out what development process they use today and how they would benefitfrom and could be informed about the SDL is of interest for Microsoft. Interviews with Microsoft evangelists, security experts and representatives from the target group has been preformed to get a better understanding of the situationtoday and how it could be improved. The interviews have resulted in a numberof recommendations for how to adjust the SDL and the information concerningthe process to meet mid-sized ISVs needs. A clear need for information, that is categorized and directed to the different bussiness areas in the software industry, with specific recommendations and courses of action for each of them, has beenidentified. The inter views have also resulted in a situation analysis of the security awareness at the target group today and the experts view of what activities in the SDL they would benefit from. The maturity level amongst the ISVs was found to be low and their own estimated vulnerability level was low. The estimated security awareness in the future on the other hand is high, this can be accounted for the upcoming migration to cloud services that is requested by the customersand the security issues this will lead to. One thing that is agreed upon that would be suitable to introduce is threat modeling. This requires little security knowledge yet leads to dramatic reduction in vulnerabilities. The experts have also shared improvements they think could be made on the SDL.
27
Mokkedem, Abdelillah. "Verification et raffinement de programmes parallèles dans une logique temporelle compositionnelle : application au langage SDL." Vandoeuvre-les-Nancy, INPL, 1994. http://www.theses.fr/1994INPL051N.
Full textAbstract:
Le contexte dans lequel la logique temporelle linéaire (TL) s'est révélée un outil efficace est celui de la vérification a priori. Cela exige la connaissance préalable entière du programme que l'on veut vérifier. Une première partie de notre travail s'inscrit dans ce cadre et consiste a concevoir une méthode interactive de preuves de propriétés d'invariance et de fatalité de programmes parallèles. Cette méthode, basée sur une théorie appelée crocos, est appliquée au langage SDL. La logique temporelle perd rapidement ses atouts des que l'on s'intéresse a la vérification a posteriori ou un programme parallèle est vérifie progressivement durant le cycle de son développement. Le travail présenté dans la seconde partie de cette thèse concerne l'étude d'une logique temporelle plus raffinée dont la sémantique doit satisfaire la propriété de full abstraction. La nouvelle logique temporelle ainsi établie permet d'éviter que des détails trop atomiques par rapport a un niveau d'abstraction donné soient présents au niveau de la sémantique temporelle des programmes parallèles. Outre la vérification compositionnelle et le développement systématique des programmes parallèles, le raffinement de programmes s'avère rigoureusement axiomatise a l'intérieur de la nouvelle logique temporelle
28
Moreno, Alcerreca Christina. "Services à haute intensité technologique : l'adoption des services de données pour téléphonie mobile en France." Thesis, Evry, Institut national des télécommunications, 2010. http://www.theses.fr/2010TELE0004.
Full textAbstract:
Face au développement des services à haute intensité technologique, se pose le problème de leur acceptation. En téléphonie mobile, les Français se rallient progressivement à ces services et cette thèse vise à comprendre cette adoption. La revue de littérature fondée sur l’adoption des innovations et son adaptation au domaine des services permet d’identifier les principaux facteurs qui influencent l’adoption des services à haute intensité technologique. Une étude qualitative exploratoire a permis d’enrichir notre cadre conceptuel que nous avons testé dans une seconde phase auprès de 350 utilisateurs de services mobiles. Finalement, la réalisation d’une étude de cas s’est avérée nécessaire pour expliquer le décollage des services de données en France à partir du lancement sur le marché d’un nouveau téléphone multifonction Smartphone en 2007-2008. Les résultats des trois études réalisées révèlent que les principaux construits du TAM sont pertinents pour expliquer l’utilisation des services à haute intensité technologique. Nos résultats mettent en valeur l’influence des communautés de marque dans le processus d’adoption des équipements et services mobilesWith the development of technology-based services the question of the level of their acceptance was raised. In mobile communication, the French progressively adopt these services. This thesis aims to understand this adoption. The study of the literature in innovations adoption helped us to identify the main factors influencing technology-based services adoption. An exploratory quality study helped us to enrich our conceptual framework. The proposed model was evaluated by quantitative survey among 350 mobile services users. Finally, the execution of a case study proved itself necessary to explain the take-off of the mobile data services in France due to the launch of a multifunction Smartphone device. The results of the three studies reveal that the TAM constructions are pertinent in the explanation of the technology-based services usage. Our results highlight the influence of brand communities in the technology-based services adoption process
29
Tamura, Roberto Toshiyuki. "Um metodo para a validação de protocolo de comunicação especificado em SDL utilizando rede de Petri." [s.n.], 1988. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259898.
Full textAbstract:
Orientador: Shusaburo MotoyamaDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-17T17:32:48Z (GMT). No. of bitstreams: 1 Tamura_RobertoToshiyuki_M.pdf: 5692280 bytes, checksum: 5060e1cac0598ce84d6c8f7ffee3b0b4 (MD5) Previous issue date: 1988
Resumo: Não informado
Abstract: Not informed.
Mestrado
Mestre em Engenharia Elétrica
30
Keřka, Marek. "Systém podpory prodeje sportovních dat." Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-192386.
Full textAbstract:
The goal of diploma thesis is disquisition on existing file format intended for data transmission over computer network. Choose one of the compared file format and create a file structure for transmission sports data. Assess the structure of files from existing sports data suppliers and create their own structure. Compare the possible ways of distribution of created data files and give recommendations for services implementers.
31
Sarti, Francesca. "Mini-system: un software di calcolo numerico." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8297/.
Full text
32
Dumas, Xavier. "Application des méthodes par ordres-partiels à la vérification formelle de systèmes asynchrones clos par un contexte : application à SDL." Télécom Bretagne, 2011. http://www.theses.fr/2011TELB0157.
Full textAbstract:
Actuellement, les industries engagent tous leurs efforts dans le processus de tests et de simulations à des fins de certification. Néanmoins, ces techniques deviennent rapidement inexploitables pour débusquer des erreurs pouvant conduire à des situations catastrophiques. La couverture des jeux de tests s’amincit au fur et à mesure de la complexification des systèmes, et il devient nécessaire d’utiliser de nouvelles méthodes. Parmi celles-ci, les méthodes formelles ont contribué, depuis plusieurs années, à l’apport de solutions rigoureuses et puissantes pour aider les concepteurs à produire des systèmes non défaillants. Dans ce domaine, les techniques de model-checking ont été fortement popularisées grâce à leur faculté d’exécuter, plus ou moins automatiquement, des preuves de propriétés sur des modèles logiciels. Néanmoins, cette méthode souffre du problème de l’explosion combinatoire. Pour contrer ce phénomène, les méthodes de réduction par ordres-partiels se sont révélées particulièrement efficaces. Toutefois, les issus de la littérature appliquent les méthodes de réduction, lors de la construction de l’automate global composé du système, de son environnement complet ainsi que de la propriété à vérifier. Or, dans la majorité des cas, selon les propriétés à vérifier, la prise en compte de l’environnement complet du système n’est pas nécessaire. L’approche dans laquelle s’insère ce travail consiste tout d’abord à réduire les comportements du système en décrivant un cas d’utilisation particulier de l’environnement avec lequel le système interagit. L’objectif est de guider le model-checker à concentrer ses efforts sur une restriction pertinente de l’automate global pour la vérification. Pour cela, l’environnement est déplié et partitionné pour générer un ensemble de scénarios. La vérification s’effectue en composant chaque scénario avec le système et la propriété à vérifier. La description de l’environnement et la décomposition de la vérification, en vérification élémentaire sur chaque scénario, apporte une réduction importante de l’explosion combinatoire en espace. Néanmoins, dès lors que le nombre d’acteurs devient important, le nombre de scénarios dépliés peut devenir prohibitif, et par conséquent générer une explosion combinatoire en temps et non plus en espace. Pour contrer cette explosion, nous proposons d’étendre les méthodes de réduction d’ordres de manière à déterminer une équivalence entre les scénarios du contexte. Nous appliquons la méthode sur des modèles SDL, tout d’abord dans le cas mono processus puis dans le cas multi-processus sur deux cas d’études avioniques industriels. Nous comparons les résultats avec un model-checker performant : SPIN.
33
Chung, Stella Wing Kwan. "Proposta de mobilidade para protocolos H.323 e SIP em telefonia IP, utilizando linguagem de especificação formal SDL orientada a objetos." [s.n.], 2004. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260161.
Full textAbstract:
Orientador: Walter da Cunha BorelliDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-04T00:33:45Z (GMT). No. of bitstreams: 1 Chung_StellaWingKwan_M.pdf: 1574709 bytes, checksum: 0da0dcfc25970e0c769f10026ff0c99f (MD5) Previous issue date: 2004
Resumo: Este trabalho apresenta propostas de mobilidade para os protocolos H.323 e SIP. Para o protocolo H.323, são desenvolvidos sistemas com mobilidade intra-dominio, inter-dominios e inter-dominios em conjunto com os novos conceitos do protocolo H.510. Estas propostas se basearam na solução de mobilidade desenvolvida por Liao utilizando a expansão da conferencia ad hoc multiponto para realizar roaming e handoff em um estabelecimento de chamada entre terminais moveis H.323. Para o SIP, é desenvolvido o sistema com mobilidade inter-dominios para o estabelecimento de sess~ao entre terminais moveis SIP. Esta proposta se baseia na solução de mobilidade desenvolvida por Chen, Moh e Berquin utilizando a conferencia multiponto com a presença da MCU para realizar roaming e handoff. Todos estes sistemas foram especificados utilizando a linguagem de especificação formal SDL orientada a objeto a partir da ferramenta SDL TAU Suite. Esta ferramenta permite simular os sistemas a partir dos diagramas em MSC e validar os sistemas para detecção e correção de eventuais erros de logica e de especificação
Abstract: This work describes some proposals for mobility extension to H.323 and SIP protocols. The new proposals for H.323 involve intrazone and interzone mobility, and interzone mobility using resources with new entities, signallings and functions from H.510. Based on the mobility solution developed by Liao, these new systems have demonstrated how H.323 could be extended in order to offer mobility using ad hoc multipoint conference for roaming and handoff during a call establishment between H.323 mobile terminals. The other proposal is a system with interzone mobility using multipoint conference with MCU for roaming and handoff during a call establishment between SIP mobile terminals. This system is based on Chen, Moh and Berquin mobility solution. All these systems were specified using the SDL object-oriented formal language with SDL TAU Suite tool. This tool allows the simulation of the systems with MSC diagrams and the validation of the systems by detecting and correcting logical and specification errors
Mestrado
Telecomunicações e Telemática
Mestre em Engenharia Elétrica
34
Guimarães, Rafael Paoliello. "Desenvolvimento de sistemas TINA utilizando a linguagem de especificação formal SDL com geração automatica de codigo Java." [s.n.], 2001. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260150.
Full textAbstract:
Orientador : Walter da Cunha BorelliDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-07-31T15:19:09Z (GMT). No. of bitstreams: 1 Guimaraes_RafaelPaoliello_M.pdf: 1024865 bytes, checksum: 71e403fc82a4651fb1f0d61fa6da36be (MD5) Previous issue date: 2001
Mestrado
35
Alkhodre, Ahmad Badreddin. "Développement formel de systèmes temps réel à l'aide de SDL et IF ( Compilation pour système temps réel )." Lyon, INSA, 2004. http://theses.insa-lyon.fr/publication/2004ISAL0052/these.pdf.
Full textAbstract:
Un système temps réel est un système qui interagit avec un environnement physique en remplissant souvent des missions critiques (une faute du système peut avoir des conséquences graves). Il sera dit correct s'il possède les bonnes fonctionnalités réalisées à temps (contraintes temporelles imposées par l’environnement ou par l’utilisateur). La validation fonctionnelle et temporelle de ces systèmes est une nécessité forte (fournisse des résultats fiables). Dans le cadre des implémentations à base d’exécutifs multitâche temps réel, le travail présenté dans cette thèse tente d’apporter une approche complète formelle de la suite spécification, conception et implémentation. Dans ce cadre, il porte aussi un intérêt particulier à une méthode de validation de la transformation entre le modèle de contraintes et le modèle d'exécution. Nous formalisons plus particulièrement des phases de spécification et la conception en utilisant le langage formel SDL. Ensuite, nous précisons explicitement les contraintes temps réel à nos modèles en utilisant le langage IF. Enfin, nous montrons formellement comment la correction du développement d’une application est prouvéeReal Time system (RTS) is a system which interacts strongly with a physical process. It is subject to strong reliability and real time constraints and to ensure the respect of the real time constraints, it is necessary o use formal languages and techniques. SDL seems to be a good candidate for the RTS development: it is a formal standardized language dedicated to distribute systems. Moreover, several works have been done to extend its use for Real Time and dedicated systems. On the basis of the SDL language, this thesis proposed a framework for the specification, design and behavioural validation of a Real-Time System supported by multitasking real-time operating systems. The specification and a design stages are formalized on the basis of the SDL specialization. To explicit the real time constraints, a precise semantic is given thanks to the IF language. Afterwards, it is shown how the correctness of an application can be formally checked
36
Schmitt, Michael. "Automatic Test Generation Based on Formal Specifications." Doctoral thesis, [S.l.] : [s.n.], 2003. http://hdl.handle.net/11858/00-1735-0000-0006-B3FF-5.
Full text
37
Nogueira, Antonia Diana Braga. "Uma proposta de integração das redes UMTS e IEEE 802.11 com suporte a mobilidade." reponame:Repositório Institucional da UFC, 2007. http://www.repositorio.ufc.br/handle/riufc/17234.
Full textAbstract:
NOGUEIRA, Antonia Diana Braga. Uma proposta de integração das redes UMTS e IEEE 802.11 com suporte a mobilidade. 2007. 91 f. : Dissertação (mestrado) - Universidade Federal do Ceará, Centro de Ciências, Departamento de Computação, Fortaleza-CE, 2007.Submitted by guaracy araujo (guaraa3355@gmail.com) on 2016-05-30T19:51:57Z No. of bitstreams: 1 2007_dis_adbnogueira.pdf: 13756193 bytes, checksum: bb4a338bd2622ad6f90479ce37824ccd (MD5)
Approved for entry into archive by guaracy araujo (guaraa3355@gmail.com) on 2016-05-30T19:52:27Z (GMT) No. of bitstreams: 1 2007_dis_adbnogueira.pdf: 13756193 bytes, checksum: bb4a338bd2622ad6f90479ce37824ccd (MD5)
Made available in DSpace on 2016-05-30T19:52:27Z (GMT). No. of bitstreams: 1 2007_dis_adbnogueira.pdf: 13756193 bytes, checksum: bb4a338bd2622ad6f90479ce37824ccd (MD5) Previous issue date: 2007
Wireless Local Area Networks (WLANs) IEEE 802.11 reach relatively high data transmission rates when compared to other wireless networks, such as Bluetooth. These high data transmission rates have gained attention from the cellular networks operators, which have been considering IEEE 802.11 networks as a complement to their access networks. This interoperability between cellular systems and WLANs has been frequently discussed in the literature. For example, 3GPP (Third Generation Partnership Project) has defined six levels for the complete integration of the third generation cellular networks and WLANs. However, the mobility support has not been specified yet, which is necessary to make feasible voice and data transmission transparence for the final users. Thus, this work presents two approaches for the mobility management of the integration between UMTS and IEEE 802.11 networks: the first one is based on SIP (Session Initiation Protocol), and the other one is based on MIPv6 (Mobile IP version 6). This proposal extends the Loose Interworking architecture and uses the fourth level of the 3GPP specification. First, these approaches are modeled using sequence diagrams and, then, they are mapped to the SDL (Specification and Description Language) formal description technique. SDL, which is largely used to formally specify telecommunications systems, presents simulation and validation procedures that are applied to evaluate the specification and, consequently, the proposed approaches.
As redes locais sem fio (Wireless Local Area Networks - WLANs) IEEE 802.11 atingem taxas de transmissão de dados relativamente altas quando comparadas `a outras redes sem fio, por exemplo, Bluetooth. Essas altas taxas de transmissãao têm interessado as operadoras de redes celulares, as quais começam a ver as redes IEEE 802.11 como um complemento as suas redes de acesso. Esta interoperabilidade entre sistemas celulares e WLANs tem sido um tema bastante discutido na literatura. Por exemplo, o 3GPP (Third Generation Partnership Project) define seis n´ıveis para a total integração das redes celulares de terceira geração com as redes locais sem fio. No entanto, a integração com suporte a mobilidade ainda não foi especificada, o que é necessário para viabilizar a transparência de transmissão de voz e dados para os usuários finais. Esta dissertação apresenta então duas abordagens para o gerenciamento de mobilidade na integração do sistema 3G UMTS com as redes IEEE 802.11: uma baseada no SIP (Session Initiation Protocol ) e a outra no MIP versão 6 (Mobile IP version 6 - MIPv6). A proposta estende a arquitetura Loose Interworking e utiliza os requisitos do nível 4 do 3GPP. Para especificar a proposta, as abordagens de integração das redes UMTS e IEEE 802.11 foram modeladas em diagramas de seqüência e, em seguida, mapeadas para a técnica de descrição formal SDL (Specification and Description Language). SDL, que é bastante utilizada para especificar formalmente sistemas de telecomunicações, apresenta procedimentos de simulação e validação que são aplicados para avaliar a especificação e, em conseqüência, as abordagens propostas.
38
Cansado, Antonio. "Formal specification and verification of distributed component systems." Nice, 2008. http://www.theses.fr/2008NICE4052.
Full textAbstract:
Les composants sont des blocs logiciels qui communiquent par des interfaces bien définies. Ces interfaces définissent un contrat avec l'environnement. Ce contrat doit garantir la compatibilité comportementale des interfaces. Cette compatibilité est en particulier importante quand des composants sont distribués et communiquent par des méthodes asynchrones. Cette thèse se base sur les spécifications comportementales des composants distribués. Nous développons un cadre formel qui nous permet de construire des modèles comportementaux pour ces composants. Après une phase d'abstraction, ces modèles peuvent être utilisés en entrée pour des outils de vérification modernes. L'objectif principal est de spécifier, vérifier et au final de produire des composants distribués avec un comportement garanti. Pour ce faire, nous développons une langage de spécifications proche de Java. Ce langage est établi sur notre modèle comportemental, et fournit une abstraction puissante de haut niveau du système. Les avantages sont les suivants: (i) nous pouvons nous connecter avec des outils de vérification: ainsi nous sommes capables de vérifier plusieurs sortes de propriétés ; et (ii), les spécifications sont assez complètes pour produire des squelettes de code de contrôle des composants. Finalement, nous validons notre approche avec un cas d'étude à l'aide d'un exemple commun de système à composants (``Common Component Model Example (CoCoME)''). Les particularités du langage proposé sont : traiter des composants hiérarchiques qui communiquent par des appels de méthodes asynchrones; donner le comportement d'un composant comme l'ensemble de services; utiliser une sémantique proche d'un langage de programmation; et traiter des abstractions de code utilisateurComponents are self-contained building blocks. They communicate through well-defined interfaces, that set some kind of contract. This contract must guarantee the behavioural compatibility of bound interfaces. This is particularly true when components are distributed and communicate through asynchronous method calls. This thesis addresses the behavioural specification of distributed components. We develop a formal framework that allows us to build behavioural models. After abstraction, these models are a suitable input for state-of-the-art verification tools. The main objective is to specify, to verify, and to generate safe distributed components. To this aim, we develop a specification language close to Java. This language is built on top of our behavioural model, and provides a powerful high-level abstraction of the system. The benefits are twofold: (i) we can interface with verification tools, so we are able to verify various kinds of properties; and (ii), the specification is complete enough to generate code-skeletons defining the control part of the components. Finally, we validate our approach with a Point-Of-Sale case-study under the Common Component Model Example (CoCoME). The specificities of the specification language proposed in this thesis are: to deal with hierarchical components that communicate by asynchronous method calls; to give the component behaviour as a set of services; and to provide semantics close to a programming language by dealing with abstractions of user-code
39
Zaïdi, Fatiha. "Contribution à la génération de tests pour les composants de service. Application aux services de réseau intelligent." Evry-Val d'Essonne, 2001. http://www.theses.fr/2001EVRY0011.
Full textAbstract:
Le test de conformité est une activité cruciale dans le développement d'une application. Il a pour but de s'assurer que le produit fini correspond bien à la spécification de départ. Devant la complexité croissante des systèmes de télécommunications, il est devenu nécessaire d'assister les différentes phases de développement des systèmes par des méthodes et des outils. Ainsi, les méthodes formelles ont permis l'émergence de méthodes de génération automatique de tests et ainsi la possibilité de soulever un grand nombre d'ambigui͏̈tés dans l'expression de ce que doit réaliser le système. Or, le test exhaustif de ces systèmes n'est pas toujours possible pour des cas réels, en raison du problème bien connu d'explosion combinatoire du nombre d'états. Dans cette thèse, nous proposons une méthode de génération de tests pour les composants de services dans une architecture de réseau intelligent afin d'éviter la génération de tests redondants et le problème d'explosion susmentionnée. Cette thèse porte sur la définition d'algorithmes de génération de tests à partir de spécifications exprimées sous formes de machines à états finis étendues et plus particulièrement sur leur application au test de composants imbriqués dans le cadre du domaine des services en télécommunication. Nous abordons ces problématiques sous les angles théoriques et pratiques liés à la définition et la mise en oeuvre de ses algorithmes adaptés ainsi quà́ la confrontation avec des études de cas réalistes et de tailles conséquentes. Nous étendons également le champ de l'applicabilité de la méthode proposée pour le test imbriqué au test d'interopérabilité. Intuitivement, l'optique choisie est de considérer tout échange de messages entre les deux implantations comme composante d'un automate intermédiaire, modélisant l'interfonctionnement des deux systèmes. Cet automate est ensuite tout simplement vu comme une spécification imbriquée qu'il s'agit de tester en vue de vérifier l'interopérabilité.
40
Dumery, Jean-Jacques. "Un langage de spécification pour la conception structurée de la commande des systèmes à évènements discrets." Châtenay-Malabry, Ecole centrale de Paris, 1999. http://www.theses.fr/1999ECAP0644.
Full textAbstract:
Dans le cadre de l'ingénierie des systèmes automatisés de production, concevoir une commande de système à évènements discrets est une activité complexe. Elle nécessite souvent l'utilisation de méthodes qui mettent en œuvre un ensemble de langages de spécification. Par ailleurs, on observe que les représentations graphiques sont de plus en plus privilégiées par rapport aux représentations littérales et algébriques du fait de leur aptitude à servir de support de communication entre tous les intervenants. C'est dans cet esprit que le Grafcet a été conçu. Il est aujourd'hui largement enseigné, utilisé dans l'industrie, normalisé, et il est servi par de nombreuses publications. Toutefois, une critique classiquement faite au Grafcet est qu'il porte peu d'informations de structuration et qu'il permet difficilement d'exprimer formellement de la sémantique application. C'est cette problématique qui nous a amené à définir un langage de spécification du comportement de la commande des systèmes à évènements discrets basé sur le Grafcet, s'inspirant des Statecharts, appelé HyperGrafcet. Ce langage, s'appuyant sur le concept d'hyperétape, permet d'exprimer formellement la hiérarchie structurelle grâce à un mécanisme d'encapsulation et de la sémantique application (ou externe) grâce à des étiquettes. Un Meta modèle statique de l'HyperGrafcet a été élaboré. L'objectif de ce méta-modèle est de formaliser la syntaxe de l'HyperGrafcet, en mettant en évidence les concepts de base de ce langage de spécification et les liens entre ces différents concepts, et d'éviter les imprécisions dues à une description en langage naturel. Apres la formalisation statique de l'HyperGrafcet, une formalisation dynamique est proposée. Ceci nécessite la définition d'un cadre temporel à plusieurs échelles de temps, des règles d'évolution du langage, ainsi que d'un algorithme d'interprétation des règles d'évolution. Ces règles et l'algorithme d'interprétation associé privilégient le concept de situation. Nous avons en conséquence développé une algèbre permettant de manipuler les situations d'un développement d'Hyperétape et de les combiner. Nous définissons une fonction appelée test qui permet d'associer une valeur de vérité à l'établissement d'une situation ou d'une combinaison de tests sur situations. Ainsi, nous avons pu formaliser les mécanismes de positionnement de développement lors d'évolutions. Ce langage de spécification a été testé avec succès, notamment dans le cas de l'expression des modes de marche, sur diverses applications industrielles caractéristiques de productions de type continu, batch et manufacturier
41
Calabretto, Sylvie. "Contribution à la validation des spécifications algébriques et à l’étude des spécifications algébriques avec contraintes." Lyon, INSA, 1993. http://www.theses.fr/1993ISAL0017.
Full textAbstract:
Le rôle clef joué par la spécification dans le cycle de vie du logiciel est aujourd'hui universellement reconnu. Il est en effet admis que nombre d'erreurs de mise au point et de maintenance pourraient être évitées si le problème de départ avait été spécifié de façon plus précise et plus exacte. Les recherches actuelles sur les spécifications s'accordent toutes à concevoir qu'une spécification doit être formelle. La méthode de spécification algébrique de logiciels constitue actuellement un axe de recherche privilégié. L'objet de la première partie de cette thèse est l'étude de la validation des spécifications algébriques équationnelles et conditionnelles. Nous montrons comment les techniques de réécriture permettent d'automatiser les preuves de consistance, de complétude suffisante et de théorèmes inductifs sur ces spécifications. Les principaux résultats obtenus concernent la définition d'une démarche pour l'élaboration et la validation des spécifications algébriques. Des éléments méthodologiques sont dégagés au travers : - d'un cycle de vie des spécifications algébriques, - de techniques de validation, - d'éléments de vérification. Une application, le problème des élections à la proportionnelle, illustre la démarche. La deuxième partie de cette thèse est consacrée à la conception d'une théorie des spécifications algébriques avec contraintes. Nous proposons de plus une définition de la sur réduction avec contraintes et montrons comment ce concept fournit une procédure correcte et complète pour résoudre des équations contraintes. Un outil, basé sur la théorie proposée est développéIt is nowadays universally recognized that specification plays an important roll in software life cycle. It is admitted that many errors discovered during software maintenance could be avoided if the problem had been initially specified in a more precise and exact way. Present research on specification methods all conclude that a specification must be formal. The algebraic specification method is actually a major research area. The object of the first part of this thesis deals with equational and conditional algebraic specification validation. We show how rewriting techniques allow for automatizing proofs of consistence, sufficient completeness and inductive theorems on algebraic specification. The main results concern the definition of a process for the design validation of algebraic specifications. Methodological elements are proposed through : - an algebraic specification life cycle - techniques of validation - elements of verification. An application, the problem of proportional election, illustrates our methodology. The second part of this thesis deals with the design of a theory of algebraic specification with constraints. Moreover, we propose a definition of constrained narrowing and show how this concept supplies a correct and complete procedure for equation resolution in algebraic specifications with constraints. Finally, we develop a tool based on the proposed theory illustrating its advantages
42
Alfakhri, Demah Hussain. "Exploring the impact of hotel interior design through service dominant logic (SDL) and consumer culture theory (CCT) lenses." Thesis, University of Hull, 2015. http://hydra.hull.ac.uk/resources/hull:13616.
Full textAbstract:
This study examined the role of interior design in a hotel context. Although the role of interior design is clear in daily life and managerial activities, little consumer research has been conducted to identify the influential elements of interior design and capture their impacts, specifically within the hotel industry. Additionally, there is limited theoretical support for the integration of design and business disciplines, and the integration of consumer culture theory (CCT) and service dominant logic (SDL) theories. Addressing these gaps, this study sought to understand the underpinnings of hotel interior design, and explain its role from the distinct perspective of cosmopolitan consumers, through servicescape, CCT and SDL lenses. Drawing on the CCT and SDL theories in this research, the perspective of value creation in SDL is combined with the meaning creation in CCT, to explore what meanings hotel interior design can convey to hotel consumers, what it means to them, and how it influences them. An interpretivist research paradigm was employed using an inductive approach, and qualitative data was collected through thirty-seven semi- structured interviews. The findings of the research have indicated that consumers perceive hotels’ interior design holistically as a first impression. However, over time and with usage experience certain design elements increase in importance relative to others (e.g. colour, lighting). Therefore the findings highlighted that the perception is formed by both the functionality and the aesthetic appearance of the interior design, and identified the most influential interior design elements. The findings also revealed that hotel interior design is very critical in forming customers’ perceptions, creating value, symbolizing meanings, and shaping their overall experience. This study is of both theoretical and managerial importance. Theoretically, this study developed the “Hotelscape” framework as the core contribution and the final outcome of the study. This framework identifies the elements that form the overall interior design of a hotel servicescape, along with their impacts on customers and hoteliers in one comprehensive framework. It also unites separate concepts such as design and business, and integrates several theories including SDL and CCT. Managerially, this study will enhance the hotel managers’ awareness of the practical value of interior design. It will help hoteliers understand their consumers better, and enable them to manipulate their service environments to differentiate their offerings through interior design. As such, this study sends an overriding message to academics and managers that the coordination between design and business is necessary and beneficial, especially in a globalized and competitive industry such as hotels.
43
Nogueira, Antonia Diana Braga. "Uma proposta de integraÃÃo das redes UMTS e IEEE 802.11 com suporte a mobilidade." Universidade Federal do CearÃ, 2007. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1354.
Full textAbstract:
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgicoAs redes locais sem fio (Wireless Local Area Networks - WLANs) IEEE 802.11 atingem taxas de transmissÃo de dados relativamente altas quando comparadas `a outras redes sem fio, por exemplo, Bluetooth. Essas altas taxas de transmissÃao tÃm interessado as operadoras de redes celulares, as quais comeÃam a ver as redes IEEE 802.11 como um complemento as suas redes de acesso. Esta interoperabilidade entre sistemas celulares e WLANs tem sido um tema bastante discutido na literatura. Por exemplo, o 3GPP (Third Generation Partnership Project) define seis nÂıveis para a total integraÃÃo das redes celulares de terceira geraÃÃo com as redes locais sem fio. No entanto, a integraÃÃo com suporte a mobilidade ainda nÃo foi especificada, o que à necessÃrio para viabilizar a transparÃncia de transmissÃo de voz e dados para os usuÃrios finais. Esta dissertaÃÃo apresenta entÃo duas abordagens para o gerenciamento de mobilidade na integraÃÃo do sistema 3G UMTS com as redes IEEE 802.11: uma baseada no SIP (Session Initiation Protocol ) e a outra no MIP versÃo 6 (Mobile IP version 6 - MIPv6). A proposta estende a arquitetura Loose Interworking e utiliza os requisitos do nÃvel 4 do 3GPP. Para especificar a proposta, as abordagens de integraÃÃo das redes UMTS e IEEE 802.11 foram modeladas em diagramas de seqÃÃncia e, em seguida, mapeadas para a tÃcnica de descriÃÃo formal SDL (Specification and Description Language). SDL, que à bastante utilizada para especificar formalmente sistemas de telecomunicaÃÃes, apresenta procedimentos de simulaÃÃo e validaÃÃo que sÃo aplicados para avaliar a especificaÃÃo e, em conseqÃÃncia, as abordagens propostas.
Wireless Local Area Networks (WLANs) IEEE 802.11 reach relatively high data transmission rates when compared to other wireless networks, such as Bluetooth. These high data transmission rates have gained attention from the cellular networks operators, which have been considering IEEE 802.11 networks as a complement to their access networks. This interoperability between cellular systems and WLANs has been frequently discussed in the literature. For example, 3GPP (Third Generation Partnership Project) has defined six levels for the complete integration of the third generation cellular networks and WLANs. However, the mobility support has not been specified yet, which is necessary to make feasible voice and data transmission transparence for the final users. Thus, this work presents two approaches for the mobility management of the integration between UMTS and IEEE 802.11 networks: the first one is based on SIP (Session Initiation Protocol), and the other one is based on MIPv6 (Mobile IP version 6). This proposal extends the Loose Interworking architecture and uses the fourth level of the 3GPP specification. First, these approaches are modeled using sequence diagrams and, then, they are mapped to the SDL (Specification and Description Language) formal description technique. SDL, which is largely used to formally specify telecommunications systems, presents simulation and validation procedures that are applied to evaluate the specification and, consequently, the proposed approaches.
44
West, James F. "An examination of the application of design metrics to the development of testing strategies in large-scale SDL models." Virtual Press, 2000. http://liblink.bsu.edu/uhtbin/catkey/1191725.
Full textAbstract:
There exist a number of well-known and validated design metrics, and the fault prediction available through these metrics has been well documented for systems developed in languages such as C and Ada. However, the mapping and application of these metrics to SDL systems has not been thoroughly explored. The aim of this project is to test the applicability of these metrics in classifying components for testing purposes in a large-scale SDL system. A new model has been developed for this purpose. This research was conducted using a number of SDL systems, most notably actual production models provided by Motorola Corporation.Department of Computer Science
45
Barreto, Matheus de Carvalho. "Especificações e simulação na linguagem formal SDL das sinalizações de registro e conexão de uma rede ATM sem fio." [s.n.], 1999. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260010.
Full textAbstract:
Orientador: Walter da Cunha BorelliDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-07-25T11:13:00Z (GMT). No. of bitstreams: 1 Barreto_MatheusdeCarvalho_M.pdf: 5411951 bytes, checksum: 03617380c5b23608e58b09d83a021a4f (MD5) Previous issue date: 1999
Resumo: Nessa tese são especificadas formalmente em SDL (Specification and Description Language) e simuladas através do SDT1 (SDL Design Tool), as sinalizações de Registro (Registration) e Conexão (Call Setup) de um terminal em uma rede ATM sem fio - WATM. Na especificação da sinalização de Registro, é proposta a inclusão de um sinal, Updated, cuja função é atualizar os dados de registro do terminal, quando ocorrer dele ser registrado inicialmente como visitante, e ter seu registro modificado para seu próprio domínio. Para a sinalização de Conexão é proposta uma modificação na seqüência onde é verificada a aceitação da qualidade de serviço (QoS) da conexão. Essa modificação visa diminuir o fluxo de mensagens entre os componentes da rede quando o pedido de conexão é recusado devido ao QoS. As especificações propostas foram simuladas com o objetivo de validação. Foram simuladas várias configurações para a rede WATM. Os resultados das simulações são apresentados em gráficos MSC (Message Sequence Chart) onde são mostradas as mensagens trocadas entre os elementos da rede, para cada uma das sinalizações especificadas. São também mostrados exemplos de falhas de especificação detectadas durante as simulações e suas correções
Abstract: In this thesis, the Registration and Call Setup signallings of a terminal in a wireless ATM network - WATM are formally specified in SDL (Specification and Description Language) and simulated using the SDT1 (SDL Design Tool). During the Registration signalling specification, the insertion of a signal, Updated, is proposed, which has the function of updating the terminal registration data, whenever the terminal is initially registered as a visitor, and has its register data modified to its own domain. To the Call Setup signalling a modification on the sequence is proposed, where the acceptance of the quality of service (QoS) of the connection is verified. This modification aims at decreasing the messages flow among the components of the network when the connection request is denied due to the QoS. For the purpose of validation, the specifications proposed were simulated. Many configurations of the WATM network were simulated. The simulations results were presented in MSC (Message Sequence Chart) graphics, where the messages swapped among the network devices, for each specified signalling, are shown. Some examples of specifications faults detected during the simulations as well as their corrections were also shown
Mestrado
Mestre em Engenharia Elétrica
46
Pierrot, Adeline. "Combinatoire et algorithmique dans les classes de permutations." Paris 7, 2013. http://www.theses.fr/2013PA077056.
Full textAbstract:
Cette thèse porte sur l'étude des classes de permutations à motifs exclus. Une analyse combinatoire des permutations via leur décomposition par substitution permet d'obtenir des résultats algorithmiques. La première partie de la thèse étudie la structure des classes de permutations. Plus précisément on donne un algorithme pour calculer une spécification combinatoire pour une classe de permutations données par sa base de motifs exclus. La spécification est obtenue si et seulement si la classe contient un nombre fini de permutations simples, cette condition étant testée par l'algorithme lui-même. Cet algorithme puise sa source dans les travaux de Albert et Atkinson établissant qu'une classe ayant un nombre fini de permutations simples a une base finie et une série génératrice algébrique. Les méthodes développées utilisent la théorie des langages et des automates, les ensembles partiellement ordonnés, l'introduction de motifs obligatoires. La seconde partie de la thèse donne un algorithme polynomial décidant si une permutation donnée en entrée est triable par deux piles connectées en série. L'existence d'un algorithme polynomial résolvant cette question est un problème longtemps resté ouvert, que l'on clôt dans cette thèse en introduisant une nouvelle notion, le tri par sas, en utilisant un codage des procédures de tri par un bi-coloriage du diagramme des permutations. Puis on résout le problème général en montrant qu'une procédure de tri général correspond à plusieurs étapes de tri par sasThis work is dedicated to the study of pattern closed classes of permutations. Algorithmic results are obtained thanks to a combinatorial study of permutation classes through their substitution decomposition. The first part of the thesis focuses on the structure of permutation classes. More precisely, we give an algorithm which derives a combinatorial specification for a permutation class given by its basis of excluded patterns. The specification is obtained if and only if the class contains a finite number of simple permutations, this condition being tested algorithmically. This algorithm takes its root in the theorem of Albert and Atkinson stating that every permutation class containing a finite number of simple permutations has a finite basis and an algebraic generating function, and its developments by Brignall and al. The methods involved make use of languages and automata theory, partially ordered sets and mandatory patterns. The second part of the thesis gives a polynomial algorithm deciding whether a permutation given as input is sortable trough two stacks in series. The existence of a polynomial algorithm answering this question is a problem that stayed open for a long time, which is solved in this thesis by introducing a new notion, the pushall sorting, which is a restriction of the general stack sorting. We first solve the decision problem in the particular case of the pushall sorting, by encoding the sorting procedures through a bicoloring of the diagrams of the permutations. Then we solve the general base by showing that a sorting procedure in the general case corresponds to several steps of pushall sorting which have to be compatible
47
Pavlova, Mariela. "Vérification de programmes en code octet et ses applications." Nice, 2007. http://www.theses.fr/2007NICE4010.
Full textAbstract:
Les techniques de vérification basées sur les logiques de programmation ainsi que sur les générateurs de conditions de vérification permettent de raisonner de manière efficace sur les programmes. Bien que ces techniques aient souvent été utilisées avec des langages de haut niveau pour bénéficier de leurs structures, il est souvent nécessaire, plus spécifiquement dans le contexte du code mobile, de prouver la correction de programmes déjà compilés. C’est pourquoi il est très intéressant d’avoir un moyen pour utiliser la vérification de code source au niveau de l’utilisateur de code. Nous proposons un mécanisme qui permet de transférer des informations depuis le programme source vers le programme compilé. Il est construit autour d’un langage de spécification pour le code binaire, un générateur de conditions de vérification qui s’utilise sur des programmes annotés et un compilateur qui transforme les annotations au niveau du code source en des annotations au niveau du code binaire. Nous montrons que le générateur des conditions de vérification est correct et que les obligations de preuves au niveau du source et du code binaire sont presque les mêmes. Nous illustrons les bénéfices de notre démarche par deux études de casProgram verification techniques based on programming logics and verification condition generators provide a powerful means to reason about programs. Whereas these techniques have very often been employed in the context of high-level languages in order to benefit from their structural nature. It is often required, especially in the context of mobile code, to prove the correctness of compiled programs. Thus it is highly desirable to have a means of bringing the benefits of source code verification to code consumers. We propose a mechanism that allows to transfer evidence from source programs to compiled programs. It builds upon a specification language for bytecode, a verification condition generator that operates on annotated programs, and a compiler that transforms source annotations into bytecode annotations. We show that the verification condition generator is sound, and that the proof bytecode level nearly coincides. We illustrate the benefits of oue framework in two case studies
48
Kaiser, Michael. "Bewertung des Simulationsmodells des HiSAP-Werkzeugs zur interaktiven Simulation von Protokollen." [S.l.] : Universität Stuttgart , Fakultät Informatik, 1998. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB7400619.
Full text
49
Christmann, Dennis [Verfasser], and Reinhard [Akademischer Betreuer] Gotzhein. "Distributed Real-time Systems - Deterministic Protocols for Wireless Networks and Model-Driven Development with SDL / Dennis Christmann. Betreuer: Reinhard Gotzhein." Kaiserslautern : Technische Universität Kaiserslautern, 2015. http://d-nb.info/1073868486/34.
Full text
50
Pettersson, Mattias. "Mjukvarubaserad 3D-renderare." Thesis, Blekinge Tekniska Högskola, Sektionen för teknokultur, humaniora och samhällsbyggnad, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3520.
Full textAbstract:
Abstrakt Produkten som jag har utvecklat är en mjukvarubaserad 3D-renderare. För att göra en sådan produkt är man tvungen att gå djupt in i området 3D och utföra alla beräkningar på egen hand. Dessa tar annars grafikkortet hand om. Denna rapport förklarar varför jag har valt att göra en egen mjukvarubaserad 3D- renderare och vad den är för något och i vilka områden den används. Här förklaras även min syn på programmering, digitala spel, vad programmering innebär för mig och hur min syn på spel har påverkat mig med tiden. Jag tar även upp mina tankar om spelindustrin och samhällets misstolkade värderingar av spel samt vad för sorts spel jag anser skulle gynna mänskligheten i framtiden. Vad jag tycker om utbildningen Digitala spel nämns också samt hur jag tror att den skulle kunna förbättras. Slutligen följer en kortfattad beskrivning av hur mitt projekt har genomförts. Abstract The product I have been developing is a software based 3D renderer. To do such a thing you need to go deeply into the 3D subject and do all calculations which normally would be handed over as tasks to the graphic card. This document explains why I have chosen to do my own software based 3D renderer and what it really is. The document also explains what a 3D renderer does and in which places it is being used. Here you will also find my own explanation about programming and digital games, the meaning of programming for me and how my vision towards games has affected me in time. My ideas of the gaming industry, the misunderstandings of games in society and what sort of games that I think would aid humanity in the future. What I think about the education Digital Games will also be brought up as well as how I think Digital Games could be improved. Finally, a short description how the process of my project has been carried out will be told.Detta är en reflektionsdel till en digital medieproduktion. Tele: tel 0709-210255 Mail: mattiaspgames@gmail.com