| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 423457 | Electronic Notes in Theoretical Computer Science | 2007 | 7 Pages |
Abstract
The pi-calculus and its many variations have received much attention in the literature. We discuss the standard early labelled transition system (lts) and outline an approach which decomposes the system into two components, one of which is presented in detail. The advantages of using the decomposition include a more complete understanding of the treatment of bound outputs in Pi as well as an lts which is more robust with respect to the addition and removal of language features. The present paper serves as an overview of some of the techniques involved and some of the goals of the ongoing work.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
