Master Project Take 2 and 3

Paul van Tilburg — 2007-05-30T00:00:00+02:00

I just realised that I forgot to post about take 2, so I’ll combine it with this post about take 3. The past five months I’ve been busy with examining the effect of restriction on CCS with parallelism. We decided to do this in two steps. First (take 2) we considered interleaving of actions, and then (take 3) we added communication. The case with only interleaving of actions went smoothly; it worked out as a nice extension of the case without parallelism. However, when we looked at the case with interleaving and communication, it started to become troubling. I ran into all kind of complications and the risk of failure I described in a previous post seemed to come true. However, I think we managed quite well to catch a large part of the problems and describe them, and also offer possible solutions. In the end, I’m quite happy of the result.

So, today I can present the final version of my Master’s Thesis: “Finite Equational Bases for CCS with Restriction”. Yay! I have just submitted it for reproduction. The final presentation of my project will take place June 5, 2007 at 10:00 in the main building of the university, HG 6.29. If you’re interested and are able to attend, consider yourself invited. I want to thank Bas Luttik for his large amount of feedback, clear explanations and guidance, without him the project wouldn’t have worked out as well as it did now.

Almost finished, 6 days remaining…

Master Project - Take 1

Paul van Tilburg — 2006-09-20T00:00:00+02:00

Today I have effectively started with my Master Project! I have been been at it for a few days already in the past weeks though, but now I’m sitting on my own spot working on some proofs.

So, what am I actually doing? Well that’s still hard to put in words yet and it also requires some process algebra and general math prior knowledge, but I’ll try.

My graduation supervisor is Bas Luttik and in July he co-published a paper on defining a finite equational base (a set of equations from which all others can be derived) for a specific process algebra called CCS. This paper used a specific subset of CCS, namely without restriction (hiding) and relabelling. Restriction is an operator of the process algebra to block certain actions of happening, relabelling is an operator to replace actions by other actions.

Take 1 of my project is to try to consider this algebra with restriction and finding a new equational base and proof that either it works or it can not be done. This is a risky assignment because it can lead to: we have tried but haven’t gotten either results. The short period to come will entail considering CCS with restriction but without concurrency to drastically reduce the cases to be considered. If we succeed, we’ll continue with CCS with restriction and concurrency. If we do not succeed it’s quite possible we’ll change my project assignment.

More to come!

Paul's Web Pages

Master Project Take 2 and 3

Master Project - Take 1