PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Fantechi A., Gnesi S., Mazzarini G. How expressive are LOTOS behaviour expressions?. In: FORTE '90 - 3rd International Conference on Formal Description Techniques for distributed Systems and Communications Protocols. (Madrid, Spain, 5 - 8 November 1990). Proceedings, pp. 17 - 32. Juan Quemada, Jose Maņas, Enrique Vazquez (eds.). North-Holland, 1991.
 
 
Abstract
(English)
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. Actual1y, 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.
Subject LOTOS


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