Abstract
The theory of processes with durational actions proposed in [8] is equipped here with a preorder based on execution speed, called performance preorder. Two processes P and Q are related if they are strong bisimilar (i.e., functional equivalent) and the first one is at least as fast as the second one. Hence, this preorder supports the stepwise refinement “from specification to implementation” by increasing efficiency while retaining the same functionality. We show that the problem of finding faster implementations for a specification is connected to the problem of finding more distributed implementations of the same specification. This is an immediate consequence of the proof that the location preorder, which is based on a measure of distribution, implies the performance preorder.
Research partially supported by MURST, CNR and Esprit BRA n. 8130 LOMAPS.
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, On Relating Concurrency and Nondeterminism, Technical Report SI/RR-89/06, University of Sussex, 1989.
L.Aceto, 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 Efficiency Preorder for Processes, Acta Informatica 29, pp. 737–760, 1992.
G.Boudol, I.Castellani, M.Hennessy, A.Kiehn, A Theory of Processes with Localities, Formal Aspects of Computing 6, pp. 165–200, 1993.
F.Corradini, R.Gorrieri and M.Roccetti, Performance Preorder and Competitive equivalence, Tech.Rep. LFCS-95-1, University of Bologna, January 1995.
Ph.Darondeau, P.Degano, Causal trees, In Automata, Languages and Programming, Springer, LNCS 372, 1989.
G-L.Ferrari and U.Montanari, Observing Time-Complexity of Concurrent Programs, Technical Report, Dipartimento di Informatica, Università di Pisa, 1993.
R.Gorrieri, M.Roccetti and E.Stancampiano, A Theory of Processes with Durational Actions, Theoretical Computer Science 140 (1), pp. 73–94, March 1995.
R.J. van Glabbeek, F.Vaandrager, Petri Net Models for Algebraic Theories of Concurrency, In Proc. of PARLE II, Springer, LNCS 259, pp. 224–242, 1987.
R.Milner, Communication and concurrency, International Series on Computer Science, Prentice Hall International, 1989.
R.Milner, F.Moller, Unique Decomposition of Processes. Theoretical Computer Science 107, pp. 357–363, 1993.
F.Moller, C.Tofts, Relating Processes with Respect to Speed. In CONCUR'91, LNCS 527, Springer-Verlag, pp. 424–438, 1991.
M. Nielsen, P.S. Thiagarajan, Degrees of Nondeterminism and Concurrency, In Proc. 4th Conf. on FST & TCS, Springer, LNCS 181, pp. 89–117, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, F., Gorrieri, R., Roccetti, M. (1995). Performance preorder: Ordering processes with respect to speed. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_150
Download citation
DOI: https://doi.org/10.1007/3-540-60246-1_150
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60246-0
Online ISBN: 978-3-540-44768-9
eBook Packages: Springer Book Archive