A Universal Reactive Machine

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

A Universal Reactive Machine

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

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

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 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 language	English
Title of host publication	Proceedings of CONCUR'97: Concurrency Theory, 8th International Conference, LNCS 1243
Place of Publication	Berlin, Heidelberg
Publisher	Springer Verlag
Publication date	1997
Pages	89-103
Publication status	Published - 1997
Event	CONCUR'97: Concurrency Theory, 8th International Conference - Warsaw, Poland Duration: 1 Jan 1997 → …

Conference

Conference	CONCUR'97: Concurrency Theory, 8th International Conference
City	Warsaw, Poland
Period	01/01/1997 → …

OpenUrl availability

Full text

Cite this

@inproceedings{fa8a68cb9cce4b2da8a671ed3b44ba6d,

title = "A Universal Reactive Machine",

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 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.",

author = "Andersen, {Henrik Reif} and Simon M{\o}rk and S{\o}rensen, {Morten U.}",

year = "1997",

language = "English",

pages = "89--103",

booktitle = "Proceedings of CONCUR'97: Concurrency Theory, 8th International Conference, LNCS 1243",

publisher = "Springer Verlag",

address = "Germany",

note = "CONCUR'97: Concurrency Theory, 8th International Conference ; Conference date: 01-01-1997",

}

TY - GEN

T1 - A Universal Reactive Machine

AU - Andersen, Henrik Reif

AU - Mørk, Simon

AU - Sørensen, Morten U.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

M3 - Article in proceedings

SP - 89

EP - 103

BT - Proceedings of CONCUR'97: Concurrency Theory, 8th International Conference, LNCS 1243

PB - Springer Verlag

CY - Berlin, Heidelberg

T2 - CONCUR'97: Concurrency Theory, 8th International Conference

Y2 - 1 January 1997

ER -