- Sequential composition in the presence of intermediate termination
- extended abstract
- Electronic Proceedings in Theoretical Computer Science
- Pages (from-to)
- Document type
- Interfacultary Research Institutes
Faculty of Science (FNWI)
- Institute for Logic, Language and Computation (ILLC)
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and pushdown processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operational semantics for the sequential composition operator in the context of intermediate termination. With the revised operational semantics, we eliminate transparency, allowing us to establish a close correspondence between context-free processes and pushdown processes. Moreover,we prove the reactive Turing powerfulness of TCP with iteration and nesting with the revised operational semantics for sequential composition.
- go to publisher's site
- Other links
- Link to publication in Scopus
- EPTCS 255 : Proceedings Combined 24th International Workshop on
Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics : Berlin, Germany, 4th September 2017.
Edited by: Kirstin Peters and Simone Tini.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.