The synthesis of communication protocols

Afrati, F; Papadimitriou, CH; Papageorgiou, G

dc.contributor.author	Afrati, F	en
dc.contributor.author	Papadimitriou, CH	en
dc.contributor.author	Papageorgiou, G	en
dc.date.accessioned	2014-03-01T01:07:19Z
dc.date.available	2014-03-01T01:07:19Z
dc.date.issued	1988	en
dc.identifier.issn	0178-4617	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9924
dc.subject	Communication protocols	en
dc.subject	Knowledge logic	en
dc.subject	Polynomial algorithm	en
dc.subject	PSPACE-complete	en
dc.subject	Synthesis algorithm	en
dc.subject.classification	Computer Science, Software Engineering	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	COMPUTER PROGRAMMING - Algorithms	en
dc.subject.other	COMMUNICATION PROTOCOLS	en
dc.subject.other	POLYNOMIAL ALGORITHMS	en
dc.subject.other	SYNTHESIS ALGORITHMS	en
dc.subject.other	COMPUTER SYSTEMS, DIGITAL	en
dc.title	The synthesis of communication protocols	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF01762126	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF01762126	en
heal.language	English	en
heal.publicationDate	1988	en
heal.abstract	We define a notation (specification language) for describing desired patterns of communication among components of a distributed system through multiport, unreliable channels. Our language specifies the network topology, and the kinds of information transmission desired. We give a polynomial-time algorithm for determining whether a specification is satisfiable; our algorithm can actually construct a protocol that achieves the specified exchange of information, optimized with respect to two possible criteria. Examples suggest that our method can automatically synthesize reasonably complex protocols. © 1988 Springer-Verlag New York Inc.	en
heal.publisher	Springer-Verlag	en
heal.journalName	Algorithmica	en
dc.identifier.doi	10.1007/BF01762126	en
dc.identifier.isi	ISI:A1988N556800008	en
dc.identifier.volume	3	en
dc.identifier.issue	1-4	en
dc.identifier.spage	451	en
dc.identifier.epage	472	en