A Tutorial on Uppaal

G Behrmann, A David, KG Larsen - Formal methods for the design of real …, 2004 - Springer
This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of
timed automata implemented in the tool, to present its interface, and to explain how to use …

[PDF][PDF] A tutorial on Uppaal 4.0

G Behrmann, A David… - Department of computer …, 2006 - cialdea.dia.uniroma3.it
This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavour
of timed automata implemented in the tool, to present its interface, and to explain how to use …

Uppaal SMC tutorial

A David, KG Larsen, A Legay, M Mikučionis… - International journal on …, 2015 - Springer
This tutorial paper surveys the main features of Uppaal SMC, a model checking approach in
Uppaal family that allows us to reason on networks of complex real-timed systems with a …

[图书][B] Heuristic search: theory and applications

S Edelkamp, S Schrödl - 2011 - books.google.com
Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Minimum-cost reachability for priced time automata

G Behrmann, A Fehnker, T Hune, K Larsen… - … and Control: 4th …, 2001 - Springer
This paper introduces the model of linearly priced timed automata as an extension of timed
automata, with prices on both transitions and locations. For this model we consider the …

Testing real-time systems using UPPAAL

A Hessel, KG Larsen, M Mikucionis, B Nielsen… - Formal Methods and …, 2008 - Springer
This chapter presents principles and techniques for model-based black-box conformance
testing of real-time systems using the Uppaal model-checking tool-suite. The basis for …

Scheduling with timed automata

Y Abdeddaı, E Asarin, O Maler - Theoretical Computer Science, 2006 - Elsevier
In this work, we present timed automata as a natural tool for posing and solving scheduling
problems. We show how efficient shortest path algorithms for timed automata can find …

Performance analysis of probabilistic timed automata using digital clocks

M Kwiatkowska, G Norman, D Parker… - Formal Methods in System …, 2006 - Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability
distributions, is a modelling formalism suitable for describing formally both nondeterministic …

Directed explicit-state model checking in the validation of communication protocols

S Edelkamp, S Leue, A Lluch-Lafuente - International journal on software …, 2004 - Springer
The success of model checking is largely based on its ability to efficiently locate errors in
software designs. If an error is found, a model checker produces a trail that shows how the …

Optimal scheduling using priced timed automata

G Behrmann, KG Larsen, JI Rasmussen - ACM SIGMETRICS …, 2005 - dl.acm.org
This contribution reports on the considerable effort made recently towards extending and
applying well-established timed automata technology to optimal scheduling and planning …