Information and Computation
Proof-checking a data link protocol
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
The Expressive Power of Implicit Specifications
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Ideal Specification Formalism + Expressivity + Compositionality + Decidability + Testability + ..
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Inference in Hidden Markov Models (Springer Series in Statistics)
Inference in Hidden Markov Models (Springer Series in Statistics)
Taming interface specifications
CONCUR 2005 - Concurrency Theory
RT-MaC: Runtime Monitoring and Checking of Quantitative and Probabilistic Properties
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Monitoring Interfaces for Faults
Electronic Notes in Theoretical Computer Science (ENTCS)
Monitoring temporal properties of stochastic systems
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Monitoring off-the-shelf components
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Efficient monitoring of ω-languages
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Monitorability of stochastic dynamical systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Runtime monitoring of stochastic cyber-physical systems with hybrid state
RV'11 Proceedings of the Second international conference on Runtime verification
| Hi-index | 0.00 |
We present highly accurate deterministic, probabilistic andhybrid methods for monitoring the full range of ω-regularproperties, specified as Streett automata, of stochastic systemsmodeled as Hidden Markov Chains. The deterministic algorithmsemploy timeouts that are set dynamically to achieve desiredaccuracy. The probabilistic algorithms employ coin tossing and cangive highly accurate monitors when the system behavior is notknown. The hybrid algorithms combine both these techniques. Themonitoring algorithms have been implemented as a tool. The tooltakes a high level description of an application with probabilitiesand also a Streett automaton that specifies the property to bemonitored. It generates a monitor for monitoring computations ofthe application. Experimental results comparing the effectivenessof the different algorithms are presented.