A Faster-than Relation for Asynchronous Processes

  • Gerald Lüttgen
  • Walter Vogler
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2154)

Abstract

This paper introduces a novel (bi)simulation-based faster-than preorder which relates asynchronous processes with respect to their worst-case timing behavior. The studies are conducted for a conservative extension of the process algebra CCS, called TACS, which permits the specification of maximal time bounds of actions. The most unusual contribution is in showing that the proposed faster-than preorder coincides with two other preorders, one of which considers the absolute times at which actions occur in system runs. The paper also develops the semantic theory of TACS, addressing congruence properties, equational laws, and abstractions from internal actions.

Keywords

Semantic Theory Internal Action Parallel Composition Process Algebra Internal Computation 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Aceto and D. Murphy. Timing and causality in process algebra. Acta Inform., 33(4):317–350, 1996.MATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Inform., 29(8):737–760, 1992.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    S. Arun-Kumar and V. Natarajan. Conformance: A precongruence close to bisimilarity. In STRICT’ 95, Workshops in Comp., pp. 55–68. Springer-Verlag, 1995.Google Scholar
  4. [4]
    J.C.M. Baeten and C.A. Middelburg. Process Algebra with Timing: Real Time and Discrete Time, ch. 10. In A. Ponse, and S.A. Smolka, eds. Handbook of Process Algebra. Elsevier Science Bergstra et al. [5], 2001.Google Scholar
  5. [5]
    J.A. Bergstra, A. Ponse, and S.A. Smolka, eds. Handbook of Process Algebra. Elsevier Science, 2001.Google Scholar
  6. [6]
    E. Bihler and W. Vogler. Efficiency of token-passing MUTEX-solutions. In ICATPN’ 98, vol. 1420 of LNCS, pp. 185–204. Springer-Verlag, 1998.Google Scholar
  7. [7]
    R. Cleaveland and A. Zwarico. A theory of testing for real time. In LICS’ 91, pp. 110–119. IEEE Computer Society Press, 1991.Google Scholar
  8. [8]
    F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. Acta Inform., 34(11):805–835, 1997.CrossRefMathSciNetGoogle Scholar
  9. [9]
    R. DeNicola and M.C.B. Hennessy. Testing equivalences for processes. TCS, 34:83–133, 1983.CrossRefMathSciNetGoogle Scholar
  10. [10]
    R. Gorrieri, M. Roccetti, and E. Stancampiano. A theory of processes with durational actions. TCS, 140(1):73–94, 1995.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    M. Hennessy and T. Regan. A process algebra for timed systems. Inform. and Comp., 117:221–239, 1995.MATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    L. Jenner and W. Vogler. Comparing the efficiency of asynchronous systems. In ARTS’ 99, vol. 1601 of LNCS, pp. 172–191. Springer-Verlag, 1999.Google Scholar
  13. [13]
    L. Jenner and W. Vogler. Fast asynchronous systems in dense time. TCS, 254:379–422, 2001.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    G. Lüttgen and W. Vogler. A faster-than relation for asynchronous processes. Techn. Rep. 2001-2, ICASE, NASA Langley Research Center, USA, 2001.Google Scholar
  15. [15]
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  16. [16]
    F. Moller and C. Tofts. A temporal calculus of communicating systems. In CONCUR’ 90, vol. 458 of LNCS, pp. 401–415. Springer-Verlag, 1990.Google Scholar
  17. [17]
    F. Moller and C. Tofts. Relating processes with respect to speed. In CONCUR’ 91, vol. 527 of LNCS, pp. 424–438. Springer-Verlag, 1991.Google Scholar
  18. [18]
    V. Natarajan and R. Cleaveland. An algebraic theory of process efficiency. In LICS’ 96, pp. 63–72. IEEE Computer Society Press, 1996.Google Scholar
  19. [19]
    S. Schneider. An operational semantics for timed CSP. Inform. and Comp., 116(2):193–213, 1995.MATHCrossRefGoogle Scholar
  20. [20]
    W. Vogler. Faster asynchronous systems. In CONCUR’ 95, vol. 962 of LNCS, pp. 299–312. Springer-Verlag, 1995.Google Scholar
  21. [21]
    W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. In ICALP’ 97, vol. 1256 of LNCS, pp. 538–548. Springer-Verlag, 1997.Google Scholar
  22. [22]
    W. Vogler and L. Jenner. Axiomatizing a fragment of PAFAS. ENTCS, 39, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Gerald Lüttgen
    • 1
  • Walter Vogler
    • 2
  1. 1.Department of Computer ScienceSheffield UniversitySheffieldUK
  2. 2.Institut für InformatikUniversität AugsburgAugsburgGermany

Personalised recommendations