An Algebraic Theory of Process Efficiency (1996)
| Venue: | In LICS ’96 |
| Citations: | 11 - 1 self |
BibTeX
@INPROCEEDINGS{Natarajan96analgebraic,
author = {V. Natarajan and Rance Cleaveland},
title = {An Algebraic Theory of Process Efficiency},
booktitle = {In LICS ’96},
year = {1996},
pages = {63--72},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper presents a testing-based semantic theory for reasoning about the efficiency of concurrent systems as measured in terms of the amount of their internal activity. The semantic preorders are given an algebraic characterization, and their optimality is established by means of a full abstractness result. They are also shown to subsume existing bisimulation-based efficiency preorders. An example is provided to illustrate the utility of this approach. 1. Introduction Process algebras [12, 10, 3] have attracted substantial attention over the past decade and a half as frameworks for system verification. A hallmark of these theories is the development of behavioral equivalences and preorders that relate systems on the basis of their extensional behavior. In these frameworks, specifications are usually given as "highlevel " systems; to prove a system meets such a specification, one shows that they are related appropriately by such a behavioral relation. When the behavioral relation is...
