Sciweavers

4 search results - page 1 / 1
» A Formalized Theory for Verifying Stability and Convergence ...
Sort
View
TPHOL
2008
IEEE
13 years 11 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy
ASE
2002
160views more  ASE 2002»
13 years 4 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
FORMATS
2008
Springer
13 years 6 months ago
Convergence Verification: From Shared Memory to Partially Synchronous Systems
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
K. Mani Chandy, Sayan Mitra, Concetta Pilotto
FUIN
2006
85views more  FUIN 2006»
13 years 4 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang