Sciweavers

4693 search results - page 75 / 939
» Verifying Hybrid Systems
Sort
View
99
Voted
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
15 years 6 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
134
Voted
TIME
2003
IEEE
15 years 5 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...
ESORICS
2010
Springer
15 years 1 months ago
Election Verifiability in Electronic Voting Protocols
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
Steve Kremer, Mark Ryan, Ben Smyth
FTRTFT
1998
Springer
15 years 4 months ago
A Modular Visual Model for Hybrid Systems
Visual description techniques are particularly important for the design of hybrid systems because specifications of such systems must usually be discussed between engineers from a ...
Radu Grosu, Thomas Stauner, Manfred Broy
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
15 years 7 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel