An algebra of behavioural types

António Ravara, Pedro Resende, Vasco T. Vasconcelos

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
7 Downloads (Pure)


We propose a process algebra, the Algebra of Behavioural Types, as a language for typing concurrent objects. A type is a higher-order labelled transition system that characterises all possible life cycles of a concurrent object. States represent interfaces of objects; state transitions model the dynamic change of object interfaces. Moreover, a type provides an internal view of the objects that inhabits it: a synchronous one, since transitions correspond to message reception. To capture this internal view of objects we define a notion of bisimulation, strong on labels and weak on silent actions. We study several algebraic laws that characterise this equivalence, and obtain completeness results for image-finite types.

Original languageEnglish
Pages (from-to)64-91
Number of pages28
JournalInformation and Computation
Publication statusPublished - Mar 2012


Dive into the research topics of 'An algebra of behavioural types'. Together they form a unique fingerprint.

Cite this