PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
De Francesco N., Inverardi P. A semantic driven method to check the fineteness of CCS processes. In: CAV '91 - 3rd Workshop on Computer-Aided Verification. (Aalborg, Denmark, July 1991). Proceedings, pp. 266 - 276. K.G. Larsen, A. Skou (eds.). (Lecture notes in computer science, vol. 575). Springer-Verlag, 1991.
 
 
Abstract
(English)
In this paper we present a method to check the finiteness of CCS expressions. The method is interpretative, i.e. it is based on an extended operational semantics of CCS. According to this new operational semantics it is always possible to build a finite state transition system which, if some condition holds, is a finite representation of a process. It works on terms of the CCS signature and is able to decide the finiteness of a CCS expression in a large number of cases which are not captured by known syntactic criteria.
Subject CCS


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