Advertisement

Abstract timed observation and process algebra

  • Alan Jeffrey
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 527)

Abstract

In this paper, we investigate the notion of observation in a partially ordered time domain. We present an algebraic structure to represent such an observation, and use it to define a process algebra. It is then given an operational and denotational semantics, and we see that denotational equivalence is the same as may testing.

Keywords

Operational Semantic Label Transition System Process Algebra Denotational Semantic Observation Space 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BB90]
    J. C. M. Baeten and J. A. Bergstra. Real space process algebra. Technical Report P9005, Programming Research Group, University of Amsterdam, 1990.Google Scholar
  2. [BB91a]
    J. C. M. Baeten and J. A. Bergstra. Asynchronous communication in real space process algebra. In Proc. Chalmers Workshop on Concurrency. Department of Computer Sciences, Chalmers University, 1991.Google Scholar
  3. [BB91b]
    J. C. M. Baeten and J. A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142–188, 1991.Google Scholar
  4. [BHR84]
    S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. JACM, 31(3):560–599, July 1984.Google Scholar
  5. [BK85]
    J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77–121, 1985.Google Scholar
  6. [BW90]
    J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.Google Scholar
  7. [DS89]
    Jim Davies and Steve Schneider. An introduction to timed CSP. Technical monograph PRG-75, Oxford University Computing Laboratory, 1989.Google Scholar
  8. [Gis88]
    Jay L. Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199–224, 1988.Google Scholar
  9. [Hen88]
    M. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988.Google Scholar
  10. [Hoa85]
    C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  11. [HR90]
    M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2/90, University of Sussex, Computer Science Department, 1990.Google Scholar
  12. [Jef91a]
    Alan Jeffrey. An algebraic structure for timed observation. In Proc. Chalmers Workshop on Concurrency. Department of Computer Sciences, Chalmers University, 1991.Google Scholar
  13. [Jef91b]
    Alan Jeffrey. Discrete timed CSP. PMG Memo 79, Department of Computer Sciences, Chalmers University, 1991.Google Scholar
  14. [Jef91c]
    Alan Jeffrey. A linear time process algebra. To be presented at CAV 91, 1991.Google Scholar
  15. [Mil80]
    Robin Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980. LNCS 92.Google Scholar
  16. [Mil83]
    Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, pages 267–310, 1983.Google Scholar
  17. [Mil89]
    Robin Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  18. [MT90]
    F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proc. Concur 90, pages 401–415. Springer-Verlag, 1990. LNCS 458.Google Scholar
  19. [Mur91a]
    David Murphy. The physics of observation: A perspective for concurrency theorists. Submitted to the Bulletin of the EATCS, 1991.Google Scholar
  20. [Mur91b]
    David Murphy. Testing, betting and true concurrency. To be presented at Concur 91, 1991.Google Scholar
  21. [NS90]
    X. Nicollin and J. Sifakis. The algebra of timed processes ATP: Theory and application. Technical Report RT-C26, Laboratoire de Génie Informatique de Grenoble, 1990.Google Scholar
  22. [Ree88]
    George M. Reed. A Uniform Mathematical Theory for Real-time Distributed Computing. D.Phil thesis, Oxford University, 1988.Google Scholar
  23. [RR86]
    G. M. Reed and A. W. Roscoe. A timed model for communicating sequential processes. In Proc. ICALP 86, pages 314–323. Springer-Verlag, 1986, LNCS 226.Google Scholar
  24. [Sch91]
    Steve Schneider. An operational semantics for timed CSP. In Proc. Chalmers Workshop on Concurrency, 1991.Google Scholar
  25. [Wan90]
    Wang Yi. Real-time behaviour of asynchronous agents. In Proc. Concur 90, pages 502–520. Springer-Verlag, 1990. LNCS 458.Google Scholar
  26. [Wan91]
    Wang Yi. CCS + time = an interleaving model for real time systems. To be presented at ICALP 91, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Alan Jeffrey
    • 1
  1. 1.Department of Computer SciencesGöteborgSweden

Personalised recommendations