On the expressiveness and complexity of randomization in finite state monitors

DOI10.1145/1552285.1552287zbMATH Open1325.68128OpenAlexW1988501450MaRDI QIDQ3452222FDOQ3452222

Author name not available (Why is that?)

Publication date: 11 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1552285.1552287

Recommendations

• Probabilistic Automata for Safety LTL Specifications
• A theory of register monitors
• On the complexity of determinizing monitors
• The complexity of probabilistic verification
• Quantitative Automata under Probabilistic Semantics

zbMATH Keywords

randomizationtopologyprobabilistic automataruntime verificationomega automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Cited In (12)

• Alternating-time stream logic for multi-agent systems
• Probabilistic causes in Markov chains
• Decidable and expressive classes of probabilistic automata
• Probabilistic Büchi automata with non-extremal acceptance thresholds
• Title not available (Why is that?)
• Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
• Partial-Observation Stochastic Games
• Power of Randomization in Automata on Infinite Strings
• On the complexity of determinizing monitors
• The Effect of Tossing Coins in Omega-Automata
• Probabilistic Acceptors for Languages over Infinite Words
• A survey of partial-observation stochastic parity games

This page was built for publication: On the expressiveness and complexity of randomization in finite state monitors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452222)