MoL-2017-24: de Hoop, Zeno (2017) Context-Free Processes and Push-Down Processes. [Report]
Preview |
Text
MoL-2017-24.text.pdf Download (486kB) | Preview |
Abstract
The purpose of this thesis is to examine in which cases context-free processes and push-down processes are the same. In particular, we depart from the well-known case of language-equivalence and instead look at processes using process theory and more fine-grained equivalences, such as bisimulation and contrasimulation. We identify two difficulties when looking at process specifications: head-recursion and transparency. Here, two new results are achieved: we prove that when excluding transparency, context-free processes and push-down processes are equivalent up to at least branching bisimilarity without explicit divergences. When including transparency, we prove that they are equivalent up to at least contrasimulation. Finally, we present a new result where, when one excludes head-recursion and adopts a modified definition of sequential composition, one can improve the equivalence to strong bisimulation. Some of the drawbacks of this modification are discussed as well.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2017-24 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2017 |
| Subjects: | Computation Logic |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 12 Oct 2017 14:36 |
| Last Modified: | 12 Oct 2017 14:36 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1561 |
Actions (login required)
 |
View Item |
