Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Quantitative analysis of smart contracts
Smart contracts are computer programs that are executed by a network of mutually
distrusting agents, without the need of an external trusted authority. Smart contracts handle …
distrusting agents, without the need of an external trusted authority. Smart contracts handle …
Automata-based controller synthesis for stochastic systems: A game framework via approximate probabilistic relations
In this work, we propose an abstraction and refinement methodology for the controller
synthesis of discrete-time stochastic systems to enforce complex logical properties …
synthesis of discrete-time stochastic systems to enforce complex logical properties …
[HTML][HTML] Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
Neuro-symbolic approaches to artificial intelligence, which combine neural networks with
classical symbolic techniques, are growing in prominence, necessitating formal approaches …
classical symbolic techniques, are growing in prominence, necessitating formal approaches …
Model checking and strategy synthesis for stochastic games: From theory to practice
Probabilistic model checking is an automatic procedure for establishing if a desired property
holds in a probabilistic model, aimed at verifying quantitative probabilistic specifications …
holds in a probabilistic model, aimed at verifying quantitative probabilistic specifications …
[PDF][PDF] Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives.
We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-
independent objectives. We characterize subgame optimal strategies and use this …
independent objectives. We characterize subgame optimal strategies and use this …
Sub-game optimal strategies in concurrent games with prefix-independent objectives
We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-
independent objectives. We characterize subgame optimal strategies and use this …
independent objectives. We characterize subgame optimal strategies and use this …
The value 1 problem under finite-memory strategies for concurrent mean-payoff games
We consider concurrent mean-payoff games, a very well-studied class of two-player (player
1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a …
1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a …
CEGAR for compositional analysis of qualitative properties in Markov decision processes
We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express that …
probabilistic systems. We focus on qualitative properties for MDPs that can express that …
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic game (extended version)
Neuro-symbolic approaches to artificial intelligence, which combine neural networks with
classical symbolic techniques, are growing in prominence, necessitating formal approaches …
classical symbolic techniques, are growing in prominence, necessitating formal approaches …
Formal Methods for Sandboxing Controllers in Cyber-Physical Systems
B Zhong - 2023 - mediatum.ub.tum.de
This dissertation is motivated by the growing demand for deploying high-performance but
unverified controllers, especially those developed using artificial intelligence (AI) …
unverified controllers, especially those developed using artificial intelligence (AI) …