# UPPAAL in a Nutshell

##### Citations

[...]

4,478 citations

2,377 citations

### Cites methods from "UPPAAL in a Nutshell"

...For (non-probabilistic) timed automata, such methods are usually much less efficient than on-thefly zone-based reachability (as, e.g., in UPPAAL [13])....

[...]

...UPPAAL [13] is the leading verification tool for timed automata....

[...]

...A recent extension, UPPAAL-PRO [15], adds support for PTAs, but currently only analyses maximum probabilistic reachability properties....

[...]

[...]

1,686 citations

### Cites background from "UPPAAL in a Nutshell"

...The first version of Uppaal was released in 1995 [45]....

[...]

1,459 citations

### Cites background from "UPPAAL in a Nutshell"

...Typical examples are formal specification languages [40, 2, 39], purely logic based languages used in theorem provers [13, 33, 7], and guarded command languages used in model checkers [30, 29, 28]....

[...]

893 citations

### Cites methods from "UPPAAL in a Nutshell"

...We do not focus on complexity issues or the implementation of these algorithms by verification tools like KRONOS[24], COSPAN [8], UPAAL [48], and HYTECH [35]....

[...]

...We do not focus on complexity issues or the implementation of these algorithms by verification tools like K RONOS[24], COSPAN [8], UPAAL [48], and HYTECH [35]....

[...]

##### References

[...]

14,187 citations

8,625 citations

### "UPPAAL in a Nutshell" refers background in this paper

...As this requires synchronization between three processes this can not directly be expressed in Uppaal where synchronization, as in CCS, is between two processes based on complementarity of actions....

[...]

...Absence of synchronization action indicates an internal (non{synchronizing) edge similar to {transitions in CCS....

[...]

...As in CCS [30] communication on channels occur as two{process synchronizations....

[...]

890 citations

### Additional excerpts

...The basis of the Uppaal model is the notion of timed automata [2] developed by Alur and Dill as an extension of classical finite-state automata with clock variables....

[...]

812 citations

### "UPPAAL in a Nutshell" refers background or methods in this paper

...One such well-known data structure is that of Di erence Bounded Matrices [4, 16, 33], Dbm, which o ers a canonical representation for constraint systems....

[...]

...4 Optimizations ADbm representation is in fact a weighted directed graph where the vertices correspond to clocks (including a zeroclock) and the weights on the edges stand for the bounds on the di erences between pairs of clocks [4, 16, 33]....

[...]

810 citations