ACM Transactions on Computational Logic (TOCL)
TAME: Using PVS strategies for special-purpose theorem proving
Annals of Mathematics and Artificial Intelligence
Mode and Termination Checking for Higher-Order Logic Programs
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Modelisation of Timed Automata in Coq
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
I/O Automata and Beyond: Temporal Logic and Abstraction in Isabelle
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Transcendental Functions and Continuity Checking in PVS
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A verification framework for hybrid systems
A verification framework for hybrid systems
PVS Strategies for Proving Abstraction Properties of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Safety verification of an aircraft landing protocol: a refinement approach
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Finding lexicographic orders for termination proofs in Isabelle/HOL
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
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
On Convergence of Concurrent Systems under Regular Interactions
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Differentially private iterative synchronous consensus
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
| Hi-index | 0.00 |
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for verifying stability or convergence of automata is currently not available. In this paper, we formalize one such theory proposed by Tsitsiklis [27]. We build on the existing PVS metatheory for untimed, timed, and hybrid input/output automata, and incorporate the concepts about fairness, stability, Lyapunov-like functions, and convergence. The resulting theory provides two sets of sufficient conditions, which when instantiated and verified for particular automata, guarantee convergence and stability, respectively.