CS 770 Process Engineering
Scroll down for lecture material
Slot 9, CC 101 Classroom
9A - Mon - 3:30 - 4:55 pm
9B - Thu - 3:30 - 4:55 pm
A few lines about the course:
The course builds up background and depth into a new paradigm of programming in the large. Modern programs involve multiple actors, who interact with and through the same system. Examples of such systems come from various sectors such as online businesses, e-governance, e-facilities, e-shopping, and online interactive multi-user facility apps. Each of them have one commonality: they all have processes, involving multiple tasks to be accomplished, concurrency, multiple roles and computers carrying out those tasks, and the tasks may have intricate interdepencies among them. Such programs ideally never terminate. The course is all about engineering of such programs, and hence the name: Process Engineering. We first beging with theoretical foundations of processes via the Petri Nets model. We will understand how Petri nets work, and then build models using them, we will learn to analyze the models to find out if they indeed support the expected behvaior. We will look into three types of Petri Nets: Elementary Nets, General Nets, and Colored Nets. You will be using various tools to create and analyze Petri Net models.
This is a major part of the course. Then we cover OMG's visual BPMN modeling language, and learn to create and analyze models in BPMN. There will be a special focus on how to model Event-based Processes in BPMN. We discuss Process Pattterns on the way. Then we look into the problems of Process Mining algorithms and Process Migration consistency. Somewhere as the course progresses, we will also touch upon what typically happens inside process engines, popularly called workflow engines.
Througout, you can expect to have a highly interactive model of classroom. There will be a plenty of assignmemts, many of which will be in-class assignments.
Copying and Plagiarism policy:
It will be dealt with as per D-DAC policy.
Copying and plagiarism is strictly prohibited. Individual take homes will
have be done by individuals on their own. Collaborations and discussions during classroom solving times will be encouraged, as per the schemes set for the respective classes.
Attendance policy:
Attendance is compulsory and 85% attendance will be enforced.
Evaluation Scheme:
In class participation in every class + (Individual take-homes, Groups-of-2 projects) and presentations + Written tests-quizzes, midsem, endsem. Continuous engagaement will be a key value.
Lectures
Lecture 1: Elementary Petri Nets, The Model and Firing Rules, Traces (Jan 6)
slides
net used for analysis
boardpic1
boardpic2
Lecture 2: Marked Nets and their Reachability Graphs (Jan 9)
net used for analysis
boardpic1
boardpic2
boardpic3