Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Theoretical Computer Science
Distributed Algorithms
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
Translating timed i/o automata specifications for theorem proving in PVS
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Model checking the time to reach agreement
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Real-time model checking is really simple
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
On Convergence of Concurrent Systems under Regular Interactions
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Towards a verification framework for faulty message passing systems in PVS
Innovations in Systems and Software Engineering
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Differentially private iterative synchronous consensus
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
| Hi-index | 0.00 |
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies a subclass of such systems for which convergence properties can be verified based on the proof of convergence for the corresponding discrete-time shared state system. The proof technique extends to the class of systems in which an agent's state evolves continuously over time. The proof technique has been formalized in the PVS interface for timed I/O automata and applied to verify convergence of a mobile agent pattern formation algorithm.