Live briefing
Everything about Reachability analysis
Solution to the reachability problem in distributed systems (computer science)
Reachability analysis is a solution to the reachability problem in the particular context of distributed systems. It is used to determine which global states can be reached by a distributed system which consists of a certain number of local entities that communicated by the exchange of messages. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Reachability analysisA 5-minute orientation
- Skim a recent paper: Data-Driven Reachability Analysis From Noisy DataInfluential work since 2022
- Pick up a classic book: Reachability ProblemsThe most-reprinted book on the subject
- Read the landmark paper: Set Propagation Techniques for Reachability AnalysisCited 264 times
- Go sideways: Communicating finite-state machineA closely related topic
- Go sideways: Protocol engineeringA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Set Propagation Techniques for Reachability Analysis
Program analysis via graph reachability
Ellipsoidal techniques for reachability analysis: internal approximation
An improved protocol reachability analysis technique
Context constraints for compositional reachability analysis
Checking safety properties using compositional reachability analysis
Reachability Analysis over Term Rewriting Systems
Reachability Analysis of Neural Feedback Loops
🆕 Influential since 2022
Data-Driven Reachability Analysis From Noisy Data
Reachability Analysis of Cyber-Physical Systems Under Stealthy Attacks
Robust data-driven predictive control using reachability analysis
Safe Reinforcement Learning Using Black-Box Reachability Analysis
Formal Safety Net Control Using Backward Reachability Analysis
📚 Books worth reading
Reachability ProblemsParosh Aziz Abdulla, Igor Potapov · 2010
Mathematical structures for computer scienceJudith L. Gersting · 1982
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Validation of communications systems with SDLLaurent Doldi · 2003
The C# programming languageAnders Hejlsberg, Scott Wiltamuth · 2004
Introduction to Constraint DatabasesPeter Revesz · 2002
Stochastic reachability analysis of hybrid systemsLuminita Manuela Bujorianu · 2012
Understanding Petri NetsWolfgang Reisig · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Communicating finite-state machine In computer science, a communicating finite-state machine is a finite-state machine labeled with "receive" and "send" operations over some alphabet of…
- Protocol engineering Protocol engineering is the application of systematic methods to the development of communication protocols. It uses many of the principles of software…
- Construction and Analysis of Distributed Processes CADP (Construction and Analysis of Distributed Processes) is a toolbox for the design of communication protocols and distributed systems. CADP is developed…
- Input/output automaton Input/output automata provide a formal model, applicable in describing most types of an asynchronous concurrent system. On its own, the I/O automaton model…
- Communication protocol A communication protocol is a system of rules that allows two or more entities of a communications system to transmit information. The protocol defines…
- Commitment ordering Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related…
- Model checking In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification…
- Channel system (computer science) In computer science, a channel system is a finite-state machine similar to communicating finite-state machine in which there is a single system communicating…