It is a known result that, when in an action prefix language like LOTOS we have both recursion and parallel composition operators, the finite-state behaviour of processes is in general lost. Actually, this happens also when other LOTOS operators, such as enabling or disabling, are used in a recursive context. The purpose of our paper is to study the expressive power of Basic LOTOS in terms of the relations between the syntactical structure and the finite-state behaviour of processes. We then define some sufficient conditions on the syntactical shape of the specifications in order to preserve the finite-state nature.
How much expressive are LOTOS behaviour expressions?
Fantechi A;Gnesi S;
1990
Abstract
It is a known result that, when in an action prefix language like LOTOS we have both recursion and parallel composition operators, the finite-state behaviour of processes is in general lost. Actually, this happens also when other LOTOS operators, such as enabling or disabling, are used in a recursive context. The purpose of our paper is to study the expressive power of Basic LOTOS in terms of the relations between the syntactical structure and the finite-state behaviour of processes. We then define some sufficient conditions on the syntactical shape of the specifications in order to preserve the finite-state nature.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
prod_453120-doc_171463.pdf
non disponibili
Descrizione: How much expressive are LOTOS behaviour expressions?
Tipologia:
Versione Editoriale (PDF)
Dimensione
3.71 MB
Formato
Adobe PDF
|
3.71 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.