Synthesizing efficient systems in probabilistic environments

DOI10.1007/S00236-015-0237-YMaRDI QIDQ300419zbMATH OpenOpenAlexFDO

Authors Christian von Essen, Barbara Jobstmann, David Parker, Rahul Varshneya

Publication date 28 June 2016

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL http://pure-oai.bham.ac.uk/ws/files/20450025/acta_inf_synth.pdf

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Measuring and synthesizing systems in probabilistic environments
• Synthesizing efficient controllers
• Better Quality in Synthesis through Quantitative Objectives
• High-Quality Synthesis Against Stochastic Environments
• Synthesis for Probabilistic Environments

Cites work

• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 2080040 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3240812 (Why is no real title available?)
• scientific article; zbMATH DE number 3197631 (Why is no real title available?)
• A first course in stochastic models.
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Better Quality in Synthesis through Quantitative Objectives
• Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
• Graph-Based Algorithms for Boolean Function Manipulation
• Markov Chains
• Markov Decision Processes with Multiple Objectives
• Multi-objective Model Checking of Markov Decision Processes
• N-process mutual exclusion with bounded waiting by 4. log//2N-valued shared variable
• On sequential decisions and Markov chains
• Performance analysis of probabilistic timed automata using digital clocks
• Pure Stationary Optimal Strategies in Markov Decision Processes
• Quantitative multi-objective verification for probabilistic systems
• Symbolic model checking for probabilistic processes
• Symbolic model checking: \(10^{20}\) states and beyond
• Synthesizing efficient controllers
• Synthesizing robust systems
• Temporal verification of reactive systems: response
• Using probabilistic model checking for dynamic power management

Cited in

(10)

• Synthesis of succinct systems
• Measuring and synthesizing systems in probabilistic environments
• Decoupled fitness criteria for reactive systems
• Performance analysis of probabilistic action systems
• scientific article; zbMATH DE number 7455747 (Why is no real title available?)
• Synthesis from probabilistic components
• Synthesis with rational environments
• High-Quality Synthesis Against Stochastic Environments
• Synthesizing efficient controllers
• The Complexity of Synthesis from Probabilistic Components

Describes a project that uses

Uses Software

• PRISM
• MCQueue

This page was built for publication: Synthesizing efficient systems in probabilistic environments

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