Sciweavers

3122 search results - page 161 / 625
» A Theory of Network Equivalence
Sort
View
169
Voted
FSTTCS
2004
Springer
16 years 15 days ago
Verifying Probabilistic Procedural Programs
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
Javier Esparza, Kousha Etessami
184
Voted
ICARCV
2002
IEEE
132views Robotics» more  ICARCV 2002»
16 years 1 days ago
Integral quadratic constraint approach vs. multiplier approach
Integral quadratic constraints (IQC) arise in many optimal and/or robust control problems. The IQC approach can be viewed as a generalization of the classical multiplier approach ...
Minyue Fu, Soura Dasgupta, Yeng Chai Soh
181
Voted
TPHOL
2002
IEEE
16 years 14 hour ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
191
Voted
CDC
2009
IEEE
131views Control Systems» more  CDC 2009»
15 years 11 months ago
Optimal and adaptive battery discharge strategies for Cyber-Physical Systems
Abstract— We introduce a dynamic battery model that describes the variations of the capacity of a battery under time varying discharge current. This model is input-output equival...
Fumin Zhang, Zhenwu Shi
254
Voted
AISC
2010
Springer
15 years 11 months ago
Structured Formal Development with Quotient Types in Isabelle/HOL
General purpose theorem provers provide sophisticated proof methods, but lack some of the advanced structuring mechanisms found in specification languages. This paper builds on pr...
Maksym Bortin, Christoph Lüth