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.
A semantic driven method to check the fineteness of CCS processes
1991
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_449259-doc_161974.pdf
solo utenti autorizzati
Descrizione: A semantic driven method to check the fineteness of CCS processes
Tipologia:
Versione Editoriale (PDF)
Dimensione
2.29 MB
Formato
Adobe PDF
|
2.29 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.
