A Universal Reactive Machine

Henrik Reif Andersen, Simon Mørk, Morten U. Sørensen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


    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 asinput the universal Turing machine simulates it. We introduce the concept of universality for reactive systems and construct a CCS processuniversal in the sense that, given an encoding of any CCS process, it behaves like this process up to weak bisimulation. This construction has arather non-constructive use of silent actions and we argue that this would be the case for any universal CCS process.
    Original languageEnglish
    Title of host publicationProceedings of CONCUR'97: Concurrency Theory, 8th International Conference, LNCS 1243
    Place of PublicationBerlin, Heidelberg
    PublisherSpringer Verlag
    Publication date1997
    Publication statusPublished - 1997
    EventCONCUR'97: Concurrency Theory, 8th International Conference - Warsaw, Poland
    Duration: 1 Jan 1997 → …


    ConferenceCONCUR'97: Concurrency Theory, 8th International Conference
    CityWarsaw, Poland
    Period01/01/1997 → …

    Cite this