Sökning: "pi-calculus"

Visar resultat 6 - 9 av 9 avhandlingar innehållade ordet pi-calculus.

  1. 6. Languages, Logics, Types and Tools for Concurrent System Modelling

    Författare :Ramūnas Gutkovas; Johannes Borgström; Björn Victor; Thomas T. Hildebrandt; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; process calculus; modal logic; session types; tool; Computer Science; Datavetenskap;

    Sammanfattning : A concurrent system is a computer system with components that run in parallel and interact with each other. Such systems are ubiquitous and are notably responsible for supporting the infrastructure for transport, commerce and entertainment. LÄS MER

  3. 7. A time constrained real-time process calculus

    Författare :Viktor Leijon; Luleå tekniska universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Inbyggda system; Embedded System;

    Sammanfattning : There are two important questions to ask regarding the correct execution of a real-time program: (i) Is there a platform such that the program executes correctly? (ii) Does the program execute correctly on a particular platform? The execution of a program is correct if all actions are taken within their execution window, i.e. LÄS MER

  4. 8. Logics of Knowledge and Cryptography : Completeness and Expressiveness

    Författare :Mika Cohen; Mads Dam; Alessio Lomuscio; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; epistemic logic; first-order logic; formal cryptography; static equivalence; security protocols; BAN logic; multi-agent system; completeness; logical omniscience problem; Computer science; Datavetenskap;

    Sammanfattning : An understanding of cryptographic protocols requires that we examine the knowledge of protocol participants and adversaries: When a participant receives a message, does she know who sent it? Does she know that the message is fresh, and not merely a replay of some old message? Does a network spy know who is talking to whom? This thesis studies logics of knowledge and cryptography. Specifically, the thesis addresses the problem of how to make the concept of knowledge reflect feasible computability within a Kripke-style semantics. LÄS MER

  5. 9. Equivalences and Calculi for Formal Verification of Cryptographic Protocols

    Författare :Johannes Borgström; Uwe Nestmann; Thomas A Henzinger; Martin Odersky; Andrew D Gordon; Viktor Kuncak; Björn Victor; EPFL; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptographic primitives are flawless, facilitates the construction of formal models and verification tools. LÄS MER