On the decidability of fragments of the asynchronous π-calculus |
| |
Authors: | Roberto M Amadio Charles Meyssonnier |
| |
Affiliation: | aLaboratoire d'Informatique Fondamentale de Marseille, CMI, 39 rue Joliot-Curie, 13453, Marseille, France |
| |
Abstract: | We study the decidability of a reachability problem for various fragments of the asynchronous π-calculus. We consider the combination of three main features: name generation, name mobility, and unbounded control. We show that the combination of name generation with either name mobility or unbounded control leads to an undecidable fragment. On the other hand, we prove that name generation without name mobility and with bounded control is decidable by reduction to the coverability problem for Petri Nets. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|