Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2599
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBenevides, Mário Roberto Folhadela-
dc.contributor.authorProtti, Fábio-
dc.date.accessioned2017-08-04T13:38:01Z-
dc.date.available2017-08-06T03:00:16Z-
dc.date.issued2000-12-31-
dc.identifier.citationBENEVIDES, 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.urihttp://hdl.handle.net/11422/2599-
dc.description.abstractIn 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.languageengpt_BR
dc.relation.ispartofRelatório Técnico NCEpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectCálculopt_BR
dc.subjectSistema de comunicaçãopt_BR
dc.subjectSystems communicatingen
dc.subjectProcess calculusen
dc.titleCommunication problems in the π-calculusen
dc.typeRelatóriopt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionaispt_BR
dc.subject.cnpqCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAOpt_BR
dc.citation.issue0200pt_BR
dc.embargo.termsabertopt_BR
Appears in Collections:Relatórios

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.