PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Inverardi P., Nesi M. On rewriting behavioural semantics in process algebras. In: Amast - 2nd International Conference on Algebraic Methodology and Software Technology. (Iowa City, Iowa, 22-25 May 1991). Proceedings, pp. 108 - 116. M. Nivat, C. Rattray et al. (eds.). Springer, 1991.
 
 
Abstract
(English)
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.
Subject Process Algebra


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