Kim G. Larsen, Paul Pettersson and Wang Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer (STTT), vol. 1(1--2):pp. 134--152, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....extensions of the model [DZ98,HRS98,CG00,BDFP00,BFH 01] logical characterizations [Wil94,HRS98] have in particular been investigated. Practical aspects of the model have also been studied and several model checkers are now available (HYTECH [HHWT97] KRONOS [DOTY96] UPPAAL [LPY97] Timed automata afford to modelize many real time systems and the existing model checkers have allowed to verify a lot of industrial case studies (see the web pages of the tools or, for example, HSLL97,TY98] Implementation of Timed Automata The decidability of the timed automata model has ....

....Matrices data structure (DBM for short) initially proposed by [Dil89] There are two families of algorithms, the one performing a forward analysis and the one performing a backward analysis. The tool KRO NOS [BTY97,Daw97,Yov98] implements the two kinds of algorithms whereas the tool UPPAAL [BL96,LPY97] implements only forward analysis procedures, because it is more appropriate for dealing also with (bounded) integer variables, a feature proposed by UPPAAL. In this work, we will prove that the forward analysis algorithms implemented in the two previous tools are not correct We will now ....

Kim G. Larsen, Paul Pettersson and Wang Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer (STTT), vol. 1(1--2):pp. 134--152, 1997.

....to show that undesirable state cannot be reached from any legal initial conditions) and bounded liveness of the model (i.e. it can be asserted that all deadlines are feasible) Note that feasibility is the strongest property that can be asserted of a design. In this assignment we will use Uppaal[2, 3, 4] to model and verify some properties of the Production Cell. 2 Production Cell The Production Cell is intended to be a part of an industrial installation. Its purpose is to take metal plates from the feed belt, move them to the press, let the press do its work and then move the plates to a ....

Kim G. Larsen, Paul Pettersson and Wang Yi. UPPAAL in a Nutshell. In Springer International Journal of Software Tools for Technology Transfer 1(1+2), 1997. http://www.docs.uu.se/docs/rtmv/papers/lpw-sttt97.ps.gz

....implemented, which allows the tool user to hide and abstract from internal structures of a system model in modelling and simulation, and more importantly to facilate debugging, hierarchical traces may be provided as proofs to explain why a model satis es certain properties. 1 Introduction Uppaal [1] is a tool box for modelling, veri cation and simulation of real time systems developed jointly by Uppsala University and Aalborg University. It is appropriate for systems that can be described as collection of non deterministic parallel processes. The model used in Uppaal is the timed automaton. ....

Kim G. Larsen, Paul Pettersson and Wang Yi. Uppaal in a Nutshell. In Springer International Journal of Software Tools for Technology Transfer 1(1+2), 1997.

....property : Y =atomic1 until t atomic2 The above property states that the atomic2 must hold before time t and atomic1 must hold until then, where atomic1 and atomic2 are atomic formulae. For properties that cannot be expressed directly in the verification language, a workaround suggested by [2] is to manually create additional automata that observe changes to variables in the actual model, i.e atomic1 and atomic2 in this case. Those test automata reflect their observations by moving to different states. A test automaton for Y is illustrated in Figure 7. A[ not (Process1.A and ....

....Test moves to the state bad. Finally, to actually prove Y, an extra property l=A[ not(Test.bad) is needed to indirectly prove the bounded liveness property. The property states that the test automaton never stays in the state bad. The manual addition of a test automaton may seem unintuitive but [2] showed that a system S satisfies Y if the parallel composition of the S and Test satisfies l. Y is a bounded liveness property in this example but in general, it can be any arbitrary property. The model checking algorithm in UPPAAL is based on an interpretation using a finite state symbolic ....

[Article contains additional citation context not shown here]

Kim G. Larsen, Paul Pettersson and Wang Yi. UPPAAL in a Nutshell. Springer International Journal of Software Tools for Technology Transfer 1(1/2), October 1997.

....techniques for the dense state spaces of timed automata can be broadly classified into two categories. The first class of methods use a set of inequalities to represent a convex subset of the timer space, and state sets are represented by pairing locations with sets of such convex subsets (See, [LPW97], for instance) These methods are not suitable for our purposes because they represent locations explicitly, and the boolean component (therefore the number of locations) of the automaton F is often considerably large. Our delay computation technique is based on the second category of methods, ....

Kim G. Larsen, Paul Pettersson and Wang Yi. UPPAAL: Status & Developments In Proceedings of the 9th International Conference on Computer-Aided Verification, CAV '97. Haifa, Israel, 22-25 June 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC