Performance preorder: Ordering processes with respect to speed

  • Flavio Corradini
  • Roberto Gorrieri
  • Marco Roccetti
Contributed Papers Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


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.


Label Transition System Process Algebra Local Clock Duration Function Stepwise Refinement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L.Aceto, On Relating Concurrency and Nondeterminism, Technical Report SI/RR-89/06, University of Sussex, 1989.Google Scholar
  2. 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
  3. 3.
    S.Arun-Kumar and M.Hennessy, An Efficiency Preorder for Processes, Acta Informatica 29, pp. 737–760, 1992.CrossRefGoogle Scholar
  4. 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. 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. 6.
    Ph.Darondeau, P.Degano, Causal trees, In Automata, Languages and Programming, Springer, LNCS 372, 1989.Google Scholar
  7. 7.
    G-L.Ferrari and U.Montanari, Observing Time-Complexity of Concurrent Programs, Technical Report, Dipartimento di Informatica, Università di Pisa, 1993.Google Scholar
  8. 8.
    R.Gorrieri, M.Roccetti and E.Stancampiano, A Theory of Processes with Durational Actions, Theoretical Computer Science 140 (1), pp. 73–94, March 1995.CrossRefGoogle Scholar
  9. 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. 10.
    R.Milner, Communication and concurrency, International Series on Computer Science, Prentice Hall International, 1989.Google Scholar
  11. 11.
    R.Milner, F.Moller, Unique Decomposition of Processes. Theoretical Computer Science 107, pp. 357–363, 1993.Google Scholar
  12. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Flavio Corradini
    • 1
  • Roberto Gorrieri
    • 2
  • Marco Roccetti
    • 2
  1. 1.Dipartimento di Scienze dell'InformazioneUniversità “La Sapienza”RomaItaly
  2. 2.Dipartimento di Scienze dell'InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations