Comparing Deadlock-Free Processes, Revisited

Dias Perera, Channa (2023) Comparing Deadlock-Free Processes, Revisited. Bachelor's Thesis, Computing Science.

Preview	Text ComparingDeadlockFreeProcessesRevisited.pdf Download (698kB) | Preview
	Text toestemming.pdf Restricted to Registered users only Download (136kB)

Abstract

Complex concurrent systems can often release with bugs as merely detecting these bugs is difficult. An example of such a bug would be that of a concurrent process deadlocking. One method to detect deadlocks robustly is by modelling these processes and subsequently checking them via some mechanism. A formal mode of modelling concurrent systems is through the π-calculus, processes can be checked for deadlock-freedom via a so-called type system. There are many type systems but there is very little work that formally compares them, leaving us with a limited taxonomy for organising these systems against each other. We extend our current understanding of this taxonomy by broadening an existing comparison of two type systems. We consider a third system which is a conceptual extension of one of the type systems already compared. Notably however, this type system relies on different operational semantics, one which allows for non-blocking actions, which makes a direct comparison of process syntax misleading. We resolve this incongruence, leading to a set of processes relying on non-blocking actions H◦, and a set of processes which do not H•. We compare this latter set to the sets defined in the original comparison. We also provide a type-preserving translation (with examples) from H◦ to H•.

Item Type:	Thesis (Bachelor's Thesis)
Supervisor name:	Perez Parra, J.A. and Ramanayake, D.R.S.
Degree programme:	Computing Science
Thesis type:	Bachelor's Thesis
Language:	English
Date Deposited:	25 Sep 2023 14:47
Last Modified:	25 Sep 2023 14:47
URI:	https://fse.studenttheses.ub.rug.nl/id/eprint/31465

Actions (login required)

View Item