Uppaal Stratego

@inproceedings{David2015UppaalS,
  title={Uppaal Stratego},
  author={Alexandre David and Peter Gj{\o}l Jensen and Kim G. Larsen and Marius Mikucionis and Jakob Haahr Taankvist},
  booktitle={TACAS},
  year={2015}
}
Uppaal Stratego is a novel tool which facilitates generation, optimization, comparison as well as consequence and performance exploration of strategies for stochastic priced timed games in a user-friendly manner. The tool allows for efficient and flexible "strategy-space" exploration before adaptation in a final implementation by maintaining strategies as first class objects in the model-checking query language. The paper describes the strategies and their properties, construction and… 
PRISM-games 3.0: Stochastic Game Verification with Concurrency, Equilibria and Time
TLDR
A major new release of the PRISM-games model checker, featuring multiple significant advances in its support for verification and strategy synthesis of stochastic games, and summarises the performance and scalability of the tool.
Security-Aware Synthesis Using Delayed-Action Games
TLDR
A delayed-action games (DAGs) formalism that simulates hidden-information games (HIGs) as SMGs, where hidden information is captured by delaying a player's actions, and proposes a DAG-based framework for strategy synthesis and analysis.
PRISM-Games 2.0: A Tool for Multi-objective Strategy Synthesis for Stochastic Games
TLDR
The usefulness of the new PRISM-games tool is demonstrated on four case studies from autonomous transport and energy management, where strategies for a stochastic game modelled as a composition of subsystems are synthesised from strategies for individual components using assume-guarantee contracts on component interfaces.
SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes
TLDR
This paper demonstrates methods to learn compact representations of the strategies in the form of decision trees, which are much smaller, more understandable, and can easily be exported as code that can be loaded into embedded systems.
Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata
TLDR
A new lightweight on-the-fly algorithm to find near-optimal schedulers for probabilistic timed automata that makes use of the classical region and zone abstractions from timed automatic model checking, coupled with a recently developed smart sampling technique for statistical verification of Markov decision processes.
EFFICIENT SIMULATION-BASED VERIFICATION OF PROBABILISTIC TIMED AUTOMATA
TLDR
This paper proposes a novel region-based approach and data structure that reduce the complexity of all operations to being linear and shows that the new approach is not only easier to implement, but indeed significantly outperforms all current alternatives on standard benchmark models.
Efficient simulation-based verification of probabilistic timed automata
TLDR
This paper proposes a novel region-based approach and data structure that reduce the complexity of all operations to being linear and shows that the new approach is not only easier to implement, but indeed significantly outperforms all current alternatives on standard benchmark models.
An efficient statistical model checker for nondeterminism and rare events
Statistical model checking avoids the state space explosion problem in verification and naturally supports complex non-Markovian formalisms. Yet as a simulation-based approach, its runtime becomes
A Modest Approach to Markov Automata
TLDR
Extensions to MODEST, an expressive high-level language with roots in process algebra, are presented that allow large Markov automata models to be specified in a succinct, modular way and illustrate the advantages of MODEST over alternative languages.
PRISM-games: verification and strategy synthesis for stochastic multi-player games with multiple objectives
TLDR
A detailed overview of the PRISM-games tool, including its modelling and property specification formalisms, and its underlying architecture and implementation, is provided, which includes multi-objective and compositional approaches to verification and strategy synthesis.
...
...

References

SHOWING 1-10 OF 22 REFERENCES
UPPAAL-Tiga: Time for Playing Games!
TLDR
The first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties has now matured to a fully integrated tool with dramatic improvements both in terms of performance and the availability of the extended input language of UPPAAL-4.0.
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
TLDR
A survey of U PPAAL-SMC, a major extension of the real-time verification tool UPPAAL, including modeling and specification formalisms as well as techniques applied with applications of the tool to case studies.
Verification and Performance Evaluation of Timed Game Strategies
TLDR
A new extension of Uppaal is proposed that automatically synthesizes a strategy of a timed game for a given control objective, then verifies and evaluates this strategy with respect to additional properties, and demonstrates the usefulness of this new branch ofUppaal using two case-studies.
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
TLDR
This paper describes version 2 of the NuSMV tool, a state-of-the-art symbolic model checker designed to be applicable in technology transfer projects and is robust and close to industrial systems standards.
Transactions in RCCS
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtrack mechanism. Any
FDR3 - A Modern Refinement Checker for CSP
TLDR
The operation of FDR3 is described at a high level and a detailed description of several of its more important innovations are given, including the new multi-core refinement-checking algorithm that is able to achieve a near linear speed up as the number of cores increase.
A Temporal Logic of Nested Calls and Returns
TLDR
This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.
PRISM 4.0: Verification of Probabilistic Real-Time Systems
TLDR
A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata.
UPPAAL 4.0
TLDR
A description of three of the new features: user defined functions, priorities and symmetry reduction inUPPAAL 4.0 is described.
Symbolic Controller Synthesis for Discrete and Timed Systems
TLDR
Algorithms for the symbolic synthesis of discrete and real-time controllers are presented, extended from analysis to synthesis and from purely discrete systems to real- time systems.
...
...