Measuring and Synthesizing Systems in Probabilistic Environments
From MaRDI portal
Publication:5501954
DOI10.1145/2699430zbMath1321.68344arXiv1004.0739OpenAlexW2130350300MaRDI QIDQ5501954
Krishnendu Chatterjee, Rohit Singh, Barbara Jobstmann, Thomas A. Henzinger
Publication date: 14 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.0739
Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (4)
Graph Games and Reactive Synthesis ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Quantitative Automata under Probabilistic Semantics ⋮ Measuring and Synthesizing Systems in Probabilistic Environments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- The directed subgraph homeomorphism problem
- Minimax algebra
- Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
- Synthesizing robust systems
- Weighted automata and weighted logics
- Expressiveness and Closure Properties for Quantitative Languages
- Quantitative languages
- Model checking of probabilistic and nondeterministic systems
- QUASY: Quantitative Synthesis Tool
- Energy and Mean-Payoff Parity Markov Decision Processes
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- Discriminative Model Checking
- Game Refinement Relations and Metrics
- On Omega-Languages Defined by Mean-Payoff Conditions
- Better Quality in Synthesis through Quantitative Objectives
- The complexity of probabilistic verification
- Computer Science Logic
- Perfect-Information Stochastic Mean-Payoff Parity Games
- Lattice Automata
- Correct Hardware Design and Verification Methods
- Measuring and Synthesizing Systems in Probabilistic Environments
This page was built for publication: Measuring and Synthesizing Systems in Probabilistic Environments