Sökning: "bisimulation"
Visar resultat 1 - 5 av 16 avhandlingar innehållade ordet bisimulation.
1. Reduction Techniques for Finite (Tree) Automata
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
2. Proving the correctness of a virtual machine by a bisimulation
Sammanfattning : .... LÄS MER
3. Fast decision of strong bisimulation equivalence using partition refinement
Sammanfattning : .... LÄS MER
4. Psi-calculi: a framework for mobile process calculi : Cook your own correct process calculus - just add data and logic
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. Programming Language Design - Issues in Web Programming and Security
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