Checking strong open congruence in χ-calculus
Chen, Taolue and Zhou, J. and Han, Tingting and Lu, J. (2004) Checking strong open congruence in χ-calculus. Electronic Notes in Theoretical Computer Science 91 , pp. 4-20. ISSN 1571-0661.
|
Text (Refereed)
Checking Strong Open Congruence.pdf - Published Version of Record Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (267kB) | Preview |
Abstract
The χ-calculus is an important evolution for mobile process calculi. Open congruence is widely studied in χ-calculus. However, there still lacks an algorithm for checking this bisimulation relation. In this paper, the symbolic technique is applied to the research of χ-calculus and an efficient characterization for strong open congruence which does not involve quantification over substitutions is given. Based on it, an algorithm, which instantiates bound names 'on-the-fly', is developed to check strong open congruence for finite control processes.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 16 Feb 2021 19:24 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43070 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |