Lazy reachability analysis in distributed systems
From MaRDI portal
Publication:4608669
Recommendations
- Let's be lazy, we have time -- or, lazy reachability analysis for timed automata
- A work-efficient distributed algorithm for reachability analysis.
- A lazy query scheme for reachability analysis in Petri nets
- A work-efficient distributed algorithm for reachability analysis
- d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
Cited in
(14)- d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
- A lazy query scheme for reachability analysis in Petri nets
- Reachability analysis on distributed executions
- Reachability in networks of register protocols under stochastic schedulers
- A scalable parallel algorithm for reachability analysis of very large circuits
- A work-efficient distributed algorithm for reachability analysis
- Distributed Lyapunov Functions in Analysis of Graph Models of Software
- Let's be lazy, we have time -- or, lazy reachability analysis for timed automata
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- Correct Hardware Design and Verification Methods
- Distributed algorithms for time optimal reachability analysis
- Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?
- Mitigating multi-target attacks in hash-based signatures
- The automatic detection of token structures and invariants using SAT checking
This page was built for publication: Lazy reachability analysis in distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608669)