Using Session Types for Reasoning About Boundedness in the Pi-Calculus
The classes of depth-bounded and name-bounded processes are fragments of the pi-calculus for which some of the decision problems that are undecidable for the full calculus become decidable. P is depth-bounded at level k if every reduction sequence for P contains successor processes with at most k ac...
| Hoofdauteur: | |
|---|---|
| Formaat: | Artikel |
| Taal: | English |
| Gepubliceerd in: |
Open Publishing Association
2017-08-01
|
| Reeks: | Electronic Proceedings in Theoretical Computer Science |
| Online toegang: | http://arxiv.org/pdf/1709.00829v1 |