Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The synthesis of communication protocols

From MaRDI portal
Publication:1098296
Jump to:navigation, search

DOI10.1007/BF01762126zbMath0636.68052OpenAlexW2002371579MaRDI QIDQ1098296

George Papageorgiou, Christos H. Papadimitriou, Foto N. Afrati

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01762126


zbMATH Keywords

polynomial-time algorithmfinite automatadistributed systemsynthesis algorithmPSPACE-completecommunication protocolsknowledge logiccommunicating


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25) Theory of software (68N99)


Related Items

The synthesis of communication protocols ⋮ Factorisation of finite state machines under strong and observational equivalences



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • How processes learn
  • The synthesis of communication protocols
  • Knowledge and common knowledge in a distributed environment
  • Recoverability of Communication Protocols--Implications of a Theoretical Study
  • A model-theoretic analysis of knowledge
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1098296&oldid=13131589"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki