Synthesis of self-stabilising and Byzantine-resilient distributed systems
From MaRDI portal
(Redirected from Publication:4633532)
Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Recommendations
Cited in
(13)- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
- Detecting unrealizability of distributed fault-tolerant systems
- Synthesis of distributed algorithms with parameterized threshold guards
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Synthesis of fault-tolerant distributed systems
- Automated synthesis of distributed self-stabilizing protocols
- Robust and scalable middleware for selfish-computer systems
- ASSESS: a tool for automated synthesis of distributed self-stabilizing algorithms
- Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
- Near-optimal self-stabilising counting and firing squads
- Synchronous counting and computational algorithm design
This page was built for publication: Synthesis of self-stabilising and Byzantine-resilient distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633532)