A logical characterization of efficiency preorders

Authors:
Neelesh Korade;S. Arun-Kumar
Affiliations:
Persistent Systems Private Limited, “Bhageerath”, Pune, India;Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi, India
Venue:
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Year:
2004

Citing 8
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
An efficiency preorder for processes

Acta Informatica
Modal and temporal properties of processes

Modal and temporal properties of processes
Communication and Concurrency

Communication and Concurrency
An Efficiency Preorder for Processes

TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Faster-than Relation for Asynchronous Processes

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Testing Processes for Efficiency

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
An Algebraic Theory of Process Efficiency

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and weak bisimilarity, guided by a principle of containment which is explained in the Introduction. Even though the proofs of the characterizations use standard methods, there are various subtleties introduced by the nature of the preorders and the logical operators needed to characterize them. The authors have not previously encountered the use of such operators in such simple logics.