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 satifiable; 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.
- Automated synthesis of distributed self-stabilizing protocols
- Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets
- scientific article; zbMATH DE number 1418467
- Protocol analysis and synthesis by structured partitions
- Designing secure communication protocols from trust specifications
- A model-theoretic analysis of knowledge
- How processes learn
- scientific article; zbMATH DE number 3767031 (Why is no real title available?)
- scientific article; zbMATH DE number 3482375 (Why is no real title available?)
- scientific article; zbMATH DE number 3621103 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Knowledge and common knowledge in a distributed environment
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- The synthesis of communication protocols
- An alternative implementation of communication primitives
- The synthesis of communication protocols
- A methodology for constructing communication protocols with multiple concurrent functions
- Factorisation of finite state machines under strong and observational equivalences
- The formalization and analysis of a communications protocol
- Designing secure communication protocols from trust specifications
- A new formal method for communication protocol specification
- Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies
- Network-wide configuration synthesis
- Automated synthesis of application-layer connectors from automata-based specifications
- Synthesizing distributed protocol specifications from a UML state machine modeled service specification
- Automated synthesis of application-layer connectors from automata-based specifications
- Knowledge-based synthesis of distributed systems using event structures
- scientific article; zbMATH DE number 3967907 (Why is no real title available?)
- scientific article; zbMATH DE number 3974265 (Why is no real title available?)
- Protocol analysis and synthesis by structured partitions
- Constructing submodule specifications and network protocols
- A little knowledge goes a long way
- scientific article; zbMATH DE number 1088213 (Why is no real title available?)
- Automated synthesis of distributed self-stabilizing protocols
- scientific article; zbMATH DE number 772001 (Why is no real title available?)
- scientific article; zbMATH DE number 865194 (Why is no real title available?)
- Comments on deriving protocol specifications from service specifications written in LOTOS
- Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets
- Abstract switches: a distributed model of communication and computation
- Logic for Programming, Artificial Intelligence, and Reasoning
- Device driver and DMA controller synthesis from HW/SW communication protocol specifications
- Defining, analysing and implementing communication protocols using attribute grammars
This page was built for publication: The synthesis of communication protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098296)
