Parameterized complexity of safety of threshold automata
From MaRDI portal
Cites work
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Asynchronous consensus and broadcast protocols
- Bin packing with fixed number of bins revisited
- Complexity of Liveness in Parameterized Systems
- Computation in networks of passively mobile finite-state sensors
- Decidability of parameterized verification
- Fine-grained complexity of safety verification
- scientific article; zbMATH DE number 1830912 (Why is no real title available?)
- Logics for continuous reachability in Petri nets and vector addition systems with states
- Non-blocking atomic commit in asynchronous distributed systems with failure detectors
- On atomicity in presence of non-atomic writes
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- On the Complexity of Bounded Context Switching.
- Parameterized algorithms
- Reachability in parameterized systems: all flavors of threshold automata
- Reasoning about systems with many processes
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- The Complexity of Predicting Atomicity Violations
- Unreliable failure detectors for reliable distributed systems
- Verification of randomized consensus algorithms under round-rigid adversaries
This page was built for publication: Parameterized complexity of safety of threshold automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839865)
