K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, Oct. 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and the number of clocks that are used to specify timing constraints. Symbolic model checking algorithms are obtained by characterizing regions as Boolean combinations of linear inequalities over clocks [HNSY94] Based on these algorithms, tools for verifying timed automata, such as Uppaal [LPY97] Kronos [DOTY96] HyTech [HHWT97] and Tempo [Sor01] have been developed. As an alternative to classical model checking, the technique of bounded model checking has been recently introduced [CBRZ01] Given a system M modeled as a state machine, a temporal logic speci cation , and a bound k, ....

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, October 1997.

....and lower bounds instead of upper bounds are straightforward, but have been left out for clarity. We further think that this work can form the basis for further extensions towards weakly monotonic models of time, often found in interleaving semantics for timed systems and tools such as Uppaal [11]. Also, optimisations that have been developed for (on the fly) tableau constructions in the untimed case (see e.g. 5, 6, 9] might be applicable to our algorithm. ....

K. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, October 1997.

....the delay or the guard operators) A simulator of ETL automata has been developed, which thus supports a very large subset of the language. Her98] also studies how ETL automata can be mapped onto underlying models of existing model checkers such as HyTech [HHW95] KRONOS [DOT 96] and UPPAAL [LPW97] by adding further restrictions to our language. Basically, the ET LOTOS expressions used in delays, life reducers, selection predicates, o#ers, etc. must be linear, and the hide operator can only be used on non time restricted actions. This still encompasses a large subset of the language, and ....

Larsen, K., Pettersson, P. and Wang, Yi. : Uppaal in a nutshell. Journal of Software Tools for Technology Transfer,1(1#2), Oct. 1997.

.... [AD94] might therefore be a suitable model; these can be encoded in PVS [ORSvH95] and formally verified by hand or with the aid of specialized libraries and strategies such as those of TAME [Arc00] or we could use a model checker for timed automata such as Kronos [BDM 98] or UP PAAL [LPY97] or an experimental encoding in SAL ICS [dMRS] Lonn [Lon99a,Lon99b] considers startup algorithms for TDMA systems similar to TTA and verifies one of them using UPPAAL [LP97] Lon99b, Chapter 9] Although a timed automaton model would be more realistic, we have chosen, in the interests of ....

K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, October 1997.

....[BDGP98] extensions of the model [DZ98,HRS98,CG00,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 modelcheckers 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 ....

.... be implemented using the Difference Bounded Matrices data structure (DBM for short) initially proposed by [Dil89] For example, forward analysis algorithms (that is algorithms computing step by step the successors of the initial configurations) Alu99] are implemented in tools like UPPAAL [BL96,LPY97] or KRONOS [BTY97,Daw97,Yov98] The forward analysis algorithm computing the exact set of successors does not always terminate; in [MP99] subclasses of classical timed automata, for which termination is guaranteed, are proposed, but these classes are a bit restrictive. Different kinds of ....

LARSEN, K. G., PETTERSSON, P., and YI, W. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, vol. 1(1--2):134--152, Oct. 1997.

....68, 84, 40, 28, 101] Many of these prove decidability by explicitly stating an algorithm using the operations defined on regions, and have since been extended to more e#cient ways of representing sets of states. 2. 2 Timed Automata Extended with Linear Cost Timed verification tools like Uppaal [109] and Kronos [41] have been used to solve a number of optimization problems, especially as part of the VHS project where scheduling problems for di#erent batch plants [64, 82, 127, 100] have been addressed. The problems are modeled using timed automata such that the optimization problem can be ....

....equivalences between di#erent models ranging from di#erent kinds of transition systems to Petri nets [95, 52] Due to the fine granularity of regions defined in the previous chapter, they are not suited as a representation of the state space in tools. Therefore tools like Kronos [41] and Uppaal [109] are based on the notion of zones which are collections of regions. The two main ways of representing zones are Di#erence Bounded Matrices (DBMs) 60] and Clock Di#erence Diagrams (CDDs) 31] also presented as Di#erence Decision Diagrams in [124] Both Kronos and Uppaal represent zones using ....

[Article contains additional citation context not shown here]

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, Oct. 1997.

....one of the cornerstones of theoretical computer science but also form the fundamental basis for much more practical research on verification (see e.g. CGP99,BBF 01] The timed framework. In the framework of timed languages, very useful to specify and verify real time systems [AD90,ACD93,LPY97,Yov98] the situation is far from being so satisfactory. The original class of timed automata, proposed by Alur and Dill [AD90] is not closed under complement. Several Kleene like theorems [ACM97,BP99,ACM01,BP01] and logical characterizations [Wil94,HRS98] have been proposed for the whole ....

LARSEN, K. G., PETTERSSON, P., and YI, W. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, vol. 1(1--2):134--152, Oct. 1997.

....extensions of the model [DZ98,HRS98,CG00,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 1 [HHWT97] KRONOS 2 [Yov97] UPPAAL 3 [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] The Updatable Timed Automata Model. In the timed automata model, the only ....

....proof of these decidability results is based on a generalization of the construction of the region automaton for classical timed automata (as presented in [AD90,AD94] In the case of classical timed automata, this construction is not implemented. Instead of it, model checkers like UPPAAL [BL96,LPY97] or KRONOS [BTY97,Daw97,Yov98] use a forward analysis algorithm that uses some kind of abstraction [DT98] to explore finitely the reachable state space (this algorithm is called the zone algorithm ) The implementation of this algorithm uses a data structure initially proposed by Dill [Dil89] ....

LARSEN, K. G., PETTERSSON, P., and YI, W. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, vol. 1(1--2):134--152, Oct. 1997.

....of clocks [ACH94, HKWT95] of transitions [BDGP98] extensions of the model [AH92, Br95, DZ98, CG00] and logical characterization [Wil94] have been considered in particular. Moreover this model has been successfully used for veri cation and speci cation of real time systems [CY91, WTH91, HNSY94, LPY97, Yov97, HHWT97, CGP99] But there is a lack of algebraic characterizations of timed languages or timed automata. Even the famous Kleene s theorem [Kle56] and its extension to languages by Bchi [Bc62] has only partial counterparts in the framework of timed languages. An interesting result, due ....

Larsen, K. G., Pettersson, P., and Yi, W. Uppaal in a Nutshell . Journal of Software Tools for Technology Transfer, vol. 1(12):134152, 1997.

....the location reachability problem can be checked by the same technique as for timed automata [14, 19] So we may view the original timed automaton (without task assignment) as an abstraction of its extended version, which preserves location reachability. The existing model checking tools such as [20, 17] can be applied directly to verify the abstract models. But if properties related to the task queue are of interests, we need to develop a new veri cation technique. One of the most interesting properties of extended automata related to the task queue is schedulability. According to the ....

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, October 1997.

....work is partially supported by the European Community Esprit LTR Project 26270 VHS (Veri cation of Hybrid systems) On sabbatical from Basic Research in Computer Science, Aalborg University. 1 Introduction Recently, formal veri cation tools for real time and hybrid systems, such as Uppaal [LPY97] Kronos [BDM 98] and HyTech [HHWT97] have been applied to solve realistic scheduling problems [Feh99b,HLP00,NY99] The basic common idea of these works is to reformulate a scheduling problem to a reachability problem that can be solved by veri cation tools. In this approach, the automata ....

K. G. Larsen, P. Pettersson, and W. Yi, Uppaal in a Nutshell, Int. Journal on Software Tools for Technology Transfer 1 (1997), no. 1-2, 134-152.

....Times including a set of application tasks, task constraints, tasks arrival patterns and a scheduling policy adopted on the target platform, Times will generate a scheduler and calculate the worst case response times for all tasks. The model may be further validated by a model checker e.g. UPPAAL [9], and then compiled to executable C code. We assume that the generated code will be executed on a platform on which every annotated task in the design model will not take more than the given computing time. Further assume that the platform guarantees the synchronous hypothesis in the sense that ....

....13)g; S 2 (6; 11)g of a task is illustrated in Figure 2. The task will try to lock S 1 when it has been executed for 3 time units and it will lock it for 10 time units. 2. 2 Timed Automata as Task Arrival Patterns The core of the Times input language is timed automata extended with data variables [9] and tasks [5] and [7] As in the UPPAAL model, each edge of such an extended automaton is labeled with three labels: 1. a guard containing a clock constraint and or a predicate on data variables. 2. an action which can be an input or output action in the form of a and a . 3. a sequence of ....

[Article contains additional citation context not shown here]

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(12):134152, October 1997.

....of safety and bounded liveness properties expressible in the real time property language L 8S to checking for reachability of reject states in suitably constructed test automata. This approach allows us to take full advantage of the core of the computational engine of the tool UPPAAL [BLL 95, LPY97, ABB 01] which consists of a collection of efficient algorithms that can be used to perform reachability analysis over timed automata. As the property language that we consider is powerful enough to describe characteristic properties [SI94] for nodes of timed automata with respect to (ready) ....

LARSEN, K. G., PETTERSSON, P., and YI, W. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, vol. 1(1--2):134--152, 1997.

No context found.

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, Oct. 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, 1997.

No context found.

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, October 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, 1(1--2):134--152, 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Journal of Software Tools for Technology Transfer, 1(1--2):134--152, 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Journal of Software Tools for Technology Transfer, 1--2:134-- 152, 1997.

No context found.

K. G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, October 1997.

No context found.

K. G. Larsen, P. Pettersson, and W. Yi. U##### in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1--2):134--152, October 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(12):134152, 1997.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi, Uppaal in a Nutshell, Int. Journal on Software Tools for Technology Transfer 1 (1997), no. 1--2, 134--152.

No context found.

K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. Journal of Software Tools for Technology Transfer, 1--2:134-- 152, 1997.

First 50 documents

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