We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byAgustin Keech
Modified over 3 years ago
a university for the world real R © 2009, www.yawlfoundation.org Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede
a university for the world real R 2 © 2009, www.yawlfoundation.org Overview Introduction Informal semantics Formal semantics Algorithm Optimisation Conclusions
a university for the world real R 3 © 2009, www.yawlfoundation.org The Many Ways to Join When is task D enabled? Three choices: XOR, AND, and OR AND-join –Full synchronization XOR-join –No synchronization OR-join –Active paths synchronization A B D C
a university for the world real R 4 © 2009, www.yawlfoundation.org Non-local semantics of a General OR-Join ("bus driver semantics")
a university for the world real R 5 © 2009, www.yawlfoundation.org Advanced Synchronization: OR-join Synchronization is only performed for active threads Difficult to formally capture a desired informal semantics Difficult to determine when to enable an OR-join task Synchronizing Merge pattern in Workflow patterns
a university for the world real R 6 © 2009, www.yawlfoundation.org Different interpretations OR Gateway in BPMN OR-join in Event-driven Process Chains (EPCs) OR-join in workflow systems e.g. InConcert, eProcess, MQ workflow Syntactic restrictions Vicious Circles Local semantics No formal semantics
a university for the world real R 7 © 2009, www.yawlfoundation.org Informal semantics
a university for the world real R 8 © 2009, www.yawlfoundation.org OR-join An OR-join is enabled at a marking iff –there is at least one token in one of its input conditions and –It is not possible for more tokens to arrive in other empty input conditions in the reachable markings from the current marking An OR-join task is not enabled at a marking iff –it is possible to place tokens in the unmarked input conditions of an OR-join task in the reachable markings from the current marking Enabled?
a university for the world real R 9 © 2009, www.yawlfoundation.org Challenges How to capture the non-local semantics? Formal semantics without syntactical restrictions –Structural restrictions - InConcert, eProcess, MQ Workflow (acyclic) –True/False tokens Complications for complex workflows –Unstructured –Cancelation regions –Multiple OR-joins –Loops
a university for the world real R 10 © 2009, www.yawlfoundation.org Unstructured workflows E should only wait for tokens in c5 and c6 (two paths) Not the three paths from the corresponding OR-split after A
a university for the world real R 11 © 2009, www.yawlfoundation.org Cancelation regions Cancellation region of task D – c2, C, c5 M=c2+c3+c4 -C-> M’= c3+c4+c5, E is not enabled M=c3+c4+c5 -D-> c4+c6 (Remove token from c5), E is enabled How to predict that E should be enabled at c3+c4+c5 without doing a reachability analysis?
a university for the world real R 12 © 2009, www.yawlfoundation.org Multiple OR-joins Two OR-joins E and F What happens at marking c1+c3? How should we treat E when considering when F should be enabled?
a university for the world real R 13 © 2009, www.yawlfoundation.org Formal semantics
a university for the world real R 14 © 2009, www.yawlfoundation.org Considerations How to deal with complex constructs supported in YAWL? –Unstructured workflows –Cancelation, hierarchy, multiple instances, loops –Multiple OR-joins Reset nets – extend Petri nets with reset arcs OR-join semantics are defined in terms of Reset nets –Support for cancelation regions
a university for the world real R 15 © 2009, www.yawlfoundation.org Reset nets 1.Transition removes all tokens and not just one when it fires 2.Reset action can be ineffective 3.A reset arc can affect any place in the entire net Reachability notion is undecidable for reset nets with more than two reset arcs Coverability notion is decidable using backwards firing algorithm Complexity of a reset arc
a university for the world real R 16 © 2009, www.yawlfoundation.org Backwards firing rule Backwards search techniques of Well-structured Transition Systems Input places that are not reset places –Add one token Output places that are not reset places –Remove one token Reset places that are also input places –Add one token (coverability)
a university for the world real R 17 © 2009, www.yawlfoundation.org Semantics (Reset nets) An OR-join in a YAWL net is enabled at a marking M iff –M has tokens in one or more input conditions of the OR-join and – there is no marking in the future states of the corresponding reset net that covers M.
a university for the world real R 18 © 2009, www.yawlfoundation.org Transformations
a university for the world real R 19 © 2009, www.yawlfoundation.org Constructs affecting the semantics Cancelation regions (reset nets) Structured, unstructured and infinite loops (coverability) Composite tasks, Multiple instances (atomic tasks) Multiple OR-joins Ignore other OR-joins Treat them as AND-joins (Pessimistic) Treat them as XOR-joins (Optimistic)
a university for the world real R 20 © 2009, www.yawlfoundation.org Characteristics General – no syntactical restriction – closely matches the informal semantics – behave as expected even for unsound nets Formal –defined using reset nets formalism –decided using backwards coverability algorithm Decidable –algorithm is applicable for workflows with cancelation, multiple OR-joins and loops
a university for the world real R 21 © 2009, www.yawlfoundation.org Algorithm
a university for the world real R 22 © 2009, www.yawlfoundation.org Algorithm 1.Transform a YAWL net into a Reset-net 2.Generate a set of possible enabling markings X 3.For each marking x in X, generate a set of backwards coverable markings X’ 4.Check if the current Marking M or a smaller marking is found in X’ 5.If so, returns False – the OR-join is not enabled at M 6.Otherwise, returns True - the OR-join is enabled at M
a university for the world real R 23 © 2009, www.yawlfoundation.org At marking c1+c7 task G is enabled if and only if.... Example
a university for the world real R 24 © 2009, www.yawlfoundation.org At marking c1+c7 task G is enabled if and only if....... it is possible to cover c6+c7! Example (Reset net)
a university for the world real R 25 © 2009, www.yawlfoundation.org G is not enabled !
a university for the world real R 26 © 2009, www.yawlfoundation.org Carrier Appointment Example OR-join Analysis: Create Bill of Lading c1+c2 -> False (can cover c1+c4) c2+c3 -> False (can cover c3+c4) c1+c4 -> True c3+c4 -> True
a university for the world real R 27 © 2009, www.yawlfoundation.org Optimization
a university for the world real R 28 © 2009, www.yawlfoundation.org Optimization –Structural restriction Remove parts of the net not associated with an OR-join Restrict the search space using structural info Apply once for each OR-join –Active projection Ignore parts of the net that cannot be marked from a given marking Restrict the search space using marking-dependent info Apply once for every marking change
a university for the world real R 29 © 2009, www.yawlfoundation.org Applying Optimisation to Carrier Appt example
a university for the world real R 30 © 2009, www.yawlfoundation.org Implementation in YAWL OR-join enabling algorithm –Computationally very expensive Engine –Algorithm with optimization techniques Editor –Reduction rules for OR-joins –Soundness property –OR-joins in a cycle –Unnecessary OR-joins check
a university for the world real R 31 © 2009, www.yawlfoundation.org Conclusions Introduction –Advanced synchronization: the OR-join construct in YAWL Informal semantics –Wait to synchronize and proceed when it is not possible Formal semantics –Reset nets, Backwards coverability Algorithm –Expensive, repetitive Optimization –Structural restriction, Active projection
A university for the world real R © 2009, Appendix A The Order Fulfillment Process Model Marcello La Rosa Stephan Clemens Arthur.
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining Nikola Trčka Mykola Pechenizkiy.
Self-Timed Logic Timing complexity growing in digital design -Wiring delays can dominate timing analysis (increasing interdependence between logical and.
On 1-soundness and Soundness of Workflow Nets Lu Ping, Hu Hao and Lü Jian Department of Computer Science Nanjing University
Lecture 24 MAS 714 Hartmut Klauck
Models of Concurrency Manna, Pnueli.
Knowledge Based Synthesis of Control for Distributed Systems Doron Peled.
Process Models In this section, we focus on the control-flow perspective of processes. We assume that there is a set of activity labels.
Based on: Petri Nets and Industrial Applications: A Tutorial
Some Properties of SSA Mooly Sagiv. Outline Why is it called Static Single Assignment form What does it buy us? How much does it cost us? Open questions.
Methods for Knowledge Based Controlling of Distributed Systems Saddek Bensalem, Marius Bozga, Susanne Graf, Doron Peled, Sophie Quinton.
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 7: Learning in recurrent networks Geoffrey Hinton.
CPSC 502, Lecture 15Slide 1 Introduction to Artificial Intelligence (AI) Computer Science cpsc502, Lecture 15 Nov, 1, 2011 Slide credit: C. Conati, S.
A university for the world real R © 2009, Chapter 1 Introduction Wil van der Aalst Michael Adams Arthur ter Hofstede Nick Russel.
A university for the world real R © 2009, Chapter 2 The Language: Rationale and Fundamentals (Part I) Nick Russell Arthur ter Hofstede.
Software and Systems Engineering Seminar Winter 2011 Domain-specific languages in model-driven software engineering 1 Speaker: Valentin ROBERT.
Self-Timed Systems Timing complexity growing in digital design -Wiring delays can dominate timing analysis (increasing interdependence between logical.
A Novel Method For Fast Model Checking Project Report.
Towards Workflow Pattern Support of Event-Driven Process Chains (EPC) Jan Mendling, Gustaf Neumann Dept. of IS and New Media, WU Wien, Austria Markus Nüttgens.
© 2018 SlidePlayer.com Inc. All rights reserved.