PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
De Francesco N., Inverardi P. Proving fiteness of CCS processes by non-standard semantics. In: Acta Informatica, vol. 31 (1) pp. 55 - 80. Springer, 1994.
 
 
Abstract
(English)
Wc present a semantic method to check the finiteness of CCS terms. The method is interpretative, i.e. it is based on a non-standard CCS operational semantics. According to this semantics it is always possible, given a process p, to build a finite state transition system which, if a condition hold, is a finite representation of p; otherwise it is a suitable approximation of its semantic behaviour. The method is able to decide the finiteness of a CCS term in a larger number of cases than those capured by known syntactic criteria.
Subject CCS
verification
D.2.4 Software/Program Verification


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