Communication problems in the π-calculus

Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2599

Full metadata record

DC Field	Value	Language
dc.contributor.author	Benevides, Mário Roberto Folhadela	-
dc.contributor.author	Protti, Fábio	-
dc.date.accessioned	2017-08-04T13:38:01Z	-
dc.date.available	2023-12-21T03:03:27Z	-
dc.date.issued	2000-12-31	-
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.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.language	eng	pt_BR
dc.relation.ispartof	Relatório Técnico NCE	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.subject	Cálculo	pt_BR
dc.subject	Sistema de comunicação	pt_BR
dc.subject	Systems communicating	en
dc.subject	Process calculus	en
dc.title	Communication problems in the π-calculus	en
dc.type	Relatório	pt_BR
dc.publisher.country	Brasil	pt_BR
dc.publisher.department	Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais	pt_BR
dc.subject.cnpq	CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO	pt_BR
dc.citation.issue	0200	pt_BR
dc.embargo.terms	aberto	pt_BR
Appears in Collections:	Relatórios

Files in This Item:

File	Description	Size	Format
02_00.pdf		696.21 kB	Adobe PDF	View/Open

Pantheon Institutional repository