Paul's Web Pages
http://paul.luon.net
Trying to figure it all outen-usJekyll2013-01-05T21:21:00+01:00http://creativecommons.org/licenses/by-sa/3.0/nl/hourly12000-01-01T12:00+00:00Master Project Take 2 and 3
http://paul.luon.net/journal/2007/05/30/master-project-take-2-and-3
life/study/MasterProjectTake23@http://paul.luon.net/journallifestudydebian-planetmaster-projectmathPaul van Tilburg2007-05-30T00:00:00+02:00<p>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 <acronym title="Calculus of Communicating Systems"><span class="caps">CCS</span></acronym>
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 <a href="/journal/life/study/MasterProjectTake1.html">previous
post</a> 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.</p>
<p>So, today I can present the final version of my <a href="/writings/reports/TUE-WIN-EqBaseCCS_Res.pdf">Master’s
Thesis</a>: “Finite Equational
Bases for <span class="caps">CCS</span> 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.</p>
<p>Almost finished, 6 days remaining…</p>Master Project - Take 1
http://paul.luon.net/journal/2006/09/20/master-project---take-1
life/study/MasterProjectTake1@http://paul.luon.net/journallifestudydebian-planetmaster-projectmathPaul van Tilburg2006-09-20T00:00:00+02:00<p>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.</p>
<p>So, what am I actually doing? Well that’s still hard to put in words
yet and it also requires some <a href="http://en.wikipedia.org/wiki/Process_algebra">process algebra</a> and general math
prior knowledge, but I’ll try.</p>
<p>My graduation supervisor is <a href="http://www.win.tue.nl/~luttik/">Bas Luttik</a>
and in July he co-published a
<a href="http://www.win.tue.nl/~luttik/Papers/EqBaseCCS_short.pdf">paper</a> on
defining a finite equational base (a set of equations from which all
others can be derived) for a specific process algebra called
<acronym title="Calculus of Communicating Systems"><span class="caps">CCS</span></acronym>. This paper used a specific
subset of
<a href="http://en.wikipedia.org/wiki/Calculus_of_Communicating_Systems"><span class="caps">CCS</span></a>,
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.</p>
<p>Take 1 of my project is to try to consider this algebra <em>with restriction</em>
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 <span class="caps">CCS</span> with restriction but
<em>without concurrency</em> to drastically reduce the cases to be considered.
If we succeed, we’ll continue with <span class="caps">CCS</span> with restriction and concurrency.
If we do not succeed it’s quite possible we’ll change my project
assignment.</p>
<p>More to come!</p>