An Elimination Theorem for regular behaviours with integration

  • Willem Jan Fokkink
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 715)


In this paper we consider we consider a variant of the process algebra ACP with rational time and integration. We shall indicate a subdomain of regular processes for which an Elimination Theorem holds: for each pair of processes p, q in this class there is a process z in this class such that p∥q and z have the same behaviour. Furthermore, we indicate by some simple examples that if the subdomain is restricted or enlarged, then the elimination result is lost. The subdomain has a strong link with the model of timed automata of Alur and Dill.

1991 Mathematics Subject Classification

68Q50 68Q60 

1987 CR Categories

D.3.1 F.3.1 

Key Words & Phrases

ACP relative time integration regular process Elimination Theorem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AD90]
    R. Alur and D. Dill. Automata for modeling real-time behaviour. In M. Paterson, editor, Proceedings 17 th ICALP, Warwick, LNCS 443, pages 322–335. Springer-Verlag, 1990.Google Scholar
  2. [BB91]
    J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Journal of Formal Aspects of Computing Science, 3(2):142–188, 1991.CrossRefGoogle Scholar
  3. [BV93]
    J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. Report CSN-93/05, Eindhoven University of Technology, Eindhoven, 1993.Google Scholar
  4. [Fok92]
    W.J. Fokkink. Regular processes with rational time and silent steps. Report CS-R9231, CWI, Amsterdam, 1992.Google Scholar
  5. [Fok93]
    W.J. Fokkink. An elimination theorem for regular behaviours with integration. Technical report, CWI, Amsterdam, 1993.Google Scholar
  6. [GL92]
    J.C. Godskesen and K.G. Larsen. Real-time calculi and expansion theorems. In R. Shyamasundar, editor, Proceedings 12 th Conference on Foundations of Software Technology and Theoretical Computer Science, New Delhi, India, LNCS 652, pages 302–315. Springer-Verlag, 1992.Google Scholar
  7. [Klu91]
    A.S. Klusener. Completeness in real time process algebra. In J.C.M. Baeten and J.F. Groote, editors, Proceedings CONCUR 91, Amsterdam, LNCS 527, pages 376–392. Springer-Verlag, 1991.Google Scholar
  8. [Mil84]
    R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439–466, 1984.CrossRefGoogle Scholar
  9. [MT90]
    F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, LNCS 458, pages 401–415. Springer-Verlag, 1990.Google Scholar
  10. [NS90]
    X. Nicollin and J. Sifakis. ATP: An algebra for timed processes. Technical Report RT-C26, IMAG, Laboratoire de Génie informatique, Grenoble, 1990.Google Scholar
  11. [RR88]
    M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoretical Computer Science, 58:249–261, 1988.CrossRefGoogle Scholar
  12. [Wan90]
    Y. Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, Göteborg, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Willem Jan Fokkink
    • 1
  1. 1.CWIAB AmsterdamThe Netherlands

Personalised recommendations