Sökning: "Bisimulation"

Visar resultat 1 - 5 av 16 avhandlingar innehållade ordet Bisimulation.

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

3. 2. Proving the correctness of a virtual machine by a bisimulation

   Författare :Mikael Rittri; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; stack machine; snapshot; one-step reduction; interpreter correctness; verification mapping; bisimulation; operational semantics; compiler correctness; SECD--machine; context; McGowan mapping; state-trace; debugging;

   Sammanfattning : .... LÄS MER

4. 3. 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

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

7. 5. Programming Language Design - Issues in Web Programming and Security

   Författare :Niklas Broberg; Göteborgs universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Functional programming; web programming; dynamic loading; regular expressions; security; non-interference; calculus; core calculus; bisimulation; calculus;

   Sammanfattning : This thesis consists of two separate parts. Both concern programming language design, the first in the domain of web programming and the other for security. LÄS MER