A Tutorial on Uppaal
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 …
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 …
of timed automata implemented in the tool, to present its interface, and to explain how to use …
Uppaal SMC tutorial
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 …
Uppaal family that allows us to reason on networks of complex real-timed systems with a …
The octagon abstract domain
A Miné - Higher-order and symbolic computation, 2006 - Springer
This article presents the octagon abstract domain, a relational numerical abstract domain for
static analysis by abstract interpretation. It allows representing conjunctions of constraints of …
static analysis by abstract interpretation. It allows representing conjunctions of constraints of …
Timed automata: Semantics, algorithms and tools
J Bengtsson, W Yi - Advanced Course on Petri Nets, 2003 - Springer
This chapter is to provide a tutorial and pointers to results and related work on timed
automata with a focus on semantical and algorithmic aspects of verification tools. We …
automata with a focus on semantical and algorithmic aspects of verification tools. We …
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
R Bagnara, PM Hill, E Zaffanella - Science of Computer Programming, 2008 - Elsevier
Since its inception as a student project in 2001, initially just for the handling (as the name
implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved …
implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved …
[图书][B] Real-time systems: scheduling, analysis, and verification
AMK Cheng - 2003 - books.google.com
Test und Validierung spielen bei Echtzeitsystemen eine zentrale Rolle: Auf die
Spezifikationen, die der Hersteller angibt, muss sich der Kunde hier in besonders hohem …
Spezifikationen, die der Hersteller angibt, muss sich der Kunde hier in besonders hohem …
A new numerical abstract domain based on difference-bound matrices
A Miné - Programs as Data Objects: Second Symposium …, 2001 - Springer
This paper presents a new numerical abstract domain for static analysis by abstract
interpretation. This domain allows us to represent invariants of the form (x− y= c) and (±x= c) …
interpretation. This domain allows us to represent invariants of the form (x− y= c) and (±x= c) …
Linear parametric model checking of timed automata
We present an extension of the model checker Uppaal, capable of synthesizing linear
parameter constraints for the correctness of parametric timed automata. A symbolic …
parameter constraints for the correctness of parametric timed automata. A symbolic …
Analysis of timed systems using time-abstracting bisimulations
S Tripakis, S Yovine - Formal Methods in System Design, 2001 - Springer
The objective of this paper is to show how verification of dense-time systems modeled as
timed automata can be effectively performed using untimed verification techniques. In that …
timed automata can be effectively performed using untimed verification techniques. In that …