Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2599
Type: Relatório
Title: Communication problems in the π-calculus
Author(s)/Inventor(s): Benevides, Mário Roberto Folhadela
Protti, Fábio
Abstract: In this paper we deal with the notions of deadlock, starvation, and communication errors in the asynchronous polyadic π-calculus. We show that detecting deadlock or starvation in a given specification in π-calculus is an undecidable problem. We also extend the proof of undecidability of the notion of communication errors in the polyadic π-calculus presented in [14].
Keywords: Cálculo
Sistema de comunicação
Systems communicating
Process calculus
Subject CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO
Department : Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
In: Relatório Técnico NCE
Issue: 0200
Issue Date: 31-Dec-2000
Publisher country: Brasil
Language: eng
Right access: Acesso Aberto
Citation: BENEVIDES, M. R. F.; PROTTI, F. Communication problems in the [pi]-calculus. Rio de Janeiro: NCE, UFRJ, 2000. 09 p. (Relatório Técnico, 02/00)
URI: http://hdl.handle.net/11422/2599
Appears in Collections:Relatórios Técnicos e de Pesquisa

Files in This Item:
File Description SizeFormat 
02_00.pdf696,21 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.