Sökning: "bisimulation equivalence"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden bisimulation equivalence.

  1. 1. Fast decision of strong bisimulation equivalence using partition refinement

    Författare :Sven Westin; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; CCS; coarsest partition; labelled transition system; refinement; partition; bisimulation equivalence;

    Sammanfattning : .... LÄS MER

  3. 2. Reduction Techniques for Finite (Tree) Automata

    Författare :Lisa Kaati; Parosh Aziz Abdulla; Frank Drewes; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Finite automata; tree automata; bisimulation; minimization; simulation; composed bisimulation; composed simulation; Datavetenskap; Computer Science;

    Sammanfattning : Finite automata appear in almost every branch of computer science, for example in model checking, in natural language processing and in database theory. In many applications where finite automata occur, it is highly desirable to deal with automata that are as small as possible, in order to save memory as well as excecution time. LÄS MER

  4. 3. Psi-calculi: a framework for mobile process calculi : Cook your own correct process calculus - just add data and logic

    Författare :Magnus Johansson; Björn Victor; Joachim Parrow; Catuscia Palamidessi; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; process calculi; pi-calculus; bisimulation; operational semantics; nominal logic; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Sammanfattning : A psi-calculus is an extension of the pi-calculus with nominal data types for data structures, logical assertions, and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus. LÄS MER

  5. 4. Verification of Infinite-State Systems : Decision Problems and Efficient Algorithms

    Författare :Mats Kindahl; Parosh Aziz Abdulla; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : This thesis presents methods for the verification of distributed systems with infinite state spaces. We consider several verification problems for lossy channel systems, a class of infinite-state systems consisting of finite-state machines that communicate over unbounded, but lossy, FIFO channels. LÄS MER

  7. 5. 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