CSP and RTAI

Richard Revis rtai at revis.org
Tue Oct 26 22:32:59 CEST 2004


-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

For my final year project I have elected to take a close look at RTAI.

On my list of things to look into is expressing some of the basic structure of
RTAI in CSP in order to verify the (non)existance of deadlocks mathmatically.
I was wondering if anyone on the list had seen this approach (especially
applied to RTAI) before? Unfortunatly CSP (Communicating Sequential Pcesses
in this case) as an anacronym seems well used so searching for any literature
is a little complex.

For other parts of my project I will be working on benchmarking some metrics
to evalutate the level of determanism and throughput in RTAI, and any
suggestions on things to test that have not been done that would be useful
for further development would be well recieved and implimented where it is
within my capability.

Many thanks,

Richard Revis
MEng (Systems Engineering) student, LU

- --
Outgoing e-mail is signed with my PGP key
You may obtain a copy of my key at http://key.revis.org
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.3 (GNU/Linux)

iD8DBQFBfrSE9wKsh92eF6ERAjB2AJ9gTDXdpru+ApSHVNYiTGFcw+4NJwCglM2b
wt4G9Ldi+6Fc7UVAypIxXBQ=
=+jqF
-----END PGP SIGNATURE-----





More information about the Rtai mailing list