1 Lectures 5,6 – Workflows and Internet Process Coordination Middleware: the glue for network computing Workflows and Internet Workflows Enabling Technologies.

Slides:



Advertisements
Similar presentations
Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.
Advertisements

Adempiere Technical Training Day 5. Processes prepare method for getting the parameters into variables – Record_ID just work for buttons doIt method for.
Reducing DFA’s Section 2.4. Reduction of DFA For any language, there are many DFA’s that accept the language Why would we want to find the smallest? Algorithm:
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Software and Systems Engineering Seminar Winter 2011 Domain-specific languages in model-driven software engineering 1 Speaker: Valentin ROBERT.
Process Patterns in BizAGI. Slide 2 Overview Types of events Types of gateways Design patterns list.
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.
SE 555 Software Requirements & Specification 1 Activity Diagrams.
1 Software Testing and Quality Assurance Lecture 41 – Software Quality Assurance.
Chapter 8: Modelling Interactions and Behaviour
1 SWE Introduction to Software Engineering Lecture 5.
CSE 311: Foundations of Computing Fall 2014 Lecture 23: State Minimization, NFAs.
Software Design Processes and Management
Intelligent Workflow Management System(iWMS). Agenda Background Motivation Usage Potential application domains iWMS.
A university for the world real R © 2009, Chapter 18 Process Configuration Florian Gottschalk Marcello La Rosa.
Object-Oriented Software Engineering Practical Software Development using UML and Java Chapter 8: Modelling Interactions and Behaviour.
Object-Oriented Software Engineering Practical Software Development using UML and Java Chapter 8: Modelling Interactions and Behaviour.
Chapter Intranet Agents. Chapter Background Intranet: an internal corporate network based on Internet technology. Typically, an intranet can.
Slide 16B.51 © The McGraw-Hill Companies, 2005 Object-Oriented and Classical Software Engineering.
CONTENTS Arrival Characters Definition Merits Chararterstics Workflows Wfms Workflow engine Workflows levels & categories.
SOFTWARE DESIGN AND ARCHITECTURE LECTURE 21. Review ANALYSIS PHASE (OBJECT ORIENTED DESIGN) Functional Modeling – Use case Diagram Description.
CSE 421 Algorithms Richard Anderson Lecture 24 Network Flow Applications.
Physical Mapping of DNA BIO/CS 471 – Algorithms for Bioinformatics.
Interaction Models (2): Sequence Diagrams Extracted from textbook: Object Oriented Modeling and Design with UML M. Blaha, J. Rumbaugh 1.
1 Devon M. Simmonds University of North Carolina, Wilmington CSC450 Software Engineering WorkFlow Modeling with Activity Diagrams.
Web Services Flow Language Guoqiang Wang Oct 7, 2002.
Software Engineering Prof. Ing. Ivo Vondrak, CSc. Dept. of Computer Science Technical University of Ostrava
1 Qualitative Reasoning of Distributed Object Design Nima Kaveh & Wolfgang Emmerich Software Systems Engineering Dept. Computer Science University College.
Course Instructor: Kashif Ihsan 1. Chapter # 3 2.
Information System Design IT60105
Process-oriented System Analysis Process Mining. BPM Lifecycle.
EEL 5937 Managing mutability in agents EEL 5937 Multi Agent Systems Lecture 26, April 10, 2003 Lotzi Bölöni.
BPEL Business Process Engineering Language A technology used to build programs in SOA architecture.
OMT Modeling 1. Object Model : presented by the object model and the data dictionary. 2. Dynamic Model: presented by the state diagrams and event flow.
Systems Analysis and Design in a Changing World, Fourth Edition
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 8 Lecture 8 Network Flow Based Modeling Mustafa Ozdal Computer Engineering Department,
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
CSE 486/586 CSE 486/586 Distributed Systems Global States Steve Ko Computer Sciences and Engineering University at Buffalo.
 Activity diagram is basically a flow chart to represent the flow from one activity to another activity.
MTAT Business Process Management Lecture 2 – Process Modeling I Marlon Dumas marlon.dumas ät ut. ee 1.
Interaction Models (2): Activity Diagrams Extracted from textbook: Object Oriented Modeling and Design with UML M. Blaha, J. Rumbaugh.
7 Systems Analysis – ITEC 3155 The Object Oriented Approach – Use Cases.
Interstage BPM v11.2 1Copyright © 2010 FUJITSU LIMITED BUSINESS PROCESS MANAGEMENT CONCEPTS.
Diagnostic Information for Control-Flow Analysis of Workflow Graphs (aka Free-Choice Workflow Nets) Cédric Favre(1,2), Hagen Völzer(1), Peter Müller(2)
Technology of information systems Lecture 5 Process management.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
Distributed Systems Lecture 6 Global states and snapshots 1.
Reducing Structural Bias in Technology Mapping
Constraint-Based Routing
CSS 496 Business Process Re-engineering for BS(CS)
Unified Modeling Language
Activity Diagram.
CSS 496 Business Process Re-engineering for BS(CS)
State Machine Diagrams
Network Flow.
18-WAN Technologies and Dynamic routing
Concurrent Systems Modeling using Petri Nets – Part II
Marlon Dumas marlon.dumas ät ut . ee
Deadlocks Definition A set of processes is in a Deadlock state when every process in the set is waiting for an event that can only be caused by another.
COT 5611 Operating Systems Design Principles Spring 2012
CSS 496 Business Process Re-engineering for BS(CS)
Additional Example 2: Graphing Ordered Pairs Graph and label each point on a coordinate grid. A. L (3, 5) Start at (0, 0)
Algorithms (2IL15) – Lecture 7
Petri nets.
ITEC452 Distributed Computing Lecture 8 Distributed Snapshot
Maximum Bipartite Matching
Interaction Models (2): Activity Diagrams
Task 57 Scope – Job Task Purpose – Specifically –
Presentation transcript:

1 Lectures 5,6 – Workflows and Internet Process Coordination Middleware: the glue for network computing Workflows and Internet Workflows Enabling Technologies Static/Dynamic workflows Tasks and Events Transition Systems Workflow Patterns Liveness Deadlocks

2

3 Workflows Informal definition. Traditional applications: Office automation and document processing Factory automation Business Internet workflows, iWM. Examples Service grids Computational grids

4 Enabling technologies

5 Areas involved in iWM

6

7

8 Lifecycle of a workflow Creation – process definition Process verification Cases Workflow enactment The Workflow Management Coalition Multibillion $ industry Workflow Reference Model

9

10 Static/dynamic workflows Static workflows Dynamic workflows Exception handling Reversibility.

11

12 Workflow enactment Case: a particular instance of a workflow Workflow enactment engine  performs a coordination function Tasks/Activities and Events.

13

14

15 Transition systems A directed graph: Nodes  the states of the system Edges  events Two distinguished states: Initial state – no incoming edge Goal/termination state – no outgoing edge Example: laptop assembly. States labeled by the events causing the transition.

16

17 Algorithm to construct the transition system from the event-task graph 1. Construct the set of E of individual events: E={1,2,3,4,5,6,7,8,9} 2. Split it into equivalence classes based upon the causality relationship: E1 = {1,2,3,4,9} E2 = {1,5,6,7,8,9} The two sets are not disjoint!!

18 Algorithm to construct the transition system from the event-task graph 3. Add to E all feasible combinations of events. Each feasible combinations contains one event from each class. Example: [2,5], [3,5] are feasible combinations [2,3] is not a feasible combination

19 Algorithm to construct the transition system from the event-task graph 4. Construct the set of states S. Initially S contains only the initial state. Construct the set of all events feasible in that state. For each event in that state label the state reachable when the event occurs. Add the new state to S Repeat the process for every state in S.

20 Choices

21 Liveness

22 Basic workflow patterns Sequence AND-split Synchronization XOR – spli XOR – merge OR – split Multiple merge Discriminator N out of M join Deferred choice

23

24 Resources and deadlocks

25 Agents and workflow enactment Hybrid systems: some tasks carried out by computers, others by humans. Why use agents for workflow enactment?

26

27

28