The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Asymptotic Optimization of a Nonlinear Hybrid System Governed by a Markov Decision Process
SIAM Journal on Control and Optimization
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Decidable Model Checking of Probabilistic Hybrid Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Towars a Theory of Stochastic Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Model Checking for Survivability
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
PHAVer: algorithmic verification of hybrid systems past HyTech
International Journal on Software Tools for Technology Transfer (STTT)
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
Performability assessment by model checking of Markov reward models
Formal Methods in System Design
Satisfaction meets expectations: computing expected values of probabilistic hybrid systems with SMT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Measurability and safety verification for stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
Stochastic differential dynamic logic for stochastic hybrid programs
CADE'11 Proceedings of the 23rd international conference on Automated deduction
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Game-based Abstraction and Controller Synthesis for Probabilistic Hybrid Systems
QEST '11 Proceedings of the 2011 Eighth International Conference on Quantitative Evaluation of SysTems
Average-price-per-reward games on hybrid automata with strong resets
International Journal on Software Tools for Technology Transfer (STTT) - VMCAI 2009
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Bisimulation for general stochastic hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Rare-event verification for stochastic hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Regularization of bellman equations for infinite-horizon probabilistic properties
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Synthesizing efficient controllers
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
A comparative analysis of decentralized power grid stabilization strategies
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
The joint consideration of randomness and continuous time is important for the formal verification of many real systems. Considering both facets is especially important for wireless sensor networks, distributed control applications, and many other systems of growing importance. Apart from proving the quantitative safety of such systems, it is important to analyze properties related to resource consumption (energy, memory, bandwidth, etc.) and properties that lie more on the economical side (monetary gain, the expected time or cost until termination, etc.). This paper provides a framework to decide such reward properties effectively for a generic class of models which have a discrete-continuous behaviour and involve both probabilistic as well as nondeterministic decisions. Experimental evidence is provided demonstrating the applicability of our approach.