Sökning: "pi-calculus"
Visar resultat 1 - 5 av 9 avhandlingar innehållade ordet pi-calculus.
1. Formalising process calculi
Sammanfattning : As the complexity of programs increase, so does the complexity of the models required to reason about them. Process calculi were introduced in the early 1980s and have since then been used to model communication protocols of varying size and scope. LÄS MER
2. 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
3. Bells and Whistles : Advanced language features in psi-calculi
Sammanfattning : Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus. Remarkably, machine-checked proofs of standard algebraic and congruence properties of bisimilarity apply to every instance of the framework. LÄS MER
4. Advancing concurrent system verification : Type based approach and tools
Sammanfattning : Concurrent systems, i.e., systems of parallel processes, are nearly ubiquitous and verifying the correctness of such systems is becoming an important subject. Many formalisms were invented for such purpose, however, new types of systems are introduced and there is a need for handling larger systems. LÄS MER
5. Extending psi-calculi and their formal proofs
Sammanfattning : Psi-calculi is a parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. This thesis presents broadcast psi-calculi and higher-order psi-calculi, two extensions of the psi-calculi framework, allowing respectively one-to-many communications and the use of higher-order process descriptions through conditions in the parameterised logic. LÄS MER