Performance preorder: Ordering processes with respect to speed
- 922 Downloads
The theory of processes with durational actions proposed in  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.
KeywordsLabel Transition System Process Algebra Local Clock Duration Function Stepwise Refinement
Unable to display preview. Download preview PDF.
- 1.L.Aceto, On Relating Concurrency and Nondeterminism, Technical Report SI/RR-89/06, University of Sussex, 1989.Google Scholar
- 2.L.Aceto, D.Murphy, Timing and Causality in Process Algebra, Technical Report 9/93, University of Sussex, 1993, to appear in Acta Informatica.Google Scholar
- 4.G.Boudol, I.Castellani, M.Hennessy, A.Kiehn, A Theory of Processes with Localities, Formal Aspects of Computing 6, pp. 165–200, 1993.Google Scholar
- 5.F.Corradini, R.Gorrieri and M.Roccetti, Performance Preorder and Competitive equivalence, Tech.Rep. LFCS-95-1, University of Bologna, January 1995.Google Scholar
- 6.Ph.Darondeau, P.Degano, Causal trees, In Automata, Languages and Programming, Springer, LNCS 372, 1989.Google Scholar
- 7.G-L.Ferrari and U.Montanari, Observing Time-Complexity of Concurrent Programs, Technical Report, Dipartimento di Informatica, Università di Pisa, 1993.Google Scholar
- 9.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.Google Scholar
- 10.R.Milner, Communication and concurrency, International Series on Computer Science, Prentice Hall International, 1989.Google Scholar
- 11.R.Milner, F.Moller, Unique Decomposition of Processes. Theoretical Computer Science 107, pp. 357–363, 1993.Google Scholar
- 12.F.Moller, C.Tofts, Relating Processes with Respect to Speed. In CONCUR'91, LNCS 527, Springer-Verlag, pp. 424–438, 1991.Google Scholar
- 13.M. Nielsen, P.S. Thiagarajan, Degrees of Nondeterminism and Concurrency, In Proc. 4th Conf. on FST & TCS, Springer, LNCS 181, pp. 89–117, 1984.Google Scholar