Ceci est une ancienne révision du document !

Lecture 3 : Wcomp middleware and proved components

Part 1 : How to Design Components in a Middleware for Ubiquitous Computing WComp 2.0

VMware WComp environment iw distributed on DVD and USB Key during the lecture.
- Remark : If you're under linux be careful : replace the configuration file of your virtual machine vmplayer by this one and then after running, start the audio service
- Remark : Find here a Light UPnP server if you need UPnP Light

Official WComp Project Website
Vincent Hourdin, Jean-Yves Tigli, Stéphane Lavirotte, Gaëtan Rey, Michel Riveill, “SLCA, Composite Services for Ubiquitous Computing”, in the proceedings of the International Conference on Mobile Technology, Applications and Systems, Sep 2008.
J.-Y. Tigli, S. Lavirotte, G. Rey, V. Hourdin, M. Riveill, “Lightweight Service Oriented Architecture for Pervasive Computing” IJCSI International Journal of Computer Science Issues, Vol. 4, No. 1, September 2009, ISSN (Online): 1694-0784, ISSN (Print): 1694-0814, paper.
J.-Y. Tigli, S. Lavirotte, G. Rey, V. Hourdin, D. Cheung, E. Callegari, M. Riveill “WComp middleware for ubiquitous computing: Aspects and composite event-based Web services” in Annals of Telecommunications, éditeur Springer Paris, ISSN 0003-4347 (Print) 1958-9395 (Online), Vol. 64, No 3-4, March-April 2009, paper.

Documentation for the tutorial 3 “ Verification with Lustre and Lesar ” : Tutorial 3, Verification with Lustre and Lesar
Sample code in Lustre: Tutorial 3, sample code in Lustre
Documentation for the tutorial 2 “Creating an advanced Component in WComp 2.0” : Tutorial 2, Creating an advanced Component in WComp 2.0

Deadline : february, the 1st, 2010

Project Number	Project Titlte	Subject
0	Barrier	A barrier is a type of synchronization method. A barrier for a group of threads or processes in the source code means any thread/process must stop at this point and cannot proceed until all other threads/processes reach this barrier
1	Lock	A lock is a synchronization mechanism for enforcing limits on access to a resource in an environment where there are many threads of execution. Locks are one way of enforcing concurrency control policies.
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39