Skip to main content

A universal reactive machine

  • Contributions
  • Conference paper
  • First Online:
CONCUR '97: Concurrency Theory (CONCUR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1243))

Included in the following conference series:

  • 128 Accesses

Abstract

Turing showed the existence of a model universal for the set of Turing machines in the sense that given an encoding of any Turing machine as input the universal Turing machine simulates it. We introduce the concept of universality for reactive systems and construct a CCS process universal in the sense that, given an encoding of any CCS process, it behaves like this process up to weak bisimulation. This construction has a rather non-constructive use of silent actions and we argue that this would be the case for any universal CCS process.

Work supported by the Danish Technical Research Council, project CoDesign.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam, 1990.

    Google Scholar 

  2. Robin Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  3. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes (Parts I and II). Information and Computation, 100:1–77, 1992.

    Article  Google Scholar 

  4. Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. (Ser. 2), 42:230–265, 1937. A correction in volume 43 pp. 544–546.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andersen, H.R., Mørk, S., Sørensen, M.U. (1997). A universal reactive machine. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63141-5

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics