Dissertations / Theses on the topic 'CSP'
To see the other types of publications on this topic, follow the link: CSP.
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 'CSP.'
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
BECCU, GABRIELE. "The link between CSP and CFP." Doctoral thesis, Università degli Studi di Cagliari, 2017. http://hdl.handle.net/11584/249614.
Full textAbstract:
This work aims to contribute to the existent research body on Corporate Social Performance (CSP) by proving the existence of a business case for CSR, demonstrating the existence of a link between the Corporate Social Responsibility performances and the Corporate Financial Performances (CFP) of firms.
We endeavor in answering our research question firstly through a qualitative analysis in order to generate an effective research design and subsequently by applying the resulting research design in two empirical analyses on European and Italian firms.
The results of our analyses confirm that firms with higher CSR performances report increased economic, financial and operating performances, showing the existence of a positive correlation between CSP and CFP.
The first study allows us to conclude that at least four transmission mechanisms of CSP on CFP exist. We theorize that the typology of communication enacted, the proactivity in implementing CSR actions and the industrial sector of firms can mitigate the transmission of CSR behaviour into perceived CSR performances. Finally, we theorize that the coherence over time (or consistency) of CSR performances, the geographical area where firms operate, and the congruity of CSR actions with companies’ core business, shall be considered as mitigating factors of the transmission of CSP on CFP.
The second study, through an empirical analysis on 191 European firms, based on the research design generated in the first study, concludes that a positive link between firms’ social performances and their economic and workforce productivity, intended as a proxy of operating performance exists.
We acknowledge that endogeneity might arise in our analysis given that conditions that drive firms to implement CSR activities could affect their financial, economic and operating performances, and given that some correlation might arise between the control variables and the error term in our model. To address this issue properly, we conduct an endogeneity correction or treatment effect Heckman two-stage model on our data.
After treating for endogeneity using a two-step Heckman model, our analysis continues to show that a higher overall CSR score is significantly correlated with higher revenues/ employees and higher revenues, whilst EBITDA margin %, still maintains a positive correlation, loses statistical significance.
We conclude that, even if endogeneity might be present in our analyses, it does not affect the results of our inquiry.
The third study, through an empirical analysis on 42 Italian firms, based again on the research previously generated, but with a different sample and a structured segmentation of CSR activities, concludes once more that positive CSR performances are associated with higher financial, economic and operating performances.
In particular, the present work allows us to segment the multidimensional construct that represents Corporate Social Responsibility while analyzing its effects in relation to CFP of firms, leading to an increased level of understanding of the topic.
Also in the third study we discuss endogeneity issues. Furthermore, both in the second and third study, we discuss also potential issues arising from measurement errors in the empiric analyses conducted.
We draw the conclusion that managers may increase the economic, financial and operating performances of firms by implementing socially responsible activities, in particular in relation to socially responsible labor practices and product responsibility practices. In addition, we conclude that when implementing environmental responsibility practices managers shall estimate the direction of their potential economic and financial returns in relation to the transmission channels activated by their investments.
Finally, we suggest areas of further research in the field, in order to encourage scholars to expand the literature following the research path that we identified.
2
Wrench, Karen Lee. "CSP-i : an implementation of CSP." Thesis, Rhodes University, 1987. http://hdl.handle.net/10962/d1003124.
Full textAbstract:
CSP (Communicating Sequential Processes) is a notation proposed by Hoare, for expressing process communication and synchronization. Although this notation has been widely acclaimed, Hoare himself never implemented it as a computer language. He did however produce the necessary correctness proofs and subsequently the notation has been adopted (in various guises) by the designers of other concurrent languages such as Ada and occam. Only two attempts have been made at a direct and precise implementation of CSP. With closer scrutiny, even these implementations are found to deviate from the specifications expounded by Hoare, and in so doing restrict the original proposal. This thesis comprises two main sections. The first of these includes a brief look at the primitives of concurrent programming, followed by a comparative study of the existing adaptations of CSP and other message passing languages. The latter section is devoted to a description of the author's attempt at an original implementation of the notation. The result of this attempt is the creation of the CSP-i language and a suitable environment for executing CSP-i programs on an IBM PC. The CSP-i implementation is comparable with other concurrent systems presently available. In some aspects, the primitives featured in CSP-i provide the user with a more efficient and concise notation for expressing concurrent algorithms than several other message-based languages, notably occam.KMBT_363
Adobe Acrobat 9.53 Paper Capture Plug-in
3
Jampel, Michael Benjamin. "Over-constrained systems in CLP and CSP." Thesis, City University London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319633.
Full text
4
Chiarot, Giacomo <1995>. "CSP Synthesis." Master's Degree Thesis, Università Ca' Foscari Venezia, 2019. http://hdl.handle.net/10579/15392.
Full textAbstract:
Cross Site Scripting (XSS) is a widespread web vulnerability that allows an attacker to inject code in a web page, fully compromising it. Content- Security-Policy (CSP) is a security mechanism that limits the effects of XSS attacks. However it is hard to configure and, for this reason, it is not widely adopted. For the same reason, many real policies in the wild are misconfigured.
In this thesis we present a Chrome extension for semi-automatically generating and enforcing CSP while navigating the web. We analyze the generated policies to see if the extension does not break the navigation while enforcing the security of users surfing the Web. The extension is useful both for end users and for developers, since it is able to build a policy that can be permanently included in a new website.
5
Vajar, Beeta. "Mobile CSP||B." Thesis, University of Surrey, 2009. http://epubs.surrey.ac.uk/843387/.
Full textAbstract:
Formal methods are mathematically based languages for producing verifiable, consistent and more reliable formal specifications which leads to the construction of trustworthy and maintainable computer programs. Most formal methods can be classified as state-based or event-based formal methods. State-based formal methods, such as the B-Method, are capable of describing data aspects of the system but they are not able to describe behavioural aspects or concurrency. On the other hand, by using event-based formal methods, such as CSP, we are not able to describe data aspects of the system which results in difficulty to describe systems which contain state transitions. Over the years, the idea of combining state and event based formal methods has been proposed in order to design systems in which both data and behavioural aspects are described. The idea of creating a combination of state and event based formal methods which is able to describe mobility and dynamic patterns has also been raised in formal method integration. This additional functionality is suitable for modelling agent systems or peer-to-peer networks where consideration of mobility is important. CSP || B is a combination of CSP and B in which CSP processes are used as control executives for B machines. This architecture enables a B machine and its controller to interact and communicate with each other while working in parallel. The architecture has focused on sequential CSP processes as dedicated controllers for B machines. This thesis introduces Mobile CSP || B, a formal framework based on CSP || B which enables us to specify and verify concurrent systems with mobile architecture as well as the previous static architecture. In Mobile CSP || B, a parallel combination of CSP processes act as the controller for the B machines and these B machines can be transferred between CSP processes during the system execution.
6
Gardner, William Bennett. "CSP++, an object-oriented application framework for software synthesis from CSP specifications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0013/NQ53041.pdf.
Full text
7
Bergquist, Gustav, and Pelle Sandström. "Är det lönsamt att investera i CSR? : Förhållandet mellan Corporate Social Performance och Corporate Financial Performance." Thesis, Uppsala universitet, Företagsekonomiska institutionen, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-355085.
Full textAbstract:
Denna studie undersöker det finansiella värdeskapandet av CSR-aktiviteter genom att studera förhållandet mellan Corporate Social Performance (CSP) och Corporate Financial Performance (CFP). I enlighet med The CSP-CFP multilevel framework studeras ett avgränsat CSP-CFP samband med utgångspunkt i svenska konsumenter. Vidare undersöker studien den modererande effekten av företagsstorlek på det undersökta CSP-CFP sambandet. Av resultatet framkommer ett signifikant positivt CSP-CFP förhållande för CSR-aktiviteter riktade mot svenska konsumenter. Av resultatet framkommer även ett signifikant starkare positivt CSP-CFP samband för små svenska företag jämfört med för stora svenska företag. Resultatet bidrar till en ökad förståelse av CSP-CFP förhållandet på den svenska marknaden avgränsat för intressentgruppen konsumenter. Framtida forskning kan med fördel, genom kvalitativa metoder, undersöka de underliggande faktorerna som påverkar det finansiella värdeskapandet av CSR-aktiviteter riktade mot konsumenter.
8
Bergquist, Maja, and Malin Tafvelin. "Hållbarhet och lönsamhet : Förhållandena mellan CSP och CFP i en svensk kontext." Thesis, Umeå universitet, Företagsekonomi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-124644.
Full textAbstract:
Under de senaste årtiondena har ansvarfullt företagande (CSR) varit ett ämne som erhållit allt mer fokus inom forskning och således även för företag och samhället i stort. CSR är ett ämne som är högst aktuellt då globalisering är ett faktum och medför att de företag som är verksamma idag bär ett globalt ansvar, då dessa är stora aktörer i en värld som kantas av ekonomiska kriser, miljöproblem och humanitär försummelse. Det ökade intresset från samhället för CSR har medfört att företagen idag ser detta som en strategisk investering och företags satsning i hållbarhetsaktiviteter har kommit att erhålla en allt större del av företags verksamhet. Frågan kvarstår om detta endast är en investering som ökar företagets etik och moral eller om det faktiskt är lönsamt, och även om lönsamma företag ökar sin investering i hållbarhetsarbete. En stor mängd forskning har utförts för att undersöka förhållandena mellan hållbarhet och lönsamhet, dock utan att konsensus i forskningsgrenen har uppkommit. Grundat på den nuvarande forskningssituationen syftade denna studie till att undersöka vilken effekt ansvarsfullt företagande har på olika lönsamhetsmått, samt vilken effekt de olika lönsamhetsmåtten har på ansvarsfullt företagande, i företag registrerade på large cap och mid cap på Nasdaq OMX Stockholm. För att besvara studiens problemformulering och uppfylla studiens syfte har en kvantitativ forskningsansats brukats och ett urval av företag listade på large och mid cap Nasdaq OMX Stockholm har undersökts. För att sätta ett mått på ansvarsfullt företagande (CSP) har en innehållsanalys av företags årsrapporter och hållbarhetsrapporter genomförts, lönsamhetsmåtten (CFP) har utgått från redovisningsbaserade mått (ROE och ROA) samt ett marknadsbaserat mått (total avkastning). Vidare undersöks även relationen mellan variablerna, CSP och CFP, med en tidsaspekt och kontrollvariablerna storlek, risk, FoU och industritillhörighet har brukats. De teorier som har använts för att förklara CFP:s effekt på CSP är slappa resurser och direktörsopportunism, och effekten CSP har på CFP har teorierna intressentteorin, resursbaserad synvinkel och kompromissteorin använts. Det resultat som framkommit genom de multipla regressionerna som testat studiens hypoteser visar att ROE:s effekt på CSP är positiv, medan både ROA:s och avkastningens effekt på CSP är neutral. Slutsatsen blir således delad då lönsamhetsmåttet ROE visar att företag som har en högre lönsamhet kommer investera mer i hållbarhet, denna effekt knyts samman med teorin om slappa resurser. Å andra sidan visar både ROA och avkastning på en neutral effekt på CSP vilket ej kan knytas till varken slappa resurser eller direktöropportunism. Vidare när istället CSP:s effekt på ROE, ROA och avkastning undersökts visar samtliga på en neutral påverkan. Den slutsats som kan dras från detta resultat är att hållbarhetsarbete ej empiriskt kan säkerställa en högre eller lägre lönsamhet, och varken intressentteorin, resursbaserad synvinkel eller kompromissteorin kan förklara resultatet. Med icke-konklusiva resultat föreslår författarna för vidare forskning inom området där mer forskning i den svenska kontexten är nödvändig.
9
Sikhosana, Qedile. "Global review of CSP technologies." Master's thesis, University of Cape Town, 2011. http://hdl.handle.net/11427/12454.
Full textAbstract:
Includes abstract.This global review of concentrating solar power (CSP) technologies is based mainly on an assessment of available international literature, up to 31 October 2011. It includes a review of major CSP projects currently operating or under development at this time; the respective CSP technologies employed; and an assessment of the present and future economics of CSP relative to other conventional and renewable energy electricity-generating technologies. Global outlook scenarios for CSP are discussed, as well as specific conditions and proposals for CSP developments in South Africa. The economic analysis has been limited by several challenges. Since the CSP industry is new, there are few well-documented projects on which to base the analysis. Most of the projects referenced here are from the USA and Spain. As the CSP market rapidly expands, competition in the industry tends to restrict the disclosure of detailed financial/economic information for projects under development. In general, it has been difficult to compare the publicly available economic data, on a reliable basis, since the financial costing parameters used may vary from case to case. In addition, most of the economic forecasts, which have been reviewed, are based on forward modeling rather than practical proven costs. There are uncertainties and quite wide variations in such predictions. This dissertation concludes, however, that there is great optimism for the growing employment of CSP technology in the near future and that CSP electricity-generating costs, in areas with high solar energy resources, are expected to become competitive with levelised electricity generating costs from other conventional and renewable energy technologies. The cost reduction potentials for CSP lie mainly in expected technical research and development advances, and production economies of scale, achieved by high volume deployment, supported by mid-term investment incentives from governments and other agencies. Another cost reduction potential, especially in the South African context, lies in the localization of skills and local fabrication of some plant structures and components.
10
Messias, da Silva Menezes Junior Manoel. "Mapeando CSP em UML-RT." Universidade Federal de Pernambuco, 2008. https://repositorio.ufpe.br/handle/123456789/1723.
Full textAbstract:
Made available in DSpace on 2014-06-12T15:52:01Z (GMT). No. of bitstreams: 1
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2008A integração de métodos formais com notações semi-formais visuais é uma tendência em engenharia de software. Métodos formais apresentam uma semântica precisa e permitem verificação de propriedades. No entanto, não são considerados intuitivos. Por outro lado, notações semi-formais visuais, como UML, são facilmente integradas no processo de desenvolvimento de software. Assim, métodos formais e semi-formais visuais são complementares. CSP e UML-RT são, respectivamente, exemplos de notação formal e diagramática usados para especificar e projetar sistemas concorrentes e distribuídos. CSP é um método formal no qual processos representam unidades comportamentais que se comunicam através de canais de comunicação, utilizando passagem de mensagem. UML-RT é uma extensão conservativa de UML na qual cápsulas são unidades comportamentais que se comunicam através de portas de comunicação. Portas realizam protocolos os quais especificam os sinais que podem ser enviados e recebidos através de uma porta, e a ordem na qual os sinais podem ser comunicados. Em um trabalho anterior, Ferreira apresentou um conjunto de regras que sistematizam o mapeamento de CSP para UML-RT, mas uma prova formal deste mapeamento não foi apresentada. Assim, para garantir consistência no desenvolvimento de sistemas concorrentes e distribuídos utilizando este mapeamento, a prova formal do mesmo é indispensável, uma vez que não faz sentido o esforço dedicado à especificação do sistema em CSP e a verificação de propriedades e refinamentos, se uma ou mais regras de mapeamento estiverem incorretas. No entanto, UMLRT não possui uma semântica formal padrão. Entre outras propostas de semântica formal, Ramos propõe uma semântica para UML-RT utilizando OhCircus (uma combinação de CSP e Z com características adicionais de orientação a objetos) como modelo semântico. Neste trabalho, é proposta uma variação da semântica de Ramos para UML-RT usando CSP como modelo semântico. Com base nesta semântica, é apresentada a prova do mapeamento de CSP para UML-RT, considerando o modelo de falhas e divergências de CSP. Assim, este trabalho consolida a integração de CSP e UML-RT proposta por Ferreira, no desenvolvimento de sistemas críticos, concorrentes e distribuídos. Um resultado interessante foi observar que, estritamente, as regras propostas por Ferreira não preservam a semântica de CSP, essencialmente com relação a aspectos de terminação dos processos
11
Enrech, López Raquel. "Síntesis y estudio de nuevos agentes de solvatación quiral polifuncionales." Doctoral thesis, Universitat Autònoma de Barcelona, 2011. http://hdl.handle.net/10803/83970.
Full textAbstract:
La presente Tesis doctoral se centra en la separación enantioselectiva, desarrollando nuevos agentes de solvatación quiral (CSA) y nuevas fases estacionarias quirales (CSP).
En una primera parte de la Tesis se sintetizaron compuestos antracénicos trifuncionales como el 1,8,10-tribromoantraceno y 10-bromo-α,α’-bistrifluorometil-1,8-antracenedimetanol, que permiten la síntesis de CSAs trifuncionales o el anclaje a una fase estacionaria, para una posterior aplicación en HPLC quiral.
Otro apartado de esta Tesis se ha centrado en la síntesis de nuevos CSAs tipo pinza molecular, dónde se ha realizado un estudio estructural mediante RMN. Se han ensayado sus capacidades enantiodiferenciadoras con diferentes solutos, obteniendo resultados diversos y se han estudiado los complejos CSA-soluto formados. Se ha comprobado que en algunos de los casos, la rigidez del CSA no ha permitido realizar la función “pinza”, obteniendo pobres resultados en el enantioreconocimiento, pero en otros casos, hemos comprobado que el enantioreconocimiento es espectacular cuando el soluto contiene un grupo amino, y el CSA tiene o un grupo amino o nitro, permitiendo otro punto de interacción entre el CSA y el soluto. En estos casos, la estequiometria del complejo CSA:soluto es de 1:2, en vez de 1:1 como es lo habitual.
El último apartado de esta Tesis se ha centrado en la síntesis de nuevas fases estacionarias quirales (CSP) tipo Brush. El objetivo era preparar una CSP con terminaciones en pinza molecular. La primera CSP sintetizada no se consiguió obtener la terminación deseada, por eso se planteó preparar otra CSP que contuviera el CSA isoftalato de ABTE, quedándonos a un paso de su preparación completa.This thesis focuses on the enantioselective separation, developing new chiral solvating agents (CSA) and new chiral stationary phases (CSP). In the first part of the thesis, there were synthesized trifunctional compounds such as 1,8,10-tribromoanthracene and 10-bromo-α,α'-bistrifluorometyl-1,8-anthracenedimethanol, allowing the synthesis of trifunctional CSAs or anchor these compounds in stationary phases for a subsequent application in chiral HPLC. Another section of this thesis, the molecular tweezers were synthesized and characterized by NMR. Enantiodiscrimination capabilities have been tested with different solutes, obtaining different results. We also have studied the CSA-solute complexes formed. In some cases, the rigidity of the CSA has not permitted the tweezers function, obtaining poor results in chiral recognition, but in other cases, we found that this chiral recognition was spectacular when the solute contains an amino group and the CSA has a nitro or amino group, allowing another point of interaction between the CSA and solute. In these cases, the stoichiometry of the complex CSA:solute is 1:2 rather than 1:1 as usual. The last section of this thesis was focused on the synthesis of new chiral stationary phases (CSP) type Brush. The aim was to prepare a CSP with molecular tweezers terminations. The first CSP synthesized I didn’t achieve my goal, as it didn’t have tweezers terminations, so another CSP was prepared containing the ABTE isophthalate, staying one step away from full preparation.
12
Färnqvist, Tommy. "Exploiting Structure in CSP-related Problems." Doctoral thesis, Linköpings universitet, Programvara och system, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-85668.
Full textAbstract:
In this thesis we investigate the computational complexity and approximability of computational problems from the constraint satisfaction framework. An instance of a constraint satisfaction problem (CSP) has three components; a set V of variables, a set D of domain values, and a set of constraints C. The constraints specify a set of variables and associated local conditions on the domain values allowed for each variable, and the objective of a CSP is to assign domain values to the variables, subject to these constraints. The first main part of the thesis is concerned with studying restrictions on the structure induced by the constraints on the variables for different computational problems related to the CSP. In particular, we examine how to exploit various graph, and hypergraph, acyclicity measures from the literature to find classes of relational structures for which our computational problems become efficiently solvable. Among the problems studied are, such where, in addition to the constraints of a CSP, lists of allowed domain values for each variable are specified (LHom). We also study variants of the CSP where the objective is changed to: counting the number of possible assignments of domain values to the variables given the constraints of a CSP (#CSP), minimising or maximising the cost of an assignment satisfying all constraints given various different ways of assigning costs to assignments (MinHom, Max Sol, and CSP), or maximising the number of satisfied constraints (Max CSP). In several cases, our investigations uncover the largest known (or possible) classes of relational structures for which our problems are efficiently solvable. Moreover, we take a different view on our optimisation problems MinHom and VCSP; instead of considering fixed arbitrary values for some (hyper)graph acyclicity measure associated with the underlying CSP, we consider the problems parameterised by such measures in combination with other basic parameters such as domain size and maximum arity of constraints. In this way, we identify numerous combinations of the considered parameters which make these optimisation problems admit fixed-parameter algorithms. In the second part of the thesis, we explore the approximability properties of the (weighted) Max CSP problem for graphs. This is a problem which is known to be approximable within some constant ratio, but not believed to be approximable within an arbitrarily small constant ratio. Thus it is of interest to determine the best ratio within which the problem can be approximated, or at least give some bound on this constant. We introduce a novel method for studying approximation ratios which, in the context of Max CSP for graphs, takes the form of a new binary parameter on the space of all graphs. This parameter may, informally, be thought of as a sort of distance between two graphs; knowing the distance between two graphs, we can bound the approximation ratio of one of them, given a bound for the other.
13
Nordh, Gustav. "Complexity Dichotomies for CSP-related Problems." Doctoral thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8822.
Full text
14
Mukarram, Abida. "A refusal testing model for CSP." Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336115.
Full text
15
Chan, Wing-kwong, and 陳榮光. "Inheritance and OMT: a CSP approach." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1995. http://hub.hku.hk/bib/B29881328.
Full text
16
Lowe, Gavin. "Probabilities and priorities in timed CSP." Thesis, University of Oxford, 1993. http://ora.ox.ac.uk/objects/uuid:cfec28d9-aa50-46f3-a664-eb5fbe97b261.
Full text
17
Butler, Michael John. "A CSP approach to action systems." Thesis, University of Oxford, 1992. https://eprints.soton.ac.uk/250974/.
Full textAbstract:
The communicating sequential processes (CSP) formalism, introduced by Hoare, is an event-based approach to distributed computing. The action-system formalism, introduced by Back & Kurki-Suonio, is a state-based approach to distributed computing. Using weakest-precondition formulae, Morgan has defined a correspondence between action systems and the failures-divergences model for CSP. Simulation is a proof technique for showing refinement of action systems. Using the correspondence of Morgan, Woodcock & Morgan have shown that simulation is sound and complete in the CSP failures-divergences model. In this thesis, Morgan's correspondence is extended to the CSP infinite- traces model in order to deal more properly with unbounded nondeterminism. It is shown that simulation is sound in the infinite-traces model, though completeness is lost in certain cases. The new correspondence is then extended to include a notion of internal action. This allows the definition of a hiding operator for action systems that is shown to correspond to the CSP hiding operator. Rules for simulation steps involving internal actions are developed. A parallel operator for action systems is defined, in which interaction is based on synchronisation over shared actions. This operator is shown to correspond to the CSP parallel operator. The correspondence between action systems and CSP is extended again so that actions may have input and output parameters. This allows parallel action- systems to pass values on synchronisation. The original motivation for the work described in this thesis was the use of the action system formalism in the development of telecommunications systems, where interaction is often based on synchronised value-passing. The techniques developed here are applied to a series of case studies involving telecommunications-type systems. The techniques are used to refine and decompose abstract specifications of these systems into parallel sub-systems that interact via synchronised value-passing.
18
Deleau, Hervé. "Approches hybrides pour les problèmes CSP." Angers, 2005. http://www.theses.fr/2005ANGE0012.
Full textAbstract:
Cette thèse propose une approche hybride générique pour résoudre les problèmes de satisfaction de contraintes (CSP). Après avoir présenté les CSP et les méthodes couramment utilisées pour les résoudre, nous présentons notre approche, combinant des stratégies inspirées de la recherche arborescente et de la recherche locale. Le cadre unificateur est celui d'une population d'individus, lesquels correspondent, non pas à des solutions, mais à des sous-ensembles de l'espace de recherche. La propagation de contraintes et la découpe de domaines contribuent à réduire les individus à des sous-ensembles plus restreints; la recherche locale examine des solutions (appelées "points") dans un individu. Notre approche est évaluée expérimentalement sur un ensemble de problèmes. Enfin, nous proposons de nouvelles perspectives et adaptations possibles de notre approche sur d'autres types de problèmesIn this thesis, we propose a generic hybrid approach to solve Constraints Satisfaction Problems (CSP). After having presented the CSP and the methods usually used to solve them, we present our approach, combining strategies inspired of arborescent search and local search. The unifying framework is that of an individuals population, which correspond, with not solutions, but with subsets of the search space. The constraint propagation and the domain splitting contribute to reduce individuals to subsets more restricted. Local search examnines solutions in an individual. Our approach is experiments evaluated on a problems set. Lastly, we propose new prospects and possible adaptation of our approach on other problems types
19
Chan, Wing-kwong. "Inheritance and OMT : a CSP approach /." [Hong Kong] : University of Hong Kong, 1995. http://sunzi.lib.hku.hk/hkuto/record.jsp?B14786825.
Full text
20
Carlos, Maria da Graça de Oliveira. "Relação entre desempenho social (CSP) e desempenho financeiro (CFP) : estudo em painel com moderadores." Universidade de Fortaleza, 2016. http://dspace.unifor.br/handle/tede/103251.
Full textAbstract:
Made available in DSpace on 2019-03-29T23:51:06Z (GMT). No. of bitstreams: 0
Previous issue date: 2016-12-01The present study seeks answers to the following questions: How is the CSP-CFP relationship affected by the longevity of firms and their international insertion in countries of advanced economies? Thus, the study analyzes the moderating effect of ¿Firm Longevity¿ and its ¿International Insertion in Countries of Advanced Economies¿ in the CSP-CFP relationship. The study uses as lenses the theory of the firm and the theory of stakeholder; as well as theories Legitimacy, signaling and dissemination. The research approach is quantitative, longitudinal, retrospective and explanatory, using panel data and applied in the Companies listed on the Bovespa based on documentary data of socio-environmental and financial performance. We analyzed 237 firms from 2008 to 2015, in an amount of 1,659 observations treated in multiple linear regression in short panel, balanced and fixed effects. The main results showed that there is a relationship between social performance and financial performance of companies with a one-year lag (CSPt-1 - CFP), with emphasis on CSP measurement strategies represented by social auditing and corporate reputation, with a significant impact on Market value of firms in the following year. It was demonstrated the effect of the moderators tested, allowing to conclude that Firm Longevity moderates negatively and parsimoniously the relationship between corporate reputation and market value (CSP3t-1 - CFP) and does not interact with voluntary social disclosure (CSP1) nor With social audit (CSP2). The International Insertion of Firms in Countries with Advanced Economies negatively moderates the relationship between social disclosure and market value of firms in the following year (CSP1t-1 - CFP). This study brings as contributions the analysis of the CSP-CFP relationship over time (i.e., seven year period) and with tests of new moderators (i.e., Firm Longevity and Firm International Insertion in Advanced Economies Countries). Keywords: Social performance. Financial performance. CSP-CFP relationship. Corporate social performance.
O presente estudo busca respostas para as seguintes perguntas: Como a relação CSP-CFP é afetada pela longevidade das firmas e por sua inserção internacional em países de economias avançadas? Assim, o estudo analisa o efeito moderador da ¿Longevidade das Firmas¿ e da sua ¿Inserção Internacional em países de economias avançadas¿ na relação CSP-CFP. O trabalho utiliza como lentes a teoria da firma e a teoria do stakeholder, além das teorias da legitimidade, sinalização e da divulgação. A abordagem de pesquisa é quantitativa, longitudinal retrospectiva e explicativa, com uso de dados em painel e aplicada nas Cias listadas na Bovespa com base em dados documentais de desempenho socioambiental e financeiro. Foram analisadas 237 firmas de 2008 a 2015, num montante de 1.659 observações tratadas em regressão linear múltipla em painel curto, balanceado e de efeitos fixos. Os principais resultados demonstraram que há relacionamento entre desempenho social e desempenho financeiro das companhias com lag temporal de um ano (CSPt-1 ¿ CFP) com ênfase para as estratégias de mensuração do CSP representadas pela auditoria social e reputação corporativa, com impacto significativo sobre o valor de mercado das firmas no ano seguinte. Ficou demonstrado o efeito dos moderadores testados, permitindo concluir que a Longevidade das Firmas modera negativamente e parcimoniosamente o relacionamento entre a reputação corporativa e o valor de mercado (CSP3t-1 ¿ CFP) e não interage com a divulgação social voluntária (CSP1) e nem com a auditoria social (CSP2). A Inserção Internacional das Firmas em Países de Economias Avançadas modera negativamente a relação entre a divulgação social e o valor de mercado das firmas no ano seguinte (CSP1t-1 ¿ CFP). Este estudo traz como contribuições a análise da relação CSP-CFP ao longo do tempo (i.e., período de sete anos) e com testes de novos moderadores (i.e., Longevidade das Firmas e Inserção Internacional das Firmas em Países de Economias Avançadas). Palavra-chave: Desempenho social. Desempenho financeiro. Relação CSP-CFP. Corporate social performance.
21
Kanso, Hélène. "Résolution des problèmes (W)CSP et #CSP par approches structurelles : calcul et exploitation dynamique de décompositions arborescentes." Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0655.
Full textAbstract:
L’importance des problèmes CSP, WCSP et #CSP est reflétée par la part considérable des travaux, théoriques et pratiques, dont ils font l’objet en intelligence artificielle et bien au-delà. Leur difficulté est telle qu’ils appartiennent respectivement aux classes NP-complet, NP-difficile et #P-complet. Aussi, les méthodes qui permettent de résoudre efficacement leurs instances ont une complexité en temps exponentielle. Les travaux de recherche de cette thèse se focalisent sur les méthodes de résolution exploitant la notion de décomposition arborescente. Ces méthodes ont suscité un vif intérêt de la part de la communauté scientifique du fait qu’elles soient capables de résoudre en temps polynomial certaines classes d’instances. Cependant, en pratique, elles n’ont pas encore montré toute leur efficacité vu la qualité de la décomposition employée ne prenant en compte qu’un critère purement structurel, sa largeur. Premièrement, nous proposons un nouveau cadre général de calcul de décompositions qui a la vertu de calculer des décompositions qui capturent des paramètres plus pertinents à l’égard de la résolution que la seule largeur de la décomposition. Ensuite, nous proposons une exploitation dynamique de la décomposition pendant la résolution pour les problèmes (W)CSP. Le changement de la décomposition pendant la résolution vise à adapter la décomposition selon la nature de l’instance. Finalement, nous proposons un nouvel algorithme de comptage qui exploite la décomposition d’une façon différente de celle des méthodes standards afin d’éviter des calculs inutiles.L’ensemble des contributions ont été évaluées et validées expérimentalementThe importance of CSP, WCSP and #CSP problems is reflected by the considerableamount of theoretical and practical work of which they are subject in artificial intelligenceand far beyond. Their difficulty is such that they belong respectively to the NP-complete,NP-hard and #P-complete classes. Hence, the methods that are able to solve efficientlytheir instances have a complexity in exponential time. The research works of this thesisfocus on the solving methods exploiting the notion of tree-decomposition. These methodshave aroused a keen interest from the scientific community because they are able to solvesome classes of instances in polynomial time. Nevertheless, in practice, they have notshown yet their full efficiency given the quality of the used decomposition that takes onlyinto account a purely structural criterion, its width. First, we propose a new generic framework for computing decompositions which has the virtue of computing decompositionsthat capture more relevant parameters in the context of solving than the width. Then,we propose a dynamic exploitation of the decomposition during the solving for (W)CSPproblems. The modification of the decomposition during the solving aims to adapt the decomposition to the nature of the instance. Finally, we propose a new counting algorithmthat exploits the decomposition in a different way than standard methods in order toavoid unnecessary computations. All the contributions have been evaluated and validatedexperimentally
22
Kleis, Michael. "CSP, cooperative service provisioning using peer-to-peer principles." München Chair for Network Architectures and Services, TUM, 2009. http://d-nb.info/999943871/34.
Full text
23
Fontaine, Marc [Verfasser]. "Ein Modelchecker für CSP-M / Marc Fontaine." Düsseldorf : Universitäts- und Landesbibliothek der Heinrich-Heine-Universität Düsseldorf, 2012. http://d-nb.info/1018985085/34.
Full text
24
Moore, Neil C. A. "Improving the efficiency of learning CSP solvers." Thesis, University of St Andrews, 2011. http://hdl.handle.net/10023/2100.
Full textAbstract:
Backtracking CSP solvers provide a powerful framework for search and reasoning. The aim of constraint learning is increase global reasoning power by learning new constraints to boost reasoning and hopefully reduce search effort. In this thesis constraint learning is developed in several ways to make it faster and more powerful. First, lazy explanation generation is introduced, where explanations are generated as needed rather than continuously during propagation. This technique is shown to be effective is reducing the number of explanations generated substantially and consequently reducing the amount of time taken to complete a search, over a wide selection of benchmarks. Second, a series of experiments are undertaken investigating constraint forgetting, where constraints are discarded to avoid time and space costs associated with learning new constraints becoming too large. A major empirical investigation into the overheads introduced by unbounded constraint learning in CSP is conducted. This is the first such study in either CSP or SAT. Two significant results are obtained. The first is that typically a small percentage of learnt constraints do most propagation. While this is conventional wisdom, it has not previously been the subject of empirical study. The second is that even constraints that do no effective propagation can incur significant time overheads. Finally, the use of forgetting techniques from the literature is shown to significantly improve the performance of modern learning CSP solvers, contradicting some previous research. Finally, learning is generalised to use disjunctions of arbitrary constraints, where before only disjunctions of assignments and disassignments have been used in practice (g-nogood learning). The details of the implementation undertaken show that major gains in expressivity are available, and this is confirmed by a proof that it can save an exponential amount of search in practice compared with g-nogood learning. Experiments demonstrate the promise of the technique.
25
Asthana, Rohit Mohan. "High-Level CSP Model Compiler for FPGAs." Thesis, Virginia Tech, 2010. http://hdl.handle.net/10919/36428.
Full textAbstract:
The ever-growing competition in current electronics industry has resulted in stringent time-to-market goals and reduced design time available to engineers. Lesser design time has subsequently raised a need for high-level synthesis design methodologies that raise the design to a higher level of abstraction. Higher level of abstraction helps in increasing the predictability and productivity of the design and reduce the number of bugs due to human-error. It also enables the designer to try out dierent optimization strategies early in the design stage. In-spite of all these advantages, high-level synthesis design methodologies have not gained much popularity in the mainstream design flow mainly because of the reasons like lack of readability and reliability of the generated register transfer level (RTL) code. The compiler framework presented in this thesis allows the user to draw high-level graphical models of the system. The compiler translates these models into synthesizeable RTL Verilog designs that exhibit their desired functionality following
communicating sequential processes (CSP) model of computation. CSP model of computation introduces a good handshaking mechanism between different components in the design that makes designs less prone to timing violations during implementation and bottlenecks while in actual operation.Master of Science
26
CAGNOLI, MATTIA. "Analysis of thermal losses for CSP applications." Doctoral thesis, Politecnico di Torino, 2019. http://hdl.handle.net/11583/2755757.
Full text
27
Eriksson, Olof. "Techno Economic Analysis of Reverse Osmosis Combined with CSP + PV in Kuwait." Thesis, Högskolan Dalarna, Energiteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:du-34521.
Full textAbstract:
Seawater desalination plays an important role when fighting the freshwater scarcity that many places around the world are currently facing. The increasing need for desalinated water is followed by a high energy demand. It is therefore essential that an expansion of desalination capacity is accompanied by a parallel use of renewable energy sources in this process. This thesis presents a techno-economic study on a reverse osmosis (RO) desalination plant, with a nominal power consumption of 15 MW, that is powered by a concentrated solar power (CSP) plant combined with a photovoltaic (PV) power plant, in Kuwait. The main aim of this thesis was to find which system designs would give the lowest global warming potential and levelized cost of the desalinated water. In addition, it has been investigated how electricity price and emission allowance cost could make a solar power plant competitive to the grid. For this purpose, some components in the whole system were simulated using System Advisor Model and Engineering Equation Solver. With the results obtained from the simulations, a dynamic model of the whole system was developed in MATLAB, Simulink where simulations were done for a typical meteorological year in Shagaya, Kuwait. Both on-grid and off-grid systems were considered. In the on-grid case, the lowest cost of water was obtained with only PV (ca 0.65 USD/m3) and this could reduce carbon emissions by 30 % compared to only using the grid. Combining CSP and PV could reduce the carbon emissions by 85 % but with a 35 % increase in water cost. It was found that an electricity price of 0.1 USD/kWh or an emission allowance cost of 70 USD/tCO2-eq would make a CSP + PV plant competitive to the grid. These results indicate that the choice of which system is best for powering an on-grid RO plant depends on how the environmental and economic factors are prioritised. In the case of the off-grid system, both the lowest cost of water (ca 0.9 USD/m3) and the highest capacity factor were obtained with a CSP + PV plant with 16 h of storage, a solar multiple of 3 and a PV capacity of 28 MW.
28
Åkerberg, Emma, and Moberg Sara Abrahamsen. "Är autenticitet nyckeln till lönsam CSR? : En kvantitativ studie på 525 publika bolag under en tioårsperiod." Thesis, Högskolan i Gävle, Företagsekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-24215.
Full textAbstract:
Syfte: Syftet med studien är att undersöka om autentisk CSR leder till större lönsamhet än opportunistisk CSR. Metod: I föreliggande studie antas en positivistisk forskningsfilosofi med en hypotetisk-deduktiv ansats. Studien är kvantitativ och sekundärdata har samlats in från databasen Thomson Reuters Datastream. En longitudinell design har använts där data som sträcker sig över tio år har inhämtats för studiens urval om 525 publika bolag, inhämtad data har analyserats statistiskt. Resultat & slutsats: Studiens resultat visar att en positiv relation mellan CSR och finansiell prestation föreligger. Av studien framgår även att autentisk CSR kan ha större påverkan på det finansiella resultatet än opportunistiskt beroende på vilka variabler för autenticitet som används. Förslag till fortsatt forskning: Föreliggande studie är av longitudinell design och sträcker sig över tio år. En studie som undersöker en kortare period kan vara intressant för vidare forskning då detta kan innebära ett större urval av bolag. Forskning som vidareutvecklar begreppet autenticitet och autentisk CSR konceptuellt och hur detta kan mätas är även något som vidare forskning kan fokusera på. Uppsatsens bidrag: Ur ett teoretiskt perspektiv bidrar studien till redovisningslitteraturen genom att diskutera om autentisk CSR leder till bättre finansiell prestation, via genomförda mätningar avseende autenticitet i relation till CSR och utvecklingen av hur detta kan operationaliseras. Ur ett praktiskt perspektiv bidrar föreliggande studie till ökad förståelse för företag om vikten av att verka autentiskt i sitt CSR-arbete.Aim: The aim of this study is to investigate whether authentic CSR leads to greater profitability than opportunistic CSR. Method: In this study, a positivistic researchphilosophy is assumed with a hypothetical deductive approach. The study is quantitative and secondary data has beencollected from the Thomson Reuters Datastream. A longitudinal design has been used where data covering ten years has been obtained for the study's selection of 525 public companies, collected data has been statistically analyzed. Result & Conclusions: The results show that when a company pursues authentic CSR the positive effect of its CSR initiatives on company performance is stronger than for those who pursues opportunistic CSR, however the result depends on the variables used to measure authenticity. Suggestions for future research: The present study is of longitudinal design and extends over ten years. A study that examines a shorter period may be interesting for further research as this may obtain a larger selection of companies. Research that further develops the concept of authenticity and authentic CSR conceptually and how this can be measured is also something that further research can focus on. Contribution of the thesis: From a theoretical perspective this study contributes to the accounting literature by discussing whether authentic CSR leads to better financial performance, as well as through completed measurements regarding authenticity in relation to CSR and the development of how this can be operationalized. From a practical perspective, the present study contributes to increased understanding for companies about the importance of acting authentically in their CSR work.
29
Monier, Pierre. "DBS multi-variables pour des problèmes de coordination multi-agents." Phd thesis, Université de Valenciennes et du Hainaut-Cambresis, 2012. http://tel.archives-ouvertes.fr/tel-00716275.
Full textAbstract:
Le formalisme CSP (Problème de Satisfaction de Contraintes) permet de représenter de nombreux problèmes de manière simple et efficace. Cependant, une partie de ces problèmes ne peut être résolue de manière classique et centralisée. Les causes peuvent être diverses : temps de rapatriement des données prohibitif, sécurité des données non garantie, etc. Les CSP Distribués(DisCSP), domaine intersectant celui des SMA et des CSP, permettent de modéliser et de résoudre ces problèmes naturellement distribués. Les raisonnements intra-agent et inter-agents sont alors basés sur un ensemble de relations entre différentes variables. Les agents interagissent afin de construire une solution globale à partir des solutions locales. Nous proposons, dans ce travail, un algorithme de résolution de DisCSP nommé Distributed Backtracking with Sessions (DBS) permettant de résoudre des DisCSP où chaque agent dispose d'un problème local complexe. DBS a la particularité de ne pas utiliser de nogoods comme la majorité des algorithmes de résolution de DisCSP mais d'utiliser à la place des sessions. Ces sessions sont des nombres permettant d'attribuer un contexte à chaque agent ainsi qu'à chaque message échangé durant la résolution du problème. Il s'agit d'un algorithme complet permettant l'utilisation de filtres sur les messages échangés sans remettre en cause la preuvede complétude. Notre proposition est évaluée, dans les cas mono-variable et multi-variables par agents, sur différents benchmarks classiques (les problèmes de coloration de graphes distribués et les DisCSP aléatoires) ainsi que sur un problème d'exploration en environnement inconnu.
30
Rohrmair, Gordon Thomas. "Use of CSP to verify security-critical applications." Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433325.
Full text
31
Scattergood, Bryan. "The semantics and implementation of machine-readable CSP." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299037.
Full text
32
Böttcher, Jörg [Verfasser]. "Möglichkeiten einer Projektfinanzierung bei CSP-Vorhaben / Jörg Böttcher." Frankfurt : Peter Lang GmbH, Internationaler Verlag der Wissenschaften, 2013. http://d-nb.info/1042408742/34.
Full text
33
Fonseca, Felipe de Freitas. "Um estudo do campo popular na CSP-Conlutas." Universidade Federal de Juiz de Fora (UFJF), 2017. https://repositorio.ufjf.br/jspui/handle/ufjf/5814.
Full textAbstract:
Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-09-27T12:20:13Z
No. of bitstreams: 1
felipedefreitasfonseca.pdf: 1431342 bytes, checksum: b363be3713c64bee0af77b9414f7632f (MD5)Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-09-27T13:43:20Z (GMT) No. of bitstreams: 1 felipedefreitasfonseca.pdf: 1431342 bytes, checksum: b363be3713c64bee0af77b9414f7632f (MD5)
Made available in DSpace on 2017-09-27T13:43:20Z (GMT). No. of bitstreams: 1 felipedefreitasfonseca.pdf: 1431342 bytes, checksum: b363be3713c64bee0af77b9414f7632f (MD5) Previous issue date: 2017
A conjuntura nacional pós anos 2000 se apresenta como momento de reorganização e rearticulação das organizações dos trabalhadores, notadamente no campo sindical. A CUT, que surge com o “novo sindicalismo” no final dos 1970 e que cumpriu importante papel na mobilização e organização trabalhadores numa perspectiva sindical crítica, classista e autônoma passa a evidenciar, já na década de 1990, transformações em suas práticas, concepções e políticas na direção da conciliação de classes e de um sindicalismo cidadão. Os grupos internos contrários a este descenso político e ideológico posto pela direção majoritária da Central concluem o processo de ruptura interna no primeiro governo petista, no qual o se evidencia, com força, os elementos conciliatórios e governistas nas ações da CUT. É neste contexto que surge, em 2004, uma Coordenação Nacional de Lutas que resultou, posteriormente, na consolidação da Central Sindical e Popular - CSP-Conlutas, cujo um dos principais objetivos é apresentar uma nova concepção de organização e atuação de Central, de modo a atuar, também, junto aos movimentos sociais dos trabalhadores para além do campo sindical. É esta concepção de Central que será o foco da nossa análise neste trabalho. Nosso objetivo é apreender a dinâmica de incorporação dos movimentos populares (urbanos e rurais) e de luta contra as opressões, inédita em uma Central Sindical nacional, avaliando suas características, suas agendas de lutas e seus rebatimentos na construção das ações político-interventivas da CSP-Conlutas.
The national conjuncture after the years 2000 presents itself as a moment of reorganization and rearticulation of workers' organizations, especially in the trade union field. The CUT, which emerged with the "new syndicalism" in the late 1970s and which fulfilled an important role in the mobilization and organization of workers in a critical, classist and autonomous trade union perspective began to show, as early as the 1990s, transformations in their practices, conceptions and Policies in the direction of class reconciliation and citizen unionism. The internal groups opposed to this political and ideological descent by the majority direction of the Central conclude the process of internal rupture in the first PT government, in which the conciliatory and governmental elements in the actions of the CUT are strongly evidenced. It is in this context that a National Coordination of Struggles emerged in 2004 that resulted in the consolidation of the CSP-Conlutas, one of the main objectives of which is to present a new conception of Central organization and To act, also, with the social movements of the workers beyond the trade union field. It is this conception of Central that will be the focus of our analysis in this work. Our aim is to understand the dynamics of incorporation of popular movements (urban and rural) and struggle against oppression, unprecedented in a national trade union center, evaluating its characteristics, its agendas of struggles and its refutations in the construction of political-intervention actions of CSP -Conlutas.
34
Ripon, Shamim. "Extending and relating semantic models of compensating CSP." Thesis, University of Southampton, 2008. https://eprints.soton.ac.uk/266584/.
Full textAbstract:
Business transactions involve multiple partners coordinating and interacting with each other. These transactions have hierarchies of activities which need to be orchestrated. Usual database approaches (e.g.,checkpoint, rollback) are not applicable to handle faults in a long running transaction due to interaction with multiple partners. The compensation mechanism handles faults that can arise in a long running transaction. Based on the framework of Hoare's CSP process algebra, Butler et al introduced Compensating CSP (cCSP), a language to model long-running transactions. The language introduces a method to declare a transaction as a process and it has constructs for orchestration of compensation. Butler et al also defines a trace semantics for cCSP. In this thesis, the semantic models of compensating CSP are extended by defining an operational semantics, describing how the state of a program changes during its execution. The semantics is encoded into Prolog to animate the specification. The semantic models are further extended to define the synchronisation of processes. The notion of partial behaviour is defined to model the behaviour of deadlock that arises during process synchronisation. A correspondence relationship is then defined between the semantic models and proved by using structural induction. Proving the correspondence means that any of the presentation can be accepted as a primary definition of the meaning of the language and each definition can be used correctly at different times, and for different purposes. The semantic models and their relationships are mechanised by using the theorem prover PVS. The semantic models are embedded in PVS by using Shallow embedding. The relationships between semantic models are proved by mutual structural induction. The mechanisation overcomes the problems in hand proofs and improves the scalability of the approach.
35
Kahsai, Temesghen. "Property preserving development and testing for CSP-CASL." Thesis, Swansea University, 2009. https://cronfa.swan.ac.uk/Record/cronfa42217.
Full textAbstract:
This thesis describes a theoretical study and an industrial application in the area of formal systems development, verification and formal testing using the specification language CSP-CASL. The latter is a comprehensive specification language which allows to describe systems in a combined algebraic / process algebraic notation. To this end it integrates the process algebra CSP and the algebraic specification language CASL. In this thesis we propose various formal development notions for CSP-CASL capable of capturing informal vertical and horizontal software development which we typically find in industrial applications. We provide proof techniques for such development notions and verification methodologies to prove interesting properties of reactive systems. We also propose a theoretical framework for formal testing from CSP-CASL specifications. Here, we present a conformance relation between a physical system and a CSP-C ASL specification. In particular we study the relationship between CSP-CASL development notions and the implemented system. The proposed theoretical notions of formal system development, property verification and formal testing for CSP-CASL, have been successfully applied to two industrial application: an electronic payment system called EP2 and the starting system of the BR725 Rolls- Royce jet engine control software.
36
Mazur, Tomasz Krzysztof. "Model Checking Systems with Replicated Components using CSP." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:6694fac7-00b4-4b25-b054-813d7a6a4cdb.
Full textAbstract:
The Parameterised Model Checking Problem asks whether an implementation Impl(t) satisfies a specification Spec(t) for all instantiations of parameter t. In general, t can determine numerous entities: the number of processes used in a network, the type of data, the capacities of buffers, etc. The main theme of this thesis is automation of uniform verification of a subclass of PMCP with the parameter of the first kind, using techniques based on counter abstraction. Counter abstraction works by counting how many, rather than which, node processes are in a given state: for nodes with k local states, an abstract state (c(1), ..., c(k)) models a global state where c(i) processes are in the i-th state. We then use a threshold function z to cap the values of each counter. If for some i, counter c(i) reaches its threshold, z(i) , then this is interpreted as there being z(i) or more nodes in the i-th state. The addition of thresholds makes abstract models independent of the instantiation of the parameter. We adapt standard counter abstraction techniques to concurrent reactive systems modelled using the CSP process algebra. We demonstrate how to produce abstract models of systems that do not use node identifiers (i.e. where all nodes are indistinguishable). Every such abstraction is, by construction, refined by all instantiations of the implementation. If the abstract model satisfies the specification, then a positive answer to the particular uniform verification problem can be deduced. We show that by adding node identifiers we make the uniform verification problem undecidable. We demonstrate a sound abstraction method that extends standard counter abstraction techniques to systems that make full use of node identifiers (in specifications and implementations). However, on its own, the method is not enough to give the answer to verification problems for all parameter instantiations. This issue has led us to the development of a type reduction theory, which, for a given verification problem, establishes a function phi that maps all (sufficiently large) instantiations T of the parameter to some fixed type T and allows us to deduce that if Spec(T) is refined by phi(Impl(T)), then Spec(T) is refined by Impl(T). We can then combine this with our extended counter abstraction techniques and conclude that if the abstract model satisfies Spec(T), then the answer to the uniform verification problem is positive. We develop a symbolic operational semantics for CSP processes that satisfy certain normality requirements and we provide a set of translation rules that allow us to concretise symbolic transition graphs. The type reduction theory relies heavily on these results. One of the main advantages of our symbolic operational semantics and the type reduction theory is their generality, which makes them applicable in other settings and allows the theory to be combined with abstraction methods other than those used in this thesis. Finally, we present TomCAT, a tool that automates the construction of counter abstraction models and we demonstrate how our results apply in practice.
37
Moffat, Nicholas. "Identifying and exploiting symmetry for CSP refinement checking." Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711620.
Full text
38
Iyer, Satyanarayan Shivkumar. "Assembly, reliability, and rework of stacked CSP components." Diss., Online access via UMI:, 2008.
Find full textAbstract:
Thesis (Ph. D.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2008.Includes bibliographical references.
39
Vesterberg, Iris, and Sofia Westerlund. "Hybridization with CSP in a Cuban sugar mill." Thesis, KTH, Energiteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233214.
Full textAbstract:
Kuba har i dagsläget ett högt beroende av importerad olja, för att tillgodose sin växande efterfrågan på elektricitet. Importen sker främst från Venezuela. Detta beroende gör Kuba känsligt för ändringar i oljepriser samt det politiska klimatet. Den nuvarande krisen i Venezuela har haft en betydande inverkan på Kubas elproduktion. Genom att utöka landets förnybara energikällor kan Kuba minska sitt beroende av andra länder och diversifiera sin energiförsörjning. Detta kommer även att leda till en positiv miljöpåverkan då landets CO 2-utsläpp minskar. Kubas geografiska läge har ideala förhållanden för förnyelsebar energigenerering, så som solkraft. Solkraft utvecklas konstant och innehåller en hög potential. Concentrating Solar Power (CSP) är en teknologi där speglar och/eller linser används för att koncentrera solljus till en liten yta som konverterar solljuset till värme. Denna värme kan sedan användas i termodynamiska cykler. Det finns två huvudsakliga problem med implementering av CSP på Kuba. För det första är CSP beroende av momentana väderförhållanden, vilket leder till en oregelbunden elproduktion. För det andra har CSP höga investeringskostnader. För att adressera dessa problem, är det möjligt att implementera CSP i ett redan existerande kraftverk med regelbunden energikälla, d.v.s. skapa ett hybridkraftverk. På så vis uppnås regelbunden elproduktion med signifikant lägre investeringskostnad. Ett sådant existerande kraftverk kan hittas hos många av Kubas sockerbruk. Den här studien undersöker möjligheten att implementera solkraft i sockerbruket Carlos Baliño, beläget i Villa Clara, Kuba. Fabriken är självförsörjande av elektricitet på årlig basis. De använder en Rankine-cykel för att generera el och processvärme som används i sockerframställningen. Bränslet som används är bagasse, en restprodukt efter att sockerjuicen pressats ut ur sockerrören. Fyra CSP-teknologier och tre implementeringslayouts undersöktes, vilket resulterade i att parabolic trough-teknologin och förvärmning av vatten ansågs vara de bästa alternativen för Kuba och Carlos Baliño. Vidare undersöktes två olika scenarier för CSP. Scenario 1 innefattar implementering av CSP i sockerbruket under rådande skick och Scenario 2 består av implementering av CSP efter en investering gjorts i en Condensing Extraction turbin (CEST). Resultatet visar att Carlos Baliño bör investera i CEST innan de implementerar CSP, det vill säga Scenario 2. Detta beror på att i scenario 1 är det inte möjligt att generera elektricitet utanför sockersäsongen, vilket leder till att en stor del av solpotentialen inte kan utnyttjas. Den maximala investeringskostnaden för scenario 1 är 3,7 MUSD, vilket inte är en realistisk kostnad. Den maximala investeringskostnaden för scenario 2 beror av tillgänglig bagasseimport och är 5,9 – 7,2 MUSD. Att investera i CSP rekommenderas ej om bagasseimporten är obegränsad. Givet att bagasseimporten är begränsad skulle CSP-implementeringen leda till en utökad elproduktion av 5,4 – 7,2 GWh/år, en årlig minskning av oljeanvändandet med 16 100 – 21 800 tunnor och minskade CO2-utsläpp med 12 00-16 00 ton årligen. Carlos Baliños ekonomiska resultat skulle öka med 0,5 MUSD/år och den kubanska statens med 0,7 – 0,9 MUSD/år. Framtida studier rekommenderas undersöka möjligheten till generering av el året runt vid Carlos Baliño utan en CEST, solkraftsefterfrågan på nationell nivå och potentiella utvecklingar av solkraft hos Carlos Baliño.Cuba is currently highly dependent on imported oil, mainly from Venezuela, to meet their growing electricity demand. This dependence makes Cuba sensitive to changes in oil price as well as the political climate. The current crisis in Venezuela has a large impact on Cuba’s electricity generation. By expanding its renewable energy sources Cuba could decrease their dependence on other countries and diversify their energy supply. Moreover, it would have a positive climate impact by reducing the country’s CO2-emissions. Geographically, Cuba has ideal conditions for renewable energy utilization, such as solar power. Solar energy is constantly progressing and is considered a great source of energy. Concentrating Solar Power (CSP) is a technology which applies mirrors and/or lenses to concentrate the sunlight onto a small area which converts the sunlight into heat, possible to use in a thermodynamic cycle. There are mainly two problems with the implementation of CSP in Cuba. Firstly, CSP is a non-dispatchable power generating system since it is dependent on the instantaneous weather conditions. Secondly, it has high investment costs. One way of solving these problems is by implementation CSP in an already existing power plants with a dispatchable source of energy, making it a hybrid power plant. Accordingly, the hybrid power plant would be dispatchable and the investment costs would be significantly lower. Existing power plants can be found in Cuban sugar mills. This study investigates the possibility to implement solar power in the sugar mill Carlos Baliño, located in Villa Clara, Cuba. The factory is currently self-sufficient electricity wise on a yearly basis, using a co-generation Rankine cycle to generate electricity and process heat used in the sugar production. The fuel used is bagasse, a rest product obtained after the sugar juice has been pressed out of the sugar canes. Four CSP-technologies and three implementation layouts were examined, resulting in the parabolic trough-technology and feedwater heating being considered the optimal solution. Furthermore, two different scenarios for CSP was investigated; implementation of CSP in the mill at the current state (scenario 1) or after investing in a Condensing-Extraction Turbine (CEST) (scenario 2). The results show that Carlos Baliño should invest in a CEST before considering implementation of CSP. Off-season operation is not available for scenario 1, leading to a vast amount of solar potential being unexploited. The maximal investment allowed for scenario 1 is 3.7 MUSD, which is not a realistic number. The maximal investment allowed for in scenario 2 is 5.9 – 7.2 MUSD, depending on bagasse import availability. If bagasse import is unlimited, it is not recommended to invest in solar power. Implementation of CSP in scenario 2 regarding bagasse import limits would yearly lead to an additional electricity generation at Carlos Baliño of 5.4 – 7.3 GWh, decrease the oil usage with 16,100 – 21,800 barrels and the CO2-emissons with 1,200 – 1,600 tonnes. Carlos Baliño’s annual yield would increase with 0.5 – 0.6 MUSD/year and the Cuban states annual yield would increase with 0.7 – 0.9 MUSD/year. Future work is recommended to explore alternatives to all year-around electricity generation in Carlos Baliño without investing in a CEST, investigate solar power demand on a national level, and examine possible developments of the suggested solar field, for instance solar-only operation.
40
DAMASCENO, Adriana Carla. "Geração mecanizada de abstrações seguras para especificações CSP." Universidade Federal de Pernambuco, 2008. https://repositorio.ufpe.br/handle/123456789/1471.
Full textAbstract:
Made available in DSpace on 2014-06-12T15:50:21Z (GMT). No. of bitstreams: 1
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2008Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Com a crescente demanda por diminuição de custos no desenvolvimento de software, há a necessidade de que os programas possam ser construídos de acordo com uma especificação concordante com os requisitos do cliente. Nesse sentido, a especificação formal pode ser utilizada para representar os requisitos do sistema. Uma vez que a especificação formal foi desenvolvida, ela pode ser usada como base para investigar determinadas propriedades através de um verificador de modelos. Ele aceita modelos e propriedades que o sistema final deve satisfazer. Então, a ferramenta gera uma resposta positiva se um dado modelo satisfaz uma dada especificação ou um contra-exemplo, em caso negativo. O contra-exemplo detalha a situação em que o modelo não foi satisfeito. Mas na maioria das vezes, problemas do mundo real não podem adotar essa abordagem porque usam domínios infinitos (levando ao problema da explosão de estados). Como forma de resolver essa questão, técnicas de abstração de dados são empregadas para gerar especificações abstratas finitas a partir de sistemas infinitos concretos. A linguagem de especificação usada nesse trabalho é CSP (Communicating Sequential Processes). Ela é uma linguagem formal que é usada para descrever padrões de interação em sistemas concorrentes. Uma das técnicas de abstração para especificações possíveis para essa linguagem é a abstração segura de dados. Essa abstração visa gerar um modelo abstrato a partir de um equivalente concreto que conserve as propriedades do sistema com respeito ao comportamento (modelo de traces) através da escolha de um dado do domínio abstrato para cada subconjunto do domínio concreto. O objetivo desse trabalho é propor um algoritmo para geração mecanizada de abstrações seguras para sistemas CSP seqüenciais com recursão simples. A especificação do algoritmo é apresentada usando o paradigma funcional e elementos da linguagem Z, com a introdução da estratégia através de exemplos. No estudo de caso, o software Mathematica é usado para instanciar os valores das variáveis e realizar a simplificação dos predicados construídos a partir desse algoritmo. Com esse trabalho, é possível gerar abstrações seguras de forma mecânica, e por conseqüência verificar o comportamento de modelos infinitos. Ademais, a geração de dados de testes automática também é beneficiada, já que com o domínio abstrato dos dados é possível percorrer todos os caminhos do sistema, gerando 100% de cobertura do modelo. Esse esforço é justificado pela importância que a fase de testes tem para a qualidade do software. Estudos prévios mostraram que essa fase demanda mais de 50% do custo de seu desenvolvimento, e uma pesquisa detalhada realizada nos Estados Unidos quantifica os altos impactos econômicos de uma infra-estrutura de software
41
Cabrera, Hallberg Daniel, and Jonathan Salmonsson. "Sambandet mellan företags sociala ansvarstagande och lönsamhet : En kvantitativ studie om sambandet mellan den sociala och finansiella prestationen." Thesis, Högskolan i Gävle, Avdelningen för ekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-23431.
Full textAbstract:
Syfte: Syftet med studien är att utreda om det finns något samband mellan företags finansiella prestation och hur företagen betygsätts utifrån deras engagemang i aktiviteter som rör företagens sociala ansvarstaganden. Metod: Denna studie har utifrån en positivistisk forskningsfilosofi antagit en deduktiv ansats med hypoteser samt en kvantitativ forskningsdesign med en paneldatametod i form av tvärsnittsdesign. Denna typ av forskningsdesign användes för att samla in sekundärdata från flera år. Studiens population uppgår till 171 företag och urvalet till 130 börsnoterade företag på Stockholmsbörsen. Sekundärdata för CSP för år 2009 till 2013 hämtades från Folksam Index för ansvarsfullt företagande. Sekundärdata för finansiell prestation hämtades från årsredovisningar från Retriever och Datastream. Analysering av all sekundärdata gjordes utifrån deskriptiv statistik och multipla regressionsanalyser i statistikprogrammet SPSS. Resultat och slutsats: Studiens resultat indikerar på att sambandet mellan CSP och CFP är signifikant negativt när Tobin´s Q avser CFP. Detta innebär att företagens marknadsvärde tenderar till att minska när deras sociala prestation ökar. Vidare gällande ROA finner studien inget signifikant samband mellan CSP och CFP. En antydan på ett svagt positivt samband ges dock, om än utan någon signifikans. Resultaten kan förklaras med hjälp av teorier såsom intressentteorin samt den institutionella teorin. Förslag till vidare forskning: Efter det nya EU-direktivet trätt i kraft och applicerats under en period är ett förslag att undersöka effekterna av detta direktiv. Vidare vore det intressant att utföra en undersökning som analyserar och jämför förändringar över de enskilda åren då denna studie endast använt sig av ett genomsnittsvärde för alla variabler under åren 2009 till 2013. Det vore även intressant att undersöka om de branscher som enligt Folksam (2013) löper de största verksamhetsriskerna angående hållbarheten också ökar sin sociala prestation över åren. Vidare bör dessa branscher även undersökas för att se varför vissa branscher uppvisar ett signifikant samband där andra branscher saknar detta samband. Uppsatsens bidrag: Utifrån denna studie får berörda parter ett teoretiskt bidrag som visar en ny mätmetod och ett annat perspektiv på sambandet mellan social- och finansiell prestation, jämfört med tidigare forskning. Studien öppnar även upp ett forskningsområde för undersökning av branscher och varför vissa branscher uppvisar ett signifikant samband där andra branscher saknar detta samband. Det praktiska bidraget i denna studie ger en fingervisning om hur det finansiella resultatet kan komma att påverkas med en högre grad av hållbarhetsarbete för att möta det nya EU-direktivet.Purpose: The purpose of this study is to investigate the relationship between companies’ financial performance and how the companies are rated on their involvement in Corporate Social Responsibility-activities. Method: This study, based on a positivist research philosophy, adopted a deductive approach with hypothesis testing and a quantitative research design with a panel-data method in the form of a cross-sectional design. This type of research design was used to collect secondary data from several years. The study population amounts to 171 companies while the sample amounts up to 130 listed companies on the Stockholm Stock Exchange. Secondary data for CSP for the year 2009 until 2013 was retrieved from Folksam Corporate responsibility index for each year. Secondary data for the financial performance was retrieved from Retriever and Datastream databases. In addition, analysis of all the collected secondary data was based on descriptive statistics and multiple regression analysis in SPSS. Results and Conclusions: The study’s results indicate that the relationship between CSP and CFP are significantly negative when Tobin’s Q refers to CFP. This means that the companies’ market value tends to decrease as their social performance increases. Furthermore, this study doesn’t find any significant relationship between CSP and ROA as CFP. An indication of a weak positive relationship is provided, however, albeit with no significance. The result can be explained by theories as stakeholder theory and institutional theory. Suggestions for further research: A suggestion is to examine the effects of the relationship of CSP and CFP after the EU directive comes into force. Furthermore, it would be interesting to conduct a study which analyzes and compares the changes over the individual years since this study only adopted an average value for all the variables during the years 2009 until 2013. It would also be interesting to investigate whether the industries according to Folksam (2013) runs the biggest business risks relating to sustainability is also increasing its social performance over the years. Furthermore, these industries should also be examined to see why some industries show a significant correlation where other industries lack this connection. Contributions of the thesis: Based on this study, concerned parties receives a theoretical contribution that shows a new measuring method and another perspective on the relationship of social- and financial performance, compared to previous research. This study also opens a field of research for the study of industries and why some industries show a significant correlation where other industries lack this correlation. The practical contribution in this study gives an indication of how the financial result may be affected by a higher degree of sustainability efforts to meet the new EU directive.
42
Kleine, Moritz Verfasser], and Stefan [Akademischer Betreuer] [Jähnichen. "CSP as a Coordination Language : a CSP-based Approach to the Coordination of Concurrent Systems [[Elektronische Ressource]] / Moritz Kleine. Betreuer: Stefan Jähnichen." Berlin : Universitätsbibliothek der Technischen Universität Berlin, 2011. http://d-nb.info/101653339X/34.
Full text
43
Richoux, Florian. "Toward a complexity classification of CSP through kernel widthVers une caractérisation de la complexité des CSP à travers la largeur des kernels." Palaiseau, Ecole polytechnique, 2009. http://pastel.paristech.org/5564/01/memoire_submitted.pdf.
Full textAbstract:
Constraint Satisfaction Problems (CSP) constitute a universal formalism allowing to modelize a huge number of algorithmical and combinatorial problems, such as problems over graphs, databases, artificial intelligence, …This thesis is in line with the study of the computational complexity of CSP. It is a very active research domain for which there exists dedicated sessions in some highest conferences in algorithmic, logic and artificial intelligennce such as IJCAI and AAAI. The starting point of this thesis was to study some restrictions of CSP and to fully characterize the computational complexity of these sub-problems. This goal has been reached with the complete characterization of monotone CSP over finite domains of an arbitrary cardinality and over infinite countable domains. These results lead to two international and one national publications. This thesis also describes a complete characterization of homogeneous co-Boolean CSP and gives a first approach of a complete characterization for general co-Boolean CSP. Most of all, this thesis develops a new method based on the kernel width which seems to be very promissing to characterize the computational complexity of the general CSP problem, and starts to give some firsts innovating results on the complexity.
44
Mateu, Piñol Carles. "CSP problems as algorithmic benchmarks: measures, methods and models." Doctoral thesis, Universitat de Lleida, 2009. http://hdl.handle.net/10803/8122.
Full textAbstract:
On Computer Science research, traditionally, most efforts have been devoted to research hardness for the worst case of problems (proving NP completeness and comparing and reducing problems between them are the two most known). Artifcial Intelligence research, recently, has focused also on how some characteristics of concrete instances have dramatic effects on complexity and hardness while worst-case complexity remains the same. This has lead to focus research efforts on understanding which aspects and properties of problems or instances affect hardness, why very similar problems can require very diferent times to be solved. Research search based problems has been a substantial part of artificial intelligence research since its beginning. Big part of this research has been focused on developing faster and faster algorithms, better heuristics, new pruning techniques to solve ever harder problems. One aspect of this effort to create better solvers consists on benchmarking solver performance on selected problem sets, and, an, obviously, important part of that benchmarking is creating and defining new sets of hard problems. This two folded effort, on one hand to have at our disposal new problems, harder than previous ones, to test our solvers, and on the other hand, to obtain a deeper understanding on why such new problems are so hard, thus making easier to understand why some solvers outperform others, knowledge that can contribute towards designing and building better and faster algorithms and solvers. This work deals with designing better, that is harder and easy to generate, problems for CSP solvers, also usable for SAT solvers. In the first half of the work general concepts on hardness and CSP are introduced, including a complete description of the chosen problems for our study. This chosen problems are, Random Binary CSP Problems (BCSP), Quasi-group Completion Problems (QCP), Generalised Sudoku Problems (GSP), and a newly defined problem, Edge-Matching Puzzles (GEMP). Although BCSP and QCP are already well studied problems, that is not the case with GSP and GEMP. For GSP we will define new creation methods that ensure higher hardness than standard random methods. GEMP on the other hand is a newly formalised problem, we will define it, will provide also algorithms to build easily problems of tunable hardness and study its complexity and hardness. On the second part of the work we will propose and study new methods to increase the hardness of such problems. Providing both, algorithms to build harder problems and an in-depth study of the effect of such methods on hardness, specially on resolution time.
45
Richoux, Florian. "Toward a complexity classification of CSP through kernel width." Phd thesis, Ecole Polytechnique X, 2009. http://pastel.archives-ouvertes.fr/pastel-00005564.
Full text
46
De, Roquemaurel Marie. "Planification de coût optimal basée sur les CSP pondérés." Phd thesis, Université Paul Sabatier - Toulouse III, 2009. http://tel.archives-ouvertes.fr/tel-00394415.
Full textAbstract:
Un des challenges actuels de la planification est la résolution de problèmes pour lesquels on cherche à optimiser la qualité d'une solution telle que le coût d'un plan-solution. Dans cette thèse, nous développons une méthode originale pour la planification de coût optimal dans un cadre classique non temporel et avec des actions valuées.Pour cela, nous utilisons une structure de longueur fixée appelée graphe de planification. L'extraction d'une solution optimale, à partir de ce graphe, est codée comme un problème de satisfaction de contraintes pondérées (WCSP). La structure spécifique des WCSP obtenus permet aux solveurs actuels de trouver, pour une longueur donnée, une solution optimale dans un graphe de planification contenant plusieurs centaines de nœuds.
Nous présentons ensuite plusieurs méthodes pour déterminer la longueur maximale des graphes de planification nécessaire pour garantir l'obtention d'une solution de coût optimal. Ces méthodes incluent plusieurs notions universelles comme par exemple la notion d'ensembles d'actions indispensables pour lesquels toutes les solutions contiennent au moins une action de l'ensemble.
Les résultats expérimentaux effectués montrent que l'utilisation de ces méthodes permet une diminution de 60% en moyenne de la longueur requise pour garantir l'obtention d'une solution de coût optimal. La comparaison expérimentale avec d'autres planificateurs montre que l'utilisation du graphe de planification et des CSP pondérés pour la planification optimale est possible en pratique même si elle n'est pas compétitive, en terme de temps de calcul, avec les planificateurs optimaux récents.
47
Hui, Mei Lin. "A CSP approach to the analysis of security protocols." Thesis, University of Leicester, 2001. http://hdl.handle.net/2381/30516.
Full textAbstract:
Security protocols involve an exchange of messages in order to achieve a goal such as authentication of a user or secrecy of a session key. Many established protocols have been found to be flawed using protocol analysis techniques. In this thesis we will be extending current CSP-based protocol modelling techniques. Recent techniques for analyzing security protocols have tended to concentrate upon the small protocols that are typically found in the academic literature. However, there is a huge gulf between these and most large commercial protocols. As a result, existing techniques are difficult to apply directly to these large protocols. In this thesis we develop the notion of safe simplifying transformations: transformations that have the property of preserving insecurities; the effect of such transformations is that if we can verify the transformed protocol, then we will have verified the original protocol. We identify a number of safe simplifying transformations, and use them in the analysis of two commercial protocols, the CyberCash Main Sequence protocol and SET. We extend the CSP-based analysis technique to model the property of non-repudiation and give a formal generalized definition. Our definition of non-repudiation is tested against our two case studies. Another property we model is that of key compromise: the reuse of a compromised session key that might lead to an authentication or secrecy attack. We look at how to model the intruder learning the value of a key and then using it in an attack. We apply this technique to our case studies, looking for key compromise attacks using the session keys.
48
Jovanović, Dus̆ko. "Designing dependable process-oriented software a CSP-based approach /." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/55447.
Full text
49
Gasti, Maria. "Techno-economic Appraisal of Concentrating Solar Power Systems (CSP)." Thesis, Högskolan Dalarna, Energi och miljöteknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:du-12806.
Full textAbstract:
The diffusion of Concentrating Solar Power Systems (CSP) systems is currently taking place at a much slower pace than photovoltaic (PV) power systems. This is mainly because of the higher present cost of the solar thermal power plants, but also for the time that is needed in order to build them. Though economic attractiveness of different Concentrating technologies varies, still PV power dominates the market. The price of CSP is expected to drop significantly in the near future and wide spread installation of them will follow. The main aim of this project is the creation of different relevant case studies on solar thermal power generation and a comparison betwwen them. The purpose of this detailed comparison is the techno-economic appraisal of a number of CSP systems and the understanding of their behaviour under various boundary conditions. The CSP technologies which will be examined are the Parabolic Trough, the Molten Salt Power Tower, the Linear Fresnel Mirrors and the Dish Stirling. These systems will be appropriatly sized and simulated. All of the simulations aim in the optimization of the particular system. This includes two main issues. The first is the achievement of the lowest possible levelized cost of electricity and the second is the maximization of the annual energy output (kWh). The project also aims in the specification of these factors which affect more the results and more specifically, in what they contribute to the cost reduction or the power generation. Also, photovoltaic systems will be simulated under same boundary conditions to facolitate a comparison between the PV and the CSP systems. Last but not leats, there will be a determination of the system which performs better in each case study.
50
Lamontagne, Éric. "Le problème de décision CSP : Homomorphismes et espace logarithmique." Thesis, Université Laval, 2012. http://www.theses.ulaval.ca/2012/29292/29292.pdf.
Full text