Comparative semantics for a real-time programming language with integration

  • Franck van Breugel
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)


An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. Integration enables us to specify a restricted form of unbounded non-determinism. For example, the execution of an action at an arbitrary moment in a time interval can be specified using the concept of integration. The operational and the denotational model are proved to be equivalent using a general method based on higher-order transformations and complete metric spaces. Banach's fixed point theorem, which states that a contraction on a complete metric space has a unique fixed point, will be used to define and to compare semantic models. Also Michael's theorem, which roughly states that a compact union of compact sets is compact, will be used for the definition of semantic models.


Semantic Model Semantic Operator Unique Fixed Point Atomic Action Label Transition System 
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.


  1. [1]
    K.R. Apt and G.D. Plotkin. Countable Non-Determinism and Random Assignment. Journal of the ACM 33 (1986), 724–767.Google Scholar
  2. [2]
    J.C.M. Baeten and J.A. Bergstra. Real-Time Process Algebra. Report P8916, Programming Research Group, University of Amsterdam, Amsterdam (1989).Google Scholar
  3. [3]
    J.W. de Bakker, J.A. Bergstra, J.W. Klop and J.-J.Ch. Meyer. Linear Time and Branching Time Semantics for Recursion with Merge. Theoretical Computer Science 34 (1984), 135–156.Google Scholar
  4. [4]
    J.W. de Bakker and J.N. Kok. Comparative Metric Semantics for Concurrent Prolog. Theoretical Computer Science 75 (1990), 15–43.Google Scholar
  5. [5]
    J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog and J.I. Zucker. Contrasting Themes in the Semantics of Imperative Concurrency. Current Trends in Concurrency: Overviews and Tutorials (J.W. de Bakker, W.P. de Roever and G. Rozenberg, eds.), Lecture Notes in Computer Science 224, Springer (1986), 51–121.Google Scholar
  6. [6]
    J.W. de Bakker, J.-J.Ch. Meyer and E.-R. Olderog. Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency. Theoretical Computer Science 49 (1987), 87–112.Google Scholar
  7. [7]
    J.W. de Bakker and J.-J.Ch. Meyer. Metric Semantics for Concurrency. BIT 28 (1988), 504–529.Google Scholar
  8. [8]
    J.W. de Bakker and E.P. de Vink. CCS for OO and LP. This volume.Google Scholar
  9. [9]
    J.W. de Bakker and J.I. Zucker. Processes and the Denotational Semantics of Concurrency. Information and Control 54 (1982), 70–120.Google Scholar
  10. [10]
    G. Berry and L. Cosserat. The ESTEREL Synchronous Programming Language and its Semantics. Proceedings CMU Seminar on Concurrency (S.D. Brookes, A.W. Roscoe and G. Winksel, eds.), Lecture Notes in Computer Science 197, Springer (1985), 389–448.Google Scholar
  11. [11]
    F. van Breugel. Semantic Models for a Language with Timed Atomic Actions. Report IR-218, Vrije Universiteit, Amsterdam (1990).Google Scholar
  12. [12]
    F. van Breugel. Comparative Semantics for a Real-Time Programming Language with Integration. Report IR-239, Vrije Universiteit, Amsterdam (1991).Google Scholar
  13. [13]
    R. Cleaveland and M. Hennessy. Priorities in Process Algebra. Information and Computation 87 (1990), 58–77.Google Scholar
  14. [14]
    J.W. Davies and S.A. Schneider. An Introduction to Timed CSP. Technical Monograph PRG-75, Oxford University Computing Laboratory, Oxford (1989).Google Scholar
  15. [15]
    A. Goswami and M. Joseph. Semantics of Real-Time Distributed Programs. Proceedings International Conference on Concurrency (F.H. Vogt, ed.), Lecture Notes in Computer Science 335, Springer (1988), 292–306.Google Scholar
  16. [16]
    J.F. Groote. Specification and Verification of Real-Time Systems in ACP. Proceedings 10th International IFIP WG 6.1, Symposium on Protocol Specification, Testing and Verification, Ottawa (1990), 259–270.Google Scholar
  17. [17]
    J.F. Groote and F.W. Vaandrager. Structured Operational Semantics and Bisimulation as a Congruence. Proceedings 16th International Colloquium on Automata, Languages and Programming (G. Ausiello, M. Dezani-Ciancaglini and S. Ronchi Della Rocca, eds.), Lecture Notes in Computer Science 372, Springer (1989), 423–438.Google Scholar
  18. [18]
    M. Hennessy and G.D. Plotkin. Full Abstraction for a Simple Parallel Programming Language. Proceedings 8th Mathematical Foundations of Computer Science (J. Bečvarř, ed.), Lecture Notes in Computer Science 74, Springer (1979), 108–120.Google Scholar
  19. [19]
    M. Hennessy and T. Regan. A Temporal Process Algebra. Report 2-90, University of Sussex, Brighton (1990).Google Scholar
  20. [20]
    W.H. Hesselink. Interpretations of Recursion under Unbounded Non-Determinacy. Theoretical Computer Science 59 (1988), 211–234.Google Scholar
  21. [21]
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International (1985).Google Scholar
  22. [22]
    F. Jahanian and A. Mok. Safety Analysis of Timing Properties in Real-Time Systems. IEEE Transactions on Software Engineering 12 (1986), 890–904.Google Scholar
  23. [23]
    J.N. Kok and J.J.M.M. Rutten. Contractions in Comparing Concurrency Semantics. Theoretical Computer Science 76 (1990), 179–222.Google Scholar
  24. [24]
    R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth and S. Arun-Kumar. Compositional Semantics for Real-Time Distributed Computing. Information and Computation 79 (1988), 210–256.Google Scholar
  25. [25]
    M. Nivat. Infinite Words, Infinite Trees, Infinite Computations. Foundations of Computer Science (J.W. de Bakker and J. van Leeuwen, eds.), Mathematical Centre Tracts 109, Mathematical Centre, Amsterdam (1979), 3–52.Google Scholar
  26. [26]
    G.M. Reed. A Hierarchy of Domains for Real-Time Distributed Computing. To appear in Proceedings Mathematical Foundations of Programming Languages and Semantics, Lecture Notes in Computer Science, Springer (1991).Google Scholar
  27. [27]
    G.M. Reed and A.W. Roscoe. A Timed Model for Communicating Sequential Processes. Theoretical Computer Science 58 (1988), 249–261.Google Scholar
  28. [28]
    J.J.M.M. Rutten. Semantic Correctness for a Parallel Object-Oriented Language. SIAM Journal of Computation 19 (1990), 341–383.Google Scholar
  29. [29]
    S.A. Smolka and B. Steffen. Priority as Extremal Probability. Proceedings Conference on Theories of Concurrency: Unification and Extension (J.C.M. Baeten and J.W. Klop, eds.), Lecture Notes in Computer Science 458 (1990), 456–466.Google Scholar
  30. [30]
    J.A. Stankovic. A Serious Problem for Next-Generation Systems. Computer 21 (1988), 10–19.Google Scholar
  31. [31]
    N. Wirth. Towards a Discipline of Real-Time Programming. Communications of the ACM 20 (1977), 577–583.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Franck van Breugel
    • 1
  1. 1.Department of Mathematics and Computer ScienceVrije UniversiteitAmsterdam

Personalised recommendations