11.07.2015 Views

Overview in PDF format - Tallinna Tehnikaülikool

Overview in PDF format - Tallinna Tehnikaülikool

Overview in PDF format - Tallinna Tehnikaülikool

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Figure 3.3 A snapshot of Uppaal model checker3.3. Model<strong>in</strong>g production systems with patterns of timed automataFor model<strong>in</strong>g a production system the timed automata (TA) based formalism isused. It is appropriate for systems that can be modeled as a collection of nondeterm<strong>in</strong>isticprocesses with f<strong>in</strong>ite control structure and real-valued clocks (i.e.timed automata), communicat<strong>in</strong>g through channels and (or) shared data structures.Typical application areas <strong>in</strong>clude real-time controllers, communication protocols,and other components <strong>in</strong> which tim<strong>in</strong>g aspects are critical. Suitable comput<strong>in</strong>geng<strong>in</strong>e for TA based MC is UppAal (www.uppaal.com).To solve a production system model the pattern-based model<strong>in</strong>g and parametricmodel check<strong>in</strong>g method can be used. For different tasks various specialized viewsof a root model M 0 are constructed and analyzed. The model M 0 consists of aparallel composition (denoted by ||) of UppAal automata that are constructed us<strong>in</strong>gbasic model patterns T r and T m r, i.e., M 0 ≡ (|| i T i) || (|| j T m j).• Pattern T r – “recipe”– is an automaton that models a technological process,i.e., the precedence relation of technological operations that are necessaryto manufacture a certa<strong>in</strong> type of product (Fig 3.4a).• Pattern T m is an automaton for model<strong>in</strong>g mach<strong>in</strong><strong>in</strong>g units perform<strong>in</strong>gtechnological operations (Fig 3.4b).Here we dist<strong>in</strong>guish between the concepts pattern and template that seem<strong>in</strong>glyhave a similar mean<strong>in</strong>g. S<strong>in</strong>ce template has fixed semantics <strong>in</strong> UppAal denot<strong>in</strong>g aclass of automata that can be <strong>in</strong>stantiated by giv<strong>in</strong>g explicit values to its parameters,we use a more general notion – pattern – denot<strong>in</strong>g typical fragments of automatathat occur repeatedly <strong>in</strong> the model. Both patterns are sequential and the operationsof pattern T r and their perform<strong>in</strong>g by MU represented <strong>in</strong> T m are synchronized via37

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!