PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Inverardi P. Rewriting for preorder relations. In: CTRS'94 - CTRS'94 (Gerusalemme, July 1994). Proceedings, pp. 223 - 234. 1994.
 
 
Abstract
(English)
Preorders are often used as a semantic tool in various fields of computer science. Examples in this direction are the preorder semantics defined for process algebra formalisms, such as testing preorders and bisimulation preorders. Preorders turn out to be useful when modelling divergence or partial specification. In this paper we present some results on the possibility of associating to a preorder theory, presented via a set of equality axioms and ordering ones, an equivalent rewriting relation which, together with a proof strategy, allows the decidability of the preorder relation. Our approach has been developed in the framework of a project whose main goal is to develop a verification system for process algebra formalisms based on equational reasoning.
Subject preorder theory
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