Petri Net Modeling for dynamic MM composite Object.

Slides:



Advertisements
Similar presentations
Multimedia Synchronization Brian P. Bailey Spring 2006.
Advertisements

1 SE-561 Formal Methods in Software Petri Nets - I.
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Based on: Petri Nets and Industrial Applications: A Tutorial
Interaction Modeling for Testing We would generate the test cases based on our understanding of the interactions that may happen. The source is, again,
1 A class of Generalized Stochastic Petri Nets for the performance Evaluation of Mulitprocessor Systems By M. Almone, G. Conte Presented by Yinglei Song.
IE 469 Manufacturing Systems
Discrete Interaction Design Specification Prof. Dr. Matthias Rauterberg Faculty Industrial Design Technical University of Eindhoven
Tasks Periodic The period is the amount of time between each iteration of a regularly repeated task Time driven The task is automatically activated by.
Simulation of Spiking Neural P Systems Using Pnet Lab Authors Padmavati Metta Kamala Krithivasan Deepak Garg.
Finite state machines.
Synthesis of Embedded Software Using Free-Choice Petri Nets.
I MPLEMENTING S YNCHRONOUS M ODELS ON L OOSELY T IME T RIGGERED A RCHITECTURES Discussed by Alberto Puggelli.
10. Petri Nets Prof. O. Nierstrasz. Roadmap  Definition: —places, transitions, inputs, outputs —firing enabled transitions  Modelling: —concurrency.
CP — Concurrent Programming 12. Petri Nets Prof. O. Nierstrasz Wintersemester 2005 / 2006.
12/07/2007Jiacun Wang1 SE-561 Math Foundations Petri Nets - II Dr. Jiacun Wang Department of Software Engineering Monmouth University.
Design of Fault Tolerant Data Flow in Ptolemy II Mark McKelvin EE290 N, Fall 2004 Final Project.
Models of Computation for Embedded System Design Alvise Bonivento.
Richard Furuta Texas A&M University Center for the Study of Digital Libraries and The Department of Computer Science Firing a transition.
Automatic Manifestation of Composite Multimedia Objects Ahmed Gomaa Ph.D. Student Rutgers University - CIMIC.
Rutgers - CIMC Automatic Manifestation of Composite Multimedia Objects Ahmed Gomaa Nabil Adam Vijay Atluri.
Mahapatra-A&M-Sprong'021 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
E GOV Universal Access Ahmed Gomaa CIMIC Rutgers University.
Chapter 3 : Software Process and Other Models Juthawut Chantharamalee Curriculum of Computer Science Faculty of Science and Technology, Suan Dusit University.
Function: Definition A function is a correspondence from a first set, called the domain, to a second set, called the range, such that each element in the.
CIS679: RTP and RTCP r Review of Last Lecture r Streaming from Web Server r RTP and RTCP.
PETRINETS Nipun Devlekar Zauja Lahtau. PETRINETS DEFINITION : DEFINITION :  PETRINET (place/ transition net): a formal, graphical, executable technique.
A Novel Method for Formally Detecting RFID Event Using Petri Nets SEKE 2011.
Modeling with ordinary Petri Nets Events: Actions that take place in the system The occurrence of these events is controlled by the state of the system.
Object-Oriented Modeling Using UML CS 3331 Section 2.3 of Jia 2003.
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
Kurt Jensen Lars M. Kristensen 1 Coloured Petri Nets Department of Computer Science Coloured Petri Nets Modelling and Validation of Concurrent Systems.
Lecture51 Timed Automata II CS 5270 Lecture 5.
Petri Nets: Their Development and Use in Production Planning Jeffrey E. Short, P.E. December 6, 2000.
Of 50 E GOV Universal Access Ahmed Gomaa CIMIC Rutgers University.
1 Kyung Hee University Statecharts Spring Kyung Hee University Specifying Objects’ Behaviour  Interaction diagrams show message-passing behaviour.
Generalized stochastic Petri nets (GSPN)
Hardware Design and The Petri Net Abhijit K. Deb SAM, LECS, IMIT, KTH Kista, Stockholm.
Petri Nets Lecturer: Roohollah Abdipour. Agenda Introduction Petri Net Modelling with Petri Net Analysis of Petri net 2.
Petri Nets Invented by Carl Adam Petri in 1962 Concurrent systems with timing problems  Synchronization, race problem, deadlock A petri net consists of.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Modelling by Petri nets
Ch5: Software Specification. 1 Petri Nets  Introduced by C. Adams Petri in  Widely used in the modeling and analysis of computer systems.  Basic.
1 Copyright  2001 Pao-Ann Hsiung SW HW Module Outline l Introduction l Unified HW/SW Representations l HW/SW Partitioning Techniques l Integrated HW/SW.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
School of Computer Science & Software Engineering
CAP 4800/CAP 5805: Computer Simulation Concepts
Review n System dynamics : A sequence of state transition n model : A set of rules for state transition System S X Y Discrete event system FSM (Automata)
Petri-Nets and Other Models
Cart First, the cart is on the left touching the contact sensor a. After pressing button S (start), the cart starts moving to the right. When the cart.
Turing Machine Model Are there computations that no “reasonable” computing machine can perform? –the machine should not store the answer to all possible.
CS Spring 2010 CS 414 – Multimedia Systems Design Lecture 35 – Synchronization (Part 3) Klara Nahrstedt Spring 2010.
Process Mining – Concepts and Algorithms Review of literature on process mining techniques for event log data.
Animations & Multimedia LESSON 9 #2.09 USING ANIMATION AND MULTIMEDIA.
Week 8 Computational Level
Studio modeling basics
Klara Nahrstedt Spring 2009
Modeling for Testing Interactions
Dr. Eng Amr T. Abdel-Hamid
Timed Automata II CS 5270 Lecture Lecture5.
Model-Based Testing Model the system
Week 8 Computational Level
Workflow Management Systems
RTP and RTSP Realtime Transport Protocol
CAP 4800/CAP 5805: Computer Simulation Concepts
CAP 4800/CAP 5805: Computer Simulation Concepts
CAP 4800/CAP 5805: Computer Simulation Concepts
Interactive media.
Petri Net :Abstract formal model of information flow Major use:
Petri Nets Laurie Frazier.
Presentation transcript:

Petri Net Modeling for dynamic MM composite Object

Composite MM object The first text and image shall start simultaneously. The video must start 10 seconds after the first image and first text have been displayed. The second text must be displayed simultaneously with the audio and the video. The Salesman picture is available from the start to the end of the presentation.

10 Sec Image 1 Text 1 Audio Video Text 2 Image 2 10 Sec Audio Video Text 2 Image 2 RTSM [0,20] [0,10] [10,20]

Objective Modeling user navigation with respect to synchronization constraints ( Fast Forward, Rewind, Pause)

UIPN definition UIPN is an eleven-tuple {S,E,T f,T u,A,D,R,M,F i,C,G,}where S={s 1,s 2,…,s m } finite set of Regular places, single circles, m  0; E={e 1,e 2,…e s } finite set of Enforced places, double circles, s  0; P= S  E All places T f ={t 1, t 2,…,t m } a finite set of forced transition, m  0; T u = {t 1,....t m } a finite set of user-initiated transitions, m >_ 0; T = T u  T F, T u  T f = , T  P=  A:{T X P}È {Pt} Directed arcs ( B: output, F: Input) D:p → Real number - predefined Incremental Time duration of places R: p → {r 1,r 2,…r k } Type of media ( modality) F i : p → {f 1,…..f k } Fidelity constraints C = P → R* is a mapping from places to clock values, where R* is a set of non-negative real numbers. G C :p* → Global Clock place. With a real number that start ticking with the initial place and end ticking with the end place. M: p → {0,1,2} state of place (no token, blocked, unblocked}

Execution semantic of UIPN A user-initiated transition tj is associated with it an event which is unpredictable (e.g., pressing of a button). Such a transition is fired if the associated event occurs. An output arc (pi, tj) Є A is enabled at time Τ if at time T if Global clock value is affected by user interaction and ά  c(pi)  β, α  β, ( α, β)= A ( ti, pi) We say that an output arc a from a place pi to a transition tj is enabled if a token is in pi and the value of c(pi) is within the range specified by the interval associated with the arc a. A transition tj Є T is enabled at time T if at time T, (pi, tj) is enabled for all i such that (pi, tj) Є A‘. That is, a transition tj is enabled if all the output arcs to it are enabled. A transition tj Є T is fired at time T if tj is enabled at time T ; The event associated with tj occurs at T. the value of c(pi) is within the range specified by the interval associated with the arc a. Upon firing, a set of backtracking rules is exercised to remove tokens from their input places. Meanwhile transition ti adds a token to its output places

Computation of Fireability domain For a given UIPN, if the clock upper and lower value are known, then it’s possible to select all appropriate places. All fireability domains of the transition that are enabled by current marking are considered in computation. The following rule must be satisfied: ά  c(pi)  β, α  β, ( α, β)= A ( ti, pi) So, for every output arc from the transition to a place, the new clock value must range in between it’s lower and upper predefined duration

10 Sec Image 1 Text 1 Video Text 2 Image 2 Audio Global Clock Global Clock [3 sec = 8 sec] t1t1 t1t1 User initiated transition FF for 5 sec [0,10]

State description A state S of a UIPN is defined as S = ( M, Đ). Here, M is the marking and Đ is a vector of clock values associated with places. So when a token arrive in a place, the clock in the place is activated at a given value, and it remains activated until the token is removed. As long as the clock is active, the clock value increase. In the User interaction case, if a user FF for 5 sec, the Gc is adjusted and t1 is fired. 10 Sec Image 1 Text 1 Video Text 2 Image 2 Audio Global Clock Global Clock

firing rules All places that are connected to the transition must be active ( must contain a token). All arcs connected to the transition must be enabled. In case of user interaction: transition tj Є T is enabled at time T if at time T, the value of c(pi) is within the range specified by the interval associated with the arc B. A transition tj Є T is fired at time T if tj is enabled at time T ; The event associated with tj occurs at T. the value of c(pi) is within the range specified by the interval associated with the arc B

Computing next state Reachability can be determined by the firing rules. If Transition t j fired at time x from state S. Then S’ = ( M’, Đ’) can be computed as: M’(p) = M(p) – B (t i,P) + F (P, t i ) All places that keep their tokens, remain active. The clock of the place from which transition take place become inactive. The Global clock pass the token created from the user to the designated place, after changing it’s own value. The clock of the place that receives the token is either activated or adjusted based on the token value