In the last years there have been several attempts at defining new logics or at using existing ones to specify properties of reactive and concurrent systems. The gain of associating suitable logics, such as modal or temporal logics, to communicating systems is the possibility of using deductive methods to prove properties. To provide modularity in the specification and verification of concurrent systems the compositional denotation by logic assertions of concurrent systems, specified by a process algebra like CCS, becomes an important research issue.
Compositionality and bisimulation: a negative result
Fantechi A;Gnesi S;
1991
Abstract
In the last years there have been several attempts at defining new logics or at using existing ones to specify properties of reactive and concurrent systems. The gain of associating suitable logics, such as modal or temporal logics, to communicating systems is the possibility of using deductive methods to prove properties. To provide modularity in the specification and verification of concurrent systems the compositional denotation by logic assertions of concurrent systems, specified by a process algebra like CCS, becomes an important research issue.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_447060-doc_160997.pdf
solo utenti autorizzati
Descrizione: Compositionality and bisimulation: a negative result
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.07 MB
Formato
Adobe PDF
|
1.07 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.


