@inproceedings{56766f984dc7490097725a23357d87e3,
title = "CCS with replication in the chomsky hierarchy: The expressive power of divergence",
abstract = "A remarkable result in [4] shows that in spite of its being less expressive than CCS w.r.t. weak bisimilarity, CCS! (a CCS variant where infinite behavior is specified by using replication rather than recursion) is Turing powerful. This is done by encoding Random Access Machines (RAM) in CCS!. The encoding is said to be non-faithful because it may move from a state which can lead to termination into a divergent one which do not correspond to any configuration of the encoded RAM. I.e., the encoding is not termination preserving. In this paper we study the existence of faithful encodings into CCS! of models of computability strictly less expressive than Turing Machines. Namely, grammars of Types 1 (Context Sensitive Languages), 2 (Context Free Languages) and 3 (Regular Languages) in the Chomsky Hierarchy. We provide faithful encodings of Type 3 grammars. We show that it is impossible to provide a faithful encoding of Type 2 grammars and that termination-preserving CCS! processes can generate languages which are not Type 2. We finally show that the languages generated by termination-preserving CCS! processes are Type 1 .",
author = "Jes{\'u}s Aranda and {Di Giusto}, Cinzia and Mogens Nielsen and Valencia, {Frank D.}",
year = "2007",
doi = "10.1007/978-3-540-76637-7_26",
language = "English",
isbn = "9783540766360",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "383--398",
booktitle = "Programming Languages and Systems - 5th Asian Symposium, APLAS 2007, Proceedings",
address = "Germany",
note = "5th Asian Symposium on Programming Languages and Systems, APLAS 2007 ; Conference date: 29-11-2007 Through 01-12-2007",
}