PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bolognesi T. A Graphical Composition Theorem for Networks of LOTOS Processes. In: ICDCS-10 - Proceedings of the 10th International Conference on Distributed Computing Systems (Paris, France, 28 May 01 Jun 1990). Proceedings, pp. 88 - 95. (Computer Society Press). 1990.
 
 
Abstract
(English)
An overview of some LOTOS constructs for expressing the behaviour of distributed and concurrent systems is given. Some existing equivalence laws for LOTOS behaviour expressions involving the parallel composition operator are recalled, which are based on the notion of bisimulation equivalence. Due to the nature of such parallel operator, which is binary, the appealing graphical representation of the parallel composition of several LOTOS processes as a network of interconnected boxes is ambiguous. However, under sufficiently general conditions, such graphical representation is sound; a method for deriving from any such graph a family of strongly equivalent LOTOS expressions that describe the intended process composition is introduced and proved correct. The method legitimates the adoption of a graphical (or an equivalent textual) short-hand for such multiple compositions, it can be used for transforming the structure of parallel LOTOS expressions, and is a generalization of previously known algebraic laws.
DOI: 10.1109/ICDCS.1990.89288
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional