[Prev][Next][Index][Thread]
on behavioural types for concurrent objects
-
To: types@cs.indiana.edu, concurrency@cwi.nl
-
Subject: on behavioural types for concurrent objects
-
From: "Antonio.Ravara."<amar@math.ist.utl.pt>
-
Date: Tue, 24 Jun 1997 11:59:59 +0100
-
Cc: "Am$EDlcar.Sernadas."<Amilcar.Sernadas@math.ist.utl.pt>, "Carlos.Caleiro."<ccal@math.ist.utl.pt>, "Cristina.Sernadas."<Cristina.Sernadas@math.ist.utl.pt>, "Hugo.Louren$E7o."<hlouren@math.ist.utl.pt>, "Jaime.Ramos."<jabr@math.ist.utl.pt>, "Jos$E9.Carmo."<Jose.Carmo@math.ist.utl.pt>, "Maria.Jo$E3o.Coutinho."<mjpc@math.ist.utl.pt>, "Miguel.Dion$EDsio."<fmd@math.ist.utl.pt>, "Paula.Gouveia."<mpg@math.ist.utl.pt>, "Paulo.Mateus."<pmat@math.ist.utl.pt>, "Pedro.Resende."<Pedro.Resende@math.ist.utl.pt>
-
Delivery-Date: Tue, 24 Jun 1997 05:58:46 -0500
-
Organization: DM-IST
-
Reply-To: amar@math.ist.utl.pt
I would like to aanounce the availability of the following paper. All
coments are very wellcomed.
Behavioural types for a calculus of concurrent objects.
Antonio Ravara and Vasco T. Vasconcelos
Abstract
We present a new type system for the name-passing calculus of concurrent
objects, TyCO. The system captures dynamic aspects of objects'
behaviours, while enlarging the class of typable processes. The notion
of error-process is more flexible than the previous one, only demanding
weak fairness in the treatment of messages. Types are graphs,
incorporating a notion of state-transition systems. The type
compatibility relation is captured by a bisimulation relation.
There are two versions available, a short one that will be publish in
the proceedings of Euro-Par'97 (URL:
http://www.cs.math.ist.utl.pt/ftp/pub/RavaraA/97-RV-short_bevtypes.ps.gz)
and a full one (URL:
http://www.cs.math.ist.utl.pt/ftp/pub/RavaraA/97-RV-bevtypes.ps.gz).
antonio ravara