The graphical representation of the parallel composition of several LOTOS processes as a network of interconnected boxes is ambiguous, due to the nature of the LOTOS binary parallel operator. However, under suitable and sufficiently general conditions, such graphical representation is sound; a method for deriving from these graphs a family of strongly equivalent LOTOS expressions that describe the intended process composition is introduced and proved correct. The method can be used for transforming the structure of parallel LOTOS expressions, and is a generalization of previously known algebraic transformation laws.
On the soundness of graphical representations of interconnected processes in LOTOS
Bolognesi T
1990
Abstract
The graphical representation of the parallel composition of several LOTOS processes as a network of interconnected boxes is ambiguous, due to the nature of the LOTOS binary parallel operator. However, under suitable and sufficiently general conditions, such graphical representation is sound; a method for deriving from these graphs a family of strongly equivalent LOTOS expressions that describe the intended process composition is introduced and proved correct. The method can be used for transforming the structure of parallel LOTOS expressions, and is a generalization of previously known algebraic transformation laws.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_453296-doc_171845.pdf
non disponibili
Descrizione: On the soundness of graphical representations of interconnected processes in LOTOS
Tipologia:
Versione Editoriale (PDF)
Dimensione
588.91 kB
Formato
Adobe PDF
|
588.91 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
