This paper concerns a verification system for process algebras formalisms based entirely on equational reasoning. One aspect of the kind of reasoning we want to do, the so-called automatic reasoning, that is, the possibility of equipping the axiomatic presentations of various behavioural equivalences with equivalent rewriting relations is analyzed. The problems and the adopted solutions to deal with observational congruence are discussed.
On rewriting behavioural semantics in process algebras
1991
Abstract
This paper concerns a verification system for process algebras formalisms based entirely on equational reasoning. One aspect of the kind of reasoning we want to do, the so-called automatic reasoning, that is, the possibility of equipping the axiomatic presentations of various behavioural equivalences with equivalent rewriting relations is analyzed. The problems and the adopted solutions to deal with observational congruence are discussed.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_449236-doc_161942.pdf
solo utenti autorizzati
Descrizione: On rewriting behavioural semantics in process algebras
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.23 MB
Formato
Adobe PDF
|
1.23 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.
