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.
|Title of host publication||Proceedings of CONCUR'97: Concurrency Theory, 8th International Conference, LNCS 1243|
|Place of Publication||Berlin, Heidelberg|
|Publication status||Published - 1997|
|Event||CONCUR'97: Concurrency Theory, 8th International Conference - Warsaw, Poland|
Duration: 1 Jan 1997 → …
|Conference||CONCUR'97: Concurrency Theory, 8th International Conference|
|Period||01/01/1997 → …|