PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Fantechi A., Gnesi S., Perticaroli V. An expressive logic for basic process algebra. In: MFCS'93 - Mathematical Foundations of Computer Science 1993. 18th International Symposium (Gdańsk, August - September 1993). Proceedings, pp. 453 - 462. A.M. Borzyszkowski, S. Sokolowski (eds.). (Lecture Notes in Computer Science, vol. 711). Springer, 1993.
 
 
Abstract
(English)
In this paper we present a branching time temporal logic for Basic Process Algebra. This logic is an enrichment of the branching temporal logic CTL with a branching sequential composition operator, namled chop branching. The logic so obtained is proved to be expressive with respect to the bisimulation semantics delined on BPA_δrec terms, and is able to describe context-free properties of systems.
Subject


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