On the expressiveness and complexity of randomization in finite state monitors
From MaRDI portal
Publication:3452222
DOI10.1145/1552285.1552287zbMath1325.68128OpenAlexW1988501450MaRDI QIDQ3452222
No author found.
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Randomized algorithms (68W20)
Related Items (10)
Probabilistic causes in Markov chains ⋮ The Effect of Tossing Coins in Omega-Automata ⋮ Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata ⋮ Decidable and expressive classes of probabilistic automata ⋮ A survey of partial-observation stochastic parity games ⋮ Partial-Observation Stochastic Games ⋮ Alternating-time stream logic for multi-agent systems ⋮ Probabilistic Acceptors for Languages over Infinite Words ⋮ Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds ⋮ Power of Randomization in Automata on Infinite Strings
This page was built for publication: On the expressiveness and complexity of randomization in finite state monitors
