Abstract
The process algebra expressing nets of automata is provided with a new operational semantics, that allows us to reason about performance properties of concurrent systems. Based on the idea that actions are durational and execution is asynchronous, performance equivalence and performance preorder are introduced as extensions of interleaving bisimulation. They turn out to be a congruence and a precongruence, respectively, w.r.t. the operators of the language we study. The equivalence (preorder) is also characterized by Hennessy-Milner logic (and its positive form), with natural numbers as propositional constants. Furthermore, we show how to apply modal μ-calculus to specify and verify performance-oriented properties.
This work has been partially founded by EEC within the HCM Project EXPRESS, and by CNR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto and D. Murphy. On the ill-timed but well-caused. In E. Best, editor, CONCUR'93, LNCS 715, pages 97–111. Springer-Verlag, 1993.
L. Aceto and D. Murphy. Timing and causality in process algebra. Technical Report 9/93, University of Sussex, 1993. To appear in Acta Informatica.
S. Arun-Kumar and M. Hennessy. An efficient preorder for processes. Acta Informatica, 29:737–760, 1992.
S. Brooks and W. Rounds. Behavioural equivalence relations induced by programming logics. In LNCS 154, pages 97–108. Springer-Verlag, 1983.
R. Cleaveland. Tableau-based model checking in the propositional μ-calculus. Acta Informatica, 27:725–747, 1990.
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transaction on Programming Languages and Systems, 15:36–72, 1993.
F. Corradini. Compositionality for processes with durational actions. In Proc. Fifth Italian Conference on Theoretical Computer Science, 1995.
F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. Technical Report 95/01, University of Bologna, 1995.
F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder: Ordering processes with respect to speed. In MFCS'95, LNCS 969, pages 444–453, 1995.
E.A. Emerson and J.Y. Halpern. “Sometimes” and “Not Never” revisited: on branching time versus linear time temporal logic. Journal of ACM, 33(1):151–178, 1986.
G-L. Ferrari and U. Montanari. Dynamic matrices and the cost analysis of concurrent programs. In AMAST'95, 1995.
R. Gorrieri and M. Roccetti. Towards performance evaluation in process algebras. In AMAST'93, pages 289–296. Springer-Verlag, 1993.
R. Gorrieri, M. Roccetti, and E. Stancampiano. A theory of processes with durational actions. Theoretical Computer Science, 140(1):73–94, 1995.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. of ACM, 32(1):137–161, 1985.
D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
Z. Manna and A. Pnueli. The anchored version of the temporal framework. In J. de Bakker, P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 201–284. Springer-Verlag, 1989.
R. Milner. Communication and Concurrency. Prentice Hall International, 1989. International Series on Computer Science.
F. Moller and C. Tofts. Relating processes with respect to speed. In CONCUR'91, LNCS 527, pages 424–438, 1991.
R. De Nicola and V. Vaandrager. Three logics for branching bisimulation. Journal of ACM, 42(2):458–487, 1995.
C.Stirling. Modal and temporal logics. In Handbook of Logic in Computer Science, Volume 2, pages 477–563. Oxford University Press, 1992.
W. Vogler. Faster asynchronous systems. In Proc. CONCUR'95, LNCS 962, pages 299–312. Springer, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X.J., Corradini, F., Gorrieri, R. (1996). A study on the specification and verification of performance properties. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014324
Download citation
DOI: https://doi.org/10.1007/BFb0014324
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61463-0
Online ISBN: 978-3-540-68595-1
eBook Packages: Springer Book Archive