SERG Report Announcement

• Subject: SERG Report Announcement
• From: burns@raid.cas.mcmaster.ca (Doris Burns)
• Date: Tue, 19 Oct 1999 09:40:55 -0400

October 19, 1999


Dear Sir/Madame:

Below is an abstract for SERG Report 382 which was recently 
completed by McMaster University's Software Engineering Group.  

Our web address for downloading reports is:

http://www.crl.mcmaster.ca/SERG/serg.publications.html

Our publication page has been revised and I hope that with the new format,
it will be easier to use.  

If you need to have the report mailed to you, there is a $10.00 fee
for both the new SERG reports and the previous CRL Reports to cover printing 
and mailing costs.  Please send a cheque payable to McMaster University. 
This fee does not apply to companies that are members of CITO, 
universities and other "not for profit" organisations.  We will send 
an invoice with the reports if you request one. If the cost to cut a 
cheque exceeds the amount of the cheque, we can keep a "running 
balance" of the  reports you have ordered and when the amount owed 
is around $30.00, an invoice will be issued.


Yours truly,
Doris Burns

				SERG Report 382
		      Concurrency: a relational approach
	           Dr. Ridha Khedri and Dr. Jules Desharnais

We model processes by means of a mathematical entity that we call a
relational process.  This model describes a process as an open system from
which the description of the process as a closed system can be easily
obtained.  Also, it represents not only the actions of the process
but also the resources needed to accomplish its behaviour.  Using this
model, we first define two operators.  Each of these represents an extreme
perception of concurrency.  One, the interleaved parallel composition
operator, reduces concurrency to interleaving and the other, the maximal
totally synchronous parallel composition operator, reduces concurrency to
a totally synchronous behaviour.  Second, by combining these operators, we
define the maximal true-concurrency composition operator, which is an operator
expressing true concurrency.  When many processes interfere on the same
resource in order to modify it, each in its way, the two maximal
operators express this situation by letting the final value of the
variable modelling this resource be indeterminate.  So, they allow the
detection of interferences between processes.  We present some of the
properties of these operators.

• Prev: Deadline for ICLP99 early registration/hotel approaching
• Next: High Assurance Systems Engineering
• Index: AMAST Mail - October 1999