A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Strategy Synthesis for MDPs with Resource Constraints
[article]
2021
arXiv
pre-print
Preserved Fulltext
We consider qualitative strategy synthesis for the formalism called consumption Markov decision processes. ...
many times) with probability 1 without resource exhaustion. ...
Efficient Strategy Synthesis for MDPs with Resource Constraints František Blahoudek, Petr Novotný, Melkior Ornik, Pranay Thangeda, and Ufuk Topcu Abstract-We consider qualitative strategy synthesis for ...
arXiv:2105.02099v1
fatcat:ocu2obhazrgpbbmqjtam7gnu64
QUASY: Quantitative Synthesis Tool
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Most notable, it can solve lexicographic mean-payoff games with 2 players, MDPs with mean-payoff objectives, and ergodic MDPs with mean-payoff parity objectives. ...
QUASY solves these two quantitative synthesis problems by reduction to instances of 2-player games and Markov Decision Processes (MDPs) with quantitative winning objectives. ...
For MDPs with mean-payoff, QUASY implements the strategy improvement algorithm (cf. ...
doi:10.1007/978-3-642-19835-9_24
fatcat:d2povpqdevgmdbp7lh2r4n2byq
Qualitative Controller Synthesis for Consumption Markov Decision Processes
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the complexity of strategy synthesis in consumption MDPs with almost-sure Büchi objectives. We show that the problem can be solved in polynomial time. ...
We implement our algorithm and show that it can efficiently solve CMDPs modelling real-world scenarios. ...
Hence, in this paper, we study the resource-constrained strategy synthesis problem for MDPs.
Models of Resource-Constrained Systems & Limitations of Current Approaches. ...
doi:10.1007/978-3-030-53291-8_22
fatcat:c32sewrmirhtvorq47f6g4xopy
Inductive Synthesis of Finite-State Controllers for POMDPs
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The inductive synthesis approach consists of two stages: The outer stage determines the design space, i.e., the set of FSC candidates, while the inner stage efficiently explores the design space. ...
Our framework builds on oracle-guided inductive synthesis to explore a design space compactly representing available FSCs. ...
Recently, an automata learning framework has been proposed for synthesising permissive FSCs [Wu et al., 2021] . In this paper, we propose a novel approachinductive synthesis-to find FSCs for POMDPs. ...
arXiv:2203.10803v2
fatcat:j3axgoppkncbpjavrrwf7og6qa
Deceptive Planning for Resource Allocation
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this setting, we develop strategies for controlling the density of the autonomous team so that they can deceive the adversaries regarding their objective while achieving the desired final resource allocation ...
or creating ambiguity regarding the final allocation strategy. ...
The constraints in (9b)-(9e) are the same with the constraints in the optimization problem in (4b)-(4e) with a minor difference. ...
arXiv:2206.01306v1
fatcat:wrnekqhrfbharpomo5qejkhe6e
Measuring and Synthesizing Systems in Probabilistic Environments
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. ...
For safety specifications and measures given by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average ...
[45] presents an efficient technique for solving MDP with mean-payoff objectives based on combining symbolic and explicit computation. ...
arXiv:1004.0739v2
fatcat:cqcx5xhqaza5jpnbk7rnh53oxu
Incremental control synthesis in probabilistic environments with Temporal Logic constraints
2012
2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. ...
We propose a computationally efficient incremental approach based on the fact that temporal logic verification is computationally cheaper than synthesis. ...
PROBLEM FORMULATION AND APPROACH In this section we introduce the control synthesis problem with temporal constraints for a system that models a plant operating in the presence of probabilistic independent ...
doi:10.1109/cdc.2012.6426346
dblp:conf/cdc/UlusoyWB12
fatcat:dtlzpha6jjgwfmty2biqiqyjka
Incremental Control Synthesis in Probabilistic Environments with Temporal Logic Constraints
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. ...
We propose a computationally efficient incremental approach based on the fact that temporal logic verification is computationally cheaper than synthesis. ...
PROBLEM FORMULATION AND APPROACH In this section we introduce the control synthesis problem with temporal constraints for a system that models a plant operating in the presence of probabilistic independent ...
arXiv:1209.0136v2
fatcat:piiyuk7m3raqxhzxdcs7e5jqb4
Qualitative Controller Synthesis for Consumption Markov Decision Processes
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the complexity of strategy synthesis in consumption MDPs with almost-sure B\"uchi objectives. We show that the problem can be solved in polynomial time. ...
We implement our algorithm and show that it can efficiently solve CMDPs modelling real-world scenarios. ...
Consequently, to our best knowledge, we present the first polynomial-time algorithm for controller synthesis in resource-constrained MDPs with ω-regular objectives. Related Work. ...
arXiv:2005.07227v1
fatcat:7gdgdblbz5c2bbagp3owm5y7fu
Permissive Controller Synthesis for Probabilistic Systems
2015
Logical Methods in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We establish several key results about the optimality of multi-strategies and the complexity of synthesising them. ...
We develop a permissive controller synthesis framework, which generates multi-strategies for the controller, offering a choice of control actions to take at each time step. ...
Topics for future work include synthesis for more expressive temporal logics and using history-dependent multi-strategies. Acknowledgements. ...
doi:10.2168/lmcs-11(2:16)2015
fatcat:2ozsrkrt5nf4linsntpwtsszta
Permissive Controller Synthesis for Probabilistic Systems
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We establish several key results about the optimality of multi-strategies and the complexity of synthesising them. ...
We develop a permissive controller synthesis framework, which generates multi-strategies for the controller, offering a choice of control actions to take at each time step. ...
Topics for future work include synthesis for more expressive temporal logics and using history-dependent multi-strategies. Acknowledgements. ...
doi:10.1007/978-3-642-54862-8_44
fatcat:pacmkms2jffsxpbswocyr5fkoq
Verification and Control of Partially Observable Probabilistic Real-Time Systems
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We then propose techniques to either verify that such a property holds or to synthesise a controller for the model which makes it true. ...
We propose automated techniques for the verification and control of probabilistic real-time systems that are only partially observable. ...
Dually, consider synthesising a strategy for which
φ
Verification/strategy synthesis of POPTA PTA result States Num. Num. Res. Grid Time Result ([[P]] N ) obs. hidd. ...
doi:10.1007/978-3-319-22975-1_16
fatcat:doe2lmfqljd7johgaubc4xfi3q
Research Challenges for Heterogeneous CPS Design
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Interoperability---the management of workloads across heterogeneous resources---requires more careful design than is the case for homogeneous platforms. ...
Scheduling often has major impact on metrics for efficiency evaluation, including the ones listed above. ...
OUTLOOK Many of the state-of-the art methods for CPS design and implementation are not model-based or involve a focus on individual model types -for example, the development of software synthesis techniques ...
arXiv:2005.07841v1
fatcat:kgbvw2ugizexzlclmg46o4c4ze
Polynomial-Time Algorithms for Multi-Agent Minimal-Capacity Planning
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
More specifically, we consider high-level planning for a team of homogeneous agents that operate under resource constraints in stochastic environments and share a common goal: given a set of target locations ...
We reduce the problem of finding target assignments for a team of agents with the lowest possible capacity to an equivalent graph-theoretical problem. ...
Qualitative strategy synthesis in consumption MDPs can be performed in polynomial-time with respect to the model size [12] and the minimal capacity for each edge can be precisely computed using binary ...
arXiv:2105.01225v1
fatcat:6zr4xhpgtjeflfxv7ouksztpui
Incremental controller synthesis in probabilistic environments with temporal logic constraints
2014
The international journal of robotics research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider automatic computation of optimal control strategies for a robot interacting with a set of independent uncontrollable agents in a graph-like environment. ...
Remark 2 (Complexity of probabilistic synthesis and verification for scLTL formulas). ...
product MDP with 1404 states and 36,033 transitions to solve the control synthesis problem. ...
doi:10.1177/0278364913519000
fatcat:y2ddohbfjfe3fpno3u2zjhdj4u
« Previous
Showing results 1 — 15 out of 820 results