Selective monitoring

DOI10.1016/j.jcss.2020.09.003zbMath1477.68186OpenAlexW4210581061MaRDI QIDQ2221805

Radu Grigore, Stefan Kiefer

Publication date: 2 February 2021

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2020.09.003

zbMATH Keywords

Markov chainsautomatalanguage equivalenceprobabilistic systemsruntime monitoring

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monitoring networks through multiparty session types
• On NFAs where all states are final, initial, or both
• Maximum-likelihood estimation for hidden Markov models
• The power of symbolic automata and transducers
• Accurate Approximate Diagnosability of Stochastic Systems
• Automata theory in nominal sets
• Semantics and Algorithms for Parametric Monitoring
• A polynomial algorithm for testing diagnosability of discrete-event systems
• Diagnosability of discrete-event systems
• Diagnosability of stochastic discrete-event systems
• Compositional Shape Analysis by Means of Bi-Abduction

This page was built for publication: Selective monitoring