1 of 20 Octopus: document handling Document handling: three modeling approaches Marc Voorhoeve Venkatesh Kannan TUE.

Slides:



Advertisements
Similar presentations
Knowledge Engineering for Planning Domain Design Ron Simpson University of Huddersfield.
Advertisements

A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Model Checker In-The-Loop Flavio Lerda, Edmund M. Clarke Computer Science Department Jim Kapinski, Bruce H. Krogh Electrical & Computer Engineering MURI.
Software Design Process A Process is a set of related and (sequenced) tasks that transforms a set of input to a set of output. Inputs Outputs Design Process.
Online Scheduling with Known Arrival Times Nicholas G Hall (Ohio State University) Marc E Posner (Ohio State University) Chris N Potts (University of Southampton)
Verification of Hybrid Systems An Assessment of Current Techniques Holly Bowen.
Q uantitative E valuation of E mbedded S ystems Mutual introductions The context of the course: Model Based / Driven Design Organisation of the course.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Resource Management of Highly Configurable Tasks April 26, 2004 Jeffery P. HansenSourav Ghosh Raj RajkumarJohn P. Lehoczky Carnegie Mellon University.
Equivalence of open Petri nets Modeling and analysis with Petri net components. Marc Voorhoeve (AIS)
Department of Computer Science and Engineering Southern Methodist University 03/17/081 LiGuo Huang Department of Computer Science.
2-1 Scheduling Constraints. 2-2 Outline Activities Temporal constraints Resources Resource constraints (mono-activity) Resource constraints (two activities)
Synthesis of Embedded Software Using Free-Choice Petri Nets.
Petri Nets Overview 1 Definition of Petri Net C = ( P, T, I, O) Places P = { p 1, p 2, p 3, …, p n } Transitions T = { t 1, t 2, t 3, …, t n } Input.
Banker’s Algorithm Implementation in CPN Tools Michal Žarnay Department of Transportation Networks University of Žilina, Slovakia.
1 Ivan Lanese Computer Science Department University of Bologna Roberto Bruni Computer Science Department University of Pisa A mobile calculus with parametric.
A Schedulability-Preserving Transformation of BDF to Petri Nets Cong Liu EECS 290n Class Project December 10, 2004.
1 Petri Nets H Plan: –Introduce basics of Petri Net models –Define notation and terminology used –Show examples of Petri Net models u Calaway Park model.
Sanjit A. Seshia and Randal E. Bryant Computer Science Department
Models of Computation for Embedded System Design Alvise Bonivento.
Testing Implementations of Access Control and Authentication Graduate Students: Ammar Masood, K. Jayaram School of Electrical and Computer Engineering.
Modelling with Coloured Petri Nets Søren Christensen Department of Computer Science University of Aarhus.
Modeling State-Dependent Objects Using Colored Petri Nets
Petri Net Modeling for dynamic MM composite Object.
History-Dependent Petri Nets Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Wil van der Aalst ?
Future Plans for CPN Tools - General. 2 Plans for CPN Tools CPN’0624-Oct-2006 Version plans Improvements for current marking feedback Support for.
Chapter 3 : Software Process and Other Models Juthawut Chantharamalee Curriculum of Computer Science Faculty of Science and Technology, Suan Dusit University.
Software Design Processes and Management
Interaction Modeling. Sequence Models  There are two kinds of sequence models: scenarios and sequence diagrams  A scenario is a sequence of events that.
Chapter 10 Architectural Design
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Capacity analysis of complex materials handling systems.
Designing a Discrete Event Simulation Tool Peter L. Jackson School of Operations Research and Industrial Engineering March 15, 2003 Cornell University.
DBSQL 14-1 Copyright © Genetic Computer School 2009 Chapter 14 Microsoft SQL Server.
Requirements Engineering Requirements Elicitation Process Lecture-8.
Modeling. Conceptual modeling: Petri nets Implementation: Arena, CPN tools Simulation needed: build models. Start with concepts, then select appropriate.
Chapter 3 DECISION SUPPORT SYSTEMS CONCEPTS, METHODOLOGIES, AND TECHNOLOGIES: AN OVERVIEW Study sub-sections: , 3.12(p )
Timed Use Case Maps Jameleddine Hassine Concordia University, Montreal, Canada URN Meeting, Ottawa, January 16-18, 2008.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
Towards a High-Level Petri Net Type DefinitionWorkshop on Interchange Formats for Petri Nets 1/18 June 26, 2004 Towards a High-Level Petri Net Type Definition.
Chapter 10 Analysis and Design Discipline. 2 Purpose The purpose is to translate the requirements into a specification that describes how to implement.
1 M. Tudruj, J. Borkowski, D. Kopanski Inter-Application Control Through Global States Monitoring On a Grid Polish-Japanese Institute of Information Technology,
Dynamic software reconfiguration using control supervisors Ugo Buy 13 June 2005.
REAL-TIME SOFTWARE SYSTEMS DEVELOPMENT Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
1 Qualitative Reasoning of Distributed Object Design Nima Kaveh & Wolfgang Emmerich Software Systems Engineering Dept. Computer Science University College.
1 SYNTHESIS of PIPELINED SYSTEMS for the CONTEMPORANEOUS EXECUTION of PERIODIC and APERIODIC TASKS with HARD REAL-TIME CONSTRAINTS Paolo Palazzari Luca.
Presented By Dr. Mohsen Alardhi College of Technological Studies, Kuwait April 19 th,2009.
Generalized stochastic Petri nets (GSPN)
1 Outline:  Optimization of Timed Systems  TA-Modeling of Scheduling Tasks  Transformation of TA into Mixed-Integer Programs  Tree Search for TA using.
Petri Nets Lecturer: Roohollah Abdipour. Agenda Introduction Petri Net Modelling with Petri Net Analysis of Petri net 2.
Modeling and Analysis of Printer Data Paths using Synchronous Data Flow Graphs in Octopus Ashwini Moily Under the supervision of Dr. Lou Somers, Prof.
Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)
High-Level Synthesis-II Virendra Singh Indian Institute of Science Bangalore IEP on Digital System IIT Kanpur.
Ch5: Software Specification. 1 Petri Nets  Introduced by C. Adams Petri in  Widely used in the modeling and analysis of computer systems.  Basic.
School of Computer Science, The University of Adelaide© The University of Adelaide, Control Data Flow Graphs An experiment using Design/CPN Sue Tyerman.
Behavioral Comparison of Process Models Based on Canonically Reduced Event Structures Paolo Baldan Marlon Dumas Luciano García Abel Armas.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
CAP 4800/CAP 5805: Computer Simulation Concepts
Pipelined and Parallel Computing Partition for 1 Hongtao Du AICIP Research Nov 3, 2005.
Quality Assurance in the Presence of Variability Kim Lauenroth, Andreas Metzger, Klaus Pohl Institute for Computer Science and Business Information Systems.
High Performance Embedded Computing © 2007 Elsevier Lecture 4: Models of Computation Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.
Application Development in Engineering Optimization with Matlab and External Solvers Aalto University School of Engineering.
CS 404Ahmed Ezzat 1 CS 404 Introduction to Compiler Design Lecture 1 Ahmed Ezzat.
LECTURE 5 Scanning. SYNTAX ANALYSIS We know from our previous lectures that the process of verifying the syntax of the program is performed in two stages:
Maikel Leemans Wil M.P. van der Aalst. Process Mining in Software Systems 2 System under Study (SUS) Functional perspective Focus: User requests Functional.
KPI-based Schedule Optimisation M.L. van Eck. Work-related Stress Costs over €25 billion a year in the EU. (EU-OSHA) 10% of work-related illness caused.
Unified Adaptivity Optimization of Clock and Logic Signals Shiyan Hu and Jiang Hu Dept of Electrical and Computer Engineering Texas A&M University.
A Review of Software Testing - P. David Coward
On Efficient Graph Substructure Selection
Modeling Tangible User Interfaces
Presentation transcript:

1 of 20 Octopus: document handling Document handling: three modeling approaches Marc Voorhoeve Venkatesh Kannan TUE

2 of 20 Octopus: document handling Octopus project Broker: EESI Industry partner: Océ Researchers: Nijmegen TUE - Electrical Engineering TUE - Computer Science

3 of 20 Octopus: document handling Data path: concurrent job execution scan control print retrieve Image Processing store IP1 IP2 resources user

4 of 20 Octopus: document handling Engineering decisions: - resource capacity - scheduling rules Octopus aim: Engineering support Frameworks: - TA (Timed Automata) - SDF (Synchronous Data Flow) - CPN (Colored Petri nets) Simulation State space exploration Approaches

5 of 20 Octopus: document handling Timed automata: labeled transition system with clock variables, that can be set and tested. states, actions (maybe silent), clock assignments, clock conditions. idlebusy recover start? 

6 of 20 Octopus: document handling Kind of merge with synchronization of clocks. idlebusy recover start?   s0s1 start! s2 start! (idle,s0)(busy,s1) (recover,s1) (idle,s1)(busy,s1) (recover,s1) (idle,s2) Temporal predicates (CTL) can be assessed, e.g. existence of execution path with duration D.

7 of 20 Octopus: document handling CPN (colored Petri nets): Petri net with arc inscriptions, firing conditions and subnet hierarchy. Eager firing. idlebusy recover start x x x x ( )( ) s0 s1 s2 a b

8 of 20 Octopus: document handling SDF: action-based, Petri net subclass (marked graph) Firing delays fast optimal schedule computation

9 of 20 Octopus: document handling Special challenge: modeling USB storage/retrieval. unidirectional capacity: H, bidirectional capacity: L capacities L,H in MB/sec satisfying L < H < 2L. Suppose 3H upstream; after 1 sec L downstream timing diagram: (H-L)/H H L 2L

10 of 20 Octopus: document handling USB model: hybrid system. Discrete approximation in TA possible. Exact CPN model by data manipulation. SDF model is still under construction.

11 of 20 Octopus: document handling Experiences so far: - coordination via regular meetings - agreement on parameters of common model - mutual validation has been achieved (despite several difficulties) Next stages: - validation with current project - exploration of engineering alternatives - adaptivity?

12 of 20 Octopus: document handling CPN tradeoff: structure in net vs. color more structure visual model low-level less flexible structure in color opaque high-level flexibility TA tradeoff: model vs. predicate constraints in model smaller state space more models constraints in predicate larger state space less models (flexibility) Some difficulties were caused by the solutions that the various frameworks allow.

13 of 20 Octopus: document handling CPN model therefore opts for flexibility. Other difficulties caused by unstable requirements. color set JOB: sequence of tasks. a b [a,b] x != [ ] x tail(x)

14 of 20 Octopus: document handling jobQ JOB scannerscanIPIP1IP2USBprintIP started Job JOB scheduler Job Generator new Job JOB memory INT

15 of 20 Octopus: document handling start do free jobQ JOB started Job JOB comp Info paper Info end parameters structure of scanner, scanIP, IP1, IP2, printIP

16 of 20 Octopus: document handling job in join trigger USB jobList update job out Job Rate LastUpdateTime JOB structure of USB subnet

17 of 20 Octopus: document handling x H L 2L Depicted USB scenario: 0 U H03 1 UL13+x DL12 2UH2 3UH3 3+x- time job rate last_update_timetrigger x=(H-L)/H

18 of 20 Octopus: document handling TA, SDF: find "optimal" schedule within state space for a given job sequence CPN: nondeterministic eager execution Mutual validation of models: - remove freedom - model within intersection - compare generated schedules (traces) Mutual validation: do the models match?

19 of 20 Octopus: document handling Modeling power vs. analysis options: CPN: most power, least analyzable. SDF: least power, analysis limited but fast TA: wide range of analysis options danger of state space explosion Possible developments for Océ: - competition - cooperation

20 of 20 Octopus: document handling Conclusions: Combination of formal frameworks interesting, but time-consuming. More time needed for assessment. Questions?