Recommendations
- Fair Petri nets and structural induction for rings of processes
- Computer Science Logic
- An automata-theoretic approach to the verification of distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
- Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
Cites work
- “Sometimes” and “not never” revisited
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Characterizing finite Kripke structures in propositional temporal logic
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 3305022 (Why is no real title available?)
- Reasoning about networks with many identical finite state processes
Cited in
(43)- Fair Petri nets and structural induction for rings of processes
- Parameterized model checking of rendezvous systems
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
- On pebble automata for data languages with decidable emptiness problem
- Parameterized model checking of networks of timed automata with Boolean guards
- View abstraction for systems with component identities
- Verification of agent navigation in partially-known environments
- Compositional verification of smart contracts through communication abstraction
- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Formal verification of mobile robot protocols
- Compositional analysis for verification of parameterized systems
- An approach to the verification of symmetric parameterized distributed systems
- Verification of parameterized communicating automata via split-width
- Model checking parameterised multi-token systems via the composition method
- Local symmetry and compositional verification
- On temporal logics with data variable quantifications: decidability and complexity
- Parameterized Verification of Communicating Automata under Context Bounds
- Learning Meets Verification
- Invisible Safety of Distributed Protocols
- Liveness by Invisible Invariants
- scientific article; zbMATH DE number 1863180 (Why is no real title available?)
- Implementation and verification of ring termination detection protocols using structured rv-systems
- Regular model checking using widening techniques
- Parametrized invariance for infinite state processes
- Investigating a claim for Russian priority in the abstract definition of a ring
- Multi-parameterised compositional verification of safety properties
- Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- An automata-theoretic approach to the verification of distributed algorithms
- On Verifying Fault Tolerance of Distributed Protocols
- Symbolic model checking with rich assertional languages
- Automatic verification of parameterized networks of processes
- An invariant-based approach to the verification of asynchronous parameterized networks
- Model and program repair via group actions
- Round- and context-bounded control of dynamic pushdown systems
- On the satisfiability of local first-order logics with data
- Automatic WSTS-based repair and deadlock detection of parameterized systems
- Model and program repair via group actions and structure unwinding
- Title not available (Why is no real title available?)
- On notions of regularity for data languages
- Feature interaction detection by pairwise analysis of LTL properties -- A case study
- Parameterized verification of time-sensitive models of ad hoc network protocols
This page was built for publication: On Reasoning About Rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696925)
