#### DMCA

## A tutorial on uppaal (2004)

### Cached

### Download Links

Citations: | 301 - 19 self |

### Citations

506 |
Automata for modeling real-time systems
- Alur, Dill
- 1990
(Show Context)
Citation Context ...ered in sections 4 and 5. Finally section 6 introduces 7 common modelling patterns often used with Uppaal. 2 Timed Automata in Uppaal The model-checker Uppaal is based on the theory of timed automata =-=[4,38]-=- and its modelling language offers additional features such as bounded integer variables and urgency. The query language of Uppaal, used to specify properties to be checked, is a subset of CTL (comput... |

426 |
Model-checking for real-time systems
- Alur, Dill
- 1990
(Show Context)
Citation Context ... language offers additional features such as bounded integer variables and urgency. The query language of Uppaal, used to specify properties to be checked, is a subset of CTL (computation tree logic) =-=[35,3]-=-. In this section we present the modelling and the query languages of Uppaal and we give an intuitive explanation of time in timed automata.s2.1 The Modelling Language Networks of Timed Automata A tim... |

72 | Efficient Timed Reachability Analysis Using Clock Difference Diagrams
- Behrmann, Larsen, et al.
- 1999
(Show Context)
Citation Context ...32], a distributed version of Uppaal [15,9], guided and minimal cost reachability [13,46,14], work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions =-=[16,12]-=-. Uppaal has also generated related Ph.D. theses [45,52,41,51,17,23,28,8]. The tool is now mature with its current version 3.4.6. It features a Java user interface and a verification engine written in... |

53 | Distributed timed model checking - how the search order matters
- Behrmann, Hune, et al.
(Show Context)
Citation Context ... has been in constant development [19,5,11,10,24,25]. Experiments and improvements include data structures [48], partial order reduction [18], symmetry reduction [32], a distributed version of Uppaal =-=[15,9]-=-, guided and minimal cost reachability [13,46,14], work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions [16,12]. Uppaal has also generated related ... |

51 | Times - a tool for modelling and implementation of embedded systems
- Amnell, Fersman, et al.
- 2002
(Show Context)
Citation Context ...testing, see http: //www.cs.auc.dk/~marius/tuppaal/. Times is a tool set for modelling, schedulability analysis, and synthesis of (optimal) schedules and executable code. The verification uses Uppaal =-=[6]-=-. On-going work on the model-checker includes support for hierarchical timed automata, symmetry reduction, UCode (Uppaal code, large subset of C), improved memory management, etc. The tool has been su... |

47 | Model checking via reachability testing for timed automata
- Aceto, Bergueno, et al.
- 1998
(Show Context)
Citation Context ... of at least one of the committed locations. Arrays are allowed for clocks, channels, constants and integer variables. They are defined by appending a size to the variable name, e.g.chan c[4]; clock a=-=[2]-=-; int[3,5] u[7];. Initialisers are used to initialise integer variables and arrays of integer variables. For instance, int i := 2; or int i[3] := {1, 2, 3};. Expressions in Uppaal Expressions in Uppaa... |

44 | Uppaal implementation secrets
- Behrmann, Bengtsson, et al.
- 2002
(Show Context)
Citation Context ...med automata extended with integer variables, structured data types, and channel synchronisation. The first version of Uppaal was released in 1995 [47]. Since then it has been in constant development =-=[19,5,11,10,24,25]-=-. Experiments and improvements include data structures [48], partial order reduction [18], symmetry reduction [32], a distributed version of Uppaal [15,9], guided and minimal cost reachability [13,46,... |

42 | Efficient Guiding Towards Cost-Optimality in uppaal. Accepted for publication in TACASâ€™2001
- Behrmann, Fehnker, et al.
(Show Context)
Citation Context ...,24,25]. Experiments and improvements include data structures [48], partial order reduction [18], symmetry reduction [32], a distributed version of Uppaal [15,9], guided and minimal cost reachability =-=[13,46,14]-=-, work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions [16,12]. Uppaal has also generated related Ph.D. theses [45,52,41,51,17,23,28,8]. The tool i... |

40 |
Approximate reachability analysis of timed automata
- Balarin
- 1996
(Show Context)
Citation Context ...e of the committed locations. Arrays are allowed for clocks, channels, constants and integer variables. They are defined by appending a size to the variable name, e.g.chan c[4]; clock a[2]; int[3,5] u=-=[7]-=-;. Initialisers are used to initialise integer variables and arrays of integer variables. For instance, int i := 2; or int i[3] := {1, 2, 3};. Expressions in Uppaal Expressions in Uppaal range over cl... |

38 | The power of reachability testing for timed automata
- Aceto, Bouyer, et al.
- 2003
(Show Context)
Citation Context ...s, and similarly for the other trains. Finally, to check that the system is deadlock-free, we verify the property A[] not deadlock. Suppose that we made a mistake in the queue, namely we wrote e:=list=-=[1]-=- in the template IntQueue instead of e:=list[0] when reading the head on the transition synchronised with hd?. We could have been confused when thinking in terms of indexes. It is interesting to note ... |

27 | Uppaal - present and future
- Behrmann, David, et al.
(Show Context)
Citation Context ...med automata extended with integer variables, structured data types, and channel synchronisation. The first version of Uppaal was released in 1995 [47]. Since then it has been in constant development =-=[19,5,11,10,24,25]-=-. Experiments and improvements include data structures [48], partial order reduction [18], symmetry reduction [32], a distributed version of Uppaal [15,9], guided and minimal cost reachability [13,46,... |

14 |
Judi Romijn, and Frits Vaandrager. Minimum-cost reachability for priced timed automata
- Behrmann, Fehnker, et al.
- 2001
(Show Context)
Citation Context ...,24,25]. Experiments and improvements include data structures [48], partial order reduction [18], symmetry reduction [32], a distributed version of Uppaal [15,9], guided and minimal cost reachability =-=[13,46,14]-=-, work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions [16,12]. Uppaal has also generated related Ph.D. theses [45,52,41,51,17,23,28,8]. The tool i... |

12 |
Distributed Reachability Analysis in Timed Automata
- Behrmann
- 2005
(Show Context)
Citation Context ... has been in constant development [19,5,11,10,24,25]. Experiments and improvements include data structures [48], partial order reduction [18], symmetry reduction [32], a distributed version of Uppaal =-=[15,9]-=-, guided and minimal cost reachability [13,46,14], work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions [16,12]. Uppaal has also generated related ... |

7 | Unification & sharing in timed automata verification
- David, Behrmann, et al.
- 2003
(Show Context)
Citation Context ...32], a distributed version of Uppaal [15,9], guided and minimal cost reachability [13,46,14], work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions =-=[16,12]-=-. Uppaal has also generated related Ph.D. theses [45,52,41,51,17,23,28,8]. The tool is now mature with its current version 3.4.6. It features a Java user interface and a verification engine written in... |

3 | Data Structures and Algorithms for the Analysis of Real Time Systems
- Behrmann
- 2003
(Show Context)
Citation Context ...minimal cost reachability [13,46,14], work on UML Statecharts [26], acceleration techniques [34], and new data structures and memory reductions [16,12]. Uppaal has also generated related Ph.D. theses =-=[45,52,41,51,17,23,28,8]-=-. The tool is now mature with its current version 3.4.6. It features a Java user interface and a verification engine written in C++ . It is freely available at http://www.uppaal.com/. This tutorial co... |