Communication problems in the π-calculus
| dc.citation.issue | 0200 | pt_BR |
| dc.creator | Benevides, Mário Roberto Folhadela | |
| dc.creator | Protti, Fábio | |
| dc.date.accessioned | 2017-08-04T13:38:01Z | |
| dc.date.available | 2026-05-16T03:03:57Z | |
| dc.date.issued | 2000-12-31 | |
| dc.description.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]. | en |
| dc.embargo.terms | aberto | pt_BR |
| dc.identifier.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) | pt_BR |
| dc.identifier.uri | http://hdl.handle.net/11422/2599 | |
| dc.language | eng | pt_BR |
| dc.publisher.country | Brasil | pt_BR |
| dc.publisher.department | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais | pt_BR |
| dc.relation.ispartof | Relatório Técnico NCE | pt_BR |
| dc.rights | Acesso Aberto | pt_BR |
| dc.subject | Systems communicating | en |
| dc.subject | Process calculus | en |
| dc.subject.cnpq | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO | pt_BR |
| dc.title | Communication problems in the π-calculus | en |
| dc.type | Relatório | pt_BR |