This document discusses an approach called "compliance by design" for ensuring that artifact-centric business processes are compliant with regulations. It involves:
1) Specifying a business process model, artifacts, agents, locations and goals
2) Translating legal texts into compliance rules
3) Modeling the compliance rules and integrating them with the business process model
4) Using tools to generate a compliant business process model that satisfies both behavioral and compliance requirements.
This approach aims to avoid subsequent proofs of compliance by building compliance into the design from the start. It also allows flexibility to change compliance rules without needing to regenerate the entire process model.
Object Oriented Business Process AnalysisGraham McLeod
The document discusses comprehensive object-oriented business process analysis. It provides an agenda for a tutorial that will cover business imperatives, enterprise modeling, stakeholders, value chains, business processes, business engineering, system-level modeling, and mapping models to layered architectures. The tutorial will use techniques like activity diagrams to model current and future business processes.
Towards Flexible, Adaptable & Compliant Process-Aware Information Systems wit...Thomas Hildebrandt
Slides for talk given at the ZISC Institute, ETH Zurich, November 27th, 2015.
Abstract of talk:
Software systems today support complex processes and interactions between humans and
machines in many different variants, from the embedded controllers in cars to workflow
systems in hospitals and case management systems in banks. On the one hand, such
process-aware information systems often operate in unpredictable and changing contexts
which calls for both flexibility and adaptability. On the other hand, it is getting more
and more critical that the software system behaves correctly and is compliant with safety,
security and legal regulations.
In the talk we will address the short-comings of the state-of-the-art industrial standards
for process-aware information systems, in particular the process notations employed in
business process management systems. We then present and demonstrate a new event-based and
declarative process notation and modelling approach for the design of flexible, adaptable
and compliant process-aware information systems called Dynamic Condition Response (DCR)
graphs. DCR Graphs have been developed at IT University of Copenhagen in collaboration
with the danish company Exformatics and has been implemented in an industrial process
design tool, DCRGraphs.net and the Exformatics Enterprise Content and Adaptive Case
Management solution. The talk will contain examples of applications of the DCR Graphs
approach to case management, emergency management and security and will be concluded with
an overview of ongoing work and challenges.
The work is supported by the The Danish Council for Strategic Research, the Royal Danish
Defence College, IT University of Copenhagen, the Velux Foundation, Resultmaker and
Exformatics.
Toward Design, Modelling and Analysis of Dynamic Workflow Reconfiguration: a ...Mazzara1976
The document discusses modeling dynamic workflow reconfiguration using a process algebra perspective. It analyzes requirements for modeling reconfiguration and compares existing formalisms. It then introduces a novel formalism called Webπ∞ that can model reconfiguration through concepts like workunits and event handlers. The formalism is applied to a case study on reconfiguring an order processing workflow. Verification challenges are discussed and a WS-BPEL implementation approach is presented.
This document summarizes a student project on stabilizing and balancing linear and rotary inverted pendulum systems. It discusses the design and implementation of PID controllers to balance an inverted pendulum mounted on a cart (linear system) and a rotary inverted pendulum prototype. Key steps included mathematical modeling, simulation in MATLAB, PID controller tuning, and applying the controller to experimental setups. Results showed the systems could be stabilized using optimized PID and LQR controllers designed via pole placement and minimizing cost functions.
Invited presentation given by Niels Lohmann on December 3, 2013 in Potsdam, Germany as invited lecture at the Business Process Compliance course at the Hasso-Plattner-Institute.
Where did I go wrong? Explaining errors in process modelsUniversität Rostock
Workshop presentation given by Niels Lohmann on February 20, 2014 in Potsdam, Germany at the Sixth Central-European Workshop on Services and their Composition (ZEUS 2014).
Object Oriented Business Process AnalysisGraham McLeod
The document discusses comprehensive object-oriented business process analysis. It provides an agenda for a tutorial that will cover business imperatives, enterprise modeling, stakeholders, value chains, business processes, business engineering, system-level modeling, and mapping models to layered architectures. The tutorial will use techniques like activity diagrams to model current and future business processes.
Towards Flexible, Adaptable & Compliant Process-Aware Information Systems wit...Thomas Hildebrandt
Slides for talk given at the ZISC Institute, ETH Zurich, November 27th, 2015.
Abstract of talk:
Software systems today support complex processes and interactions between humans and
machines in many different variants, from the embedded controllers in cars to workflow
systems in hospitals and case management systems in banks. On the one hand, such
process-aware information systems often operate in unpredictable and changing contexts
which calls for both flexibility and adaptability. On the other hand, it is getting more
and more critical that the software system behaves correctly and is compliant with safety,
security and legal regulations.
In the talk we will address the short-comings of the state-of-the-art industrial standards
for process-aware information systems, in particular the process notations employed in
business process management systems. We then present and demonstrate a new event-based and
declarative process notation and modelling approach for the design of flexible, adaptable
and compliant process-aware information systems called Dynamic Condition Response (DCR)
graphs. DCR Graphs have been developed at IT University of Copenhagen in collaboration
with the danish company Exformatics and has been implemented in an industrial process
design tool, DCRGraphs.net and the Exformatics Enterprise Content and Adaptive Case
Management solution. The talk will contain examples of applications of the DCR Graphs
approach to case management, emergency management and security and will be concluded with
an overview of ongoing work and challenges.
The work is supported by the The Danish Council for Strategic Research, the Royal Danish
Defence College, IT University of Copenhagen, the Velux Foundation, Resultmaker and
Exformatics.
Toward Design, Modelling and Analysis of Dynamic Workflow Reconfiguration: a ...Mazzara1976
The document discusses modeling dynamic workflow reconfiguration using a process algebra perspective. It analyzes requirements for modeling reconfiguration and compares existing formalisms. It then introduces a novel formalism called Webπ∞ that can model reconfiguration through concepts like workunits and event handlers. The formalism is applied to a case study on reconfiguring an order processing workflow. Verification challenges are discussed and a WS-BPEL implementation approach is presented.
This document summarizes a student project on stabilizing and balancing linear and rotary inverted pendulum systems. It discusses the design and implementation of PID controllers to balance an inverted pendulum mounted on a cart (linear system) and a rotary inverted pendulum prototype. Key steps included mathematical modeling, simulation in MATLAB, PID controller tuning, and applying the controller to experimental setups. Results showed the systems could be stabilized using optimized PID and LQR controllers designed via pole placement and minimizing cost functions.
Invited presentation given by Niels Lohmann on December 3, 2013 in Potsdam, Germany as invited lecture at the Business Process Compliance course at the Hasso-Plattner-Institute.
Where did I go wrong? Explaining errors in process modelsUniversität Rostock
Workshop presentation given by Niels Lohmann on February 20, 2014 in Potsdam, Germany at the Sixth Central-European Workshop on Services and their Composition (ZEUS 2014).
Conference presentation given by Niels Lohmann on December 6, 2011 in Paphos, Cyprus at the Ninth International Conference on Service-Oriented Computing (ICSOC 2011).
Workshop presentation given by Niels Lohmann on December 5, 2011 in Paphos, Cyprus at the 6th International Workshop on Engineering Service-Oriented Applications (WESOA'11).
LoLA is an explicit-state model checker for Petri nets that focuses on standard properties and uses many reduction techniques such as stubborn sets, symmetries, and sweep-line heuristics to efficiently analyze large state spaces. It takes Petri nets as input in the form of place/transition nets or high-level algebraic nets and allows users to specify verification tasks involving properties such as boundedness, reachability, and temporal logics. LoLA is open source and has been used in several case studies to generate experimental results tables exploring the impact of basic design decisions.
The document describes various techniques for implementing a Petri net state space search:
1. It discusses how transitions are fired and states are evaluated by marking changed places and checking enabled transitions.
2. State predicates are stored in negation-free normal form to efficiently check state properties.
3. The state space is managed by representing states as bit vectors and organizing them in a decision tree for fast lookup and insertion.
4. Search organization involves firing transitions, finding/inserting states, and backtracking with a search stack and write-only memory approach.
This document discusses integrating the LoLA model checker as a web service for verifying Petri net properties. It lists soundness checks that LoLA can perform, including classical, weak, and relaxed soundness. It provides URLs for editing Petri nets in Oryx and calling the LoLA web service from the University of Rostock service technology site to verify properties by translating nets from PNML to LoLA format and running LoLA as a system call.
Niels Lohmann explores several case studies applying symbolic systems biology techniques:
1) Analyzing biochemical reaction chains using the tool LoLA for fast reachability queries.
2) Finding hazards in Globally Asynchronous Locally Synchronous (GALS) circuits design using Petri nets and partial order reduction.
3) Verifying service choreographies for deadlocks by translating models to open workflow nets and discovering a design flaw.
LoLA is a tool for verifying properties of Petri nets. This document discusses how to:
1. Choose and manage LoLA configurations to optimally verify properties.
2. Ask the right verification questions in a specific, modular way to efficiently verify properties.
3. Optimize Petri net modeling to take advantage of LoLA's reduction techniques and scale verification.
4. Employ scripts and makefiles to automate calling LoLA and analyzing results.
5. Integrate calling LoLA from other tools using UNIX streams for modular verification.
The document summarizes the stubborn set method for state space reduction in Petri nets. It explains that the method works by defining a stubborn set of transitions in each marking that can fire independently of transitions outside the set. This allows reducing the state space by only exploring firings within each stubborn set, while still preserving properties like deadlocks. The proof for deadlock preservation is also outlined.
LoLA is an open source tool for verifying properties of Petri nets through explicit state space generation. It features many state space reduction techniques and can verify standard properties like boundedness, reachability, and LTL/CTL formulas. LoLA was created to generate experimental results tables and explore basic design decisions like having no GUI and generating a dedicated state space for each property. It has been under development since 1998 and is aimed at helping users verify realistic models efficiently.
The document describes the input language for the LoLA model checker. It allows specifying Petri nets and verification tasks in a high-level algebraic style. Key elements include:
1. Defining sorts, operations, and their interpretations to specify the types and functions used.
2. Declaring high-level places and markings as terms over sorts to represent multiple low-level places and tokens.
3. Specifying high-level transitions as procedures with guards and input/output terms to represent multiple low-level transitions.
4. Providing verification tasks as logical formulas involving state predicates to check properties over the unfolded net.
The document discusses applying counterexample guided abstraction refinement (CEGAR) to verifying properties of Petri nets. It summarizes using the Petri net state equation to represent reachable markings as solutions to a system of linear equations. It then describes using CEGAR to iteratively check solutions and refine the abstraction by adding increments when solutions are found to be infeasible. The approach is implemented in a tool called Sara which shows better performance than other tools on verification problems involving large Petri nets and parameterized systems.
This document describes a joint research project between the University of Rostock's Computer Science and Electrical Engineering departments. The project aims to develop tools and formal methods for analyzing systems and synthesizing web services for resource-constrained devices. This will be done by applying the Devices Profile for Web Services (DPWS) standard, which allows using web service technology on embedded systems and sensor networks in a way that is compatible with existing enterprise web services. The goal is to enable web service capabilities on more intelligent devices that increasingly communicate with each other.
Workshop presentation given by Niels Lohmann on February 22, 2011 in Karlsruhe, Germany at the Third Central-European Workshop on Services and their Composition (ZEUS 2011).
This document compares Petri nets and state spaces for modeling and verification. It discusses that state spaces allow modeling global state changes over time, while Petri nets consider asynchronous components and causality of events. The document also describes techniques for efficient state space generation from Petri nets, such as checking enabled transitions with constant time, firing transitions with constant effort, backtracking transitions, and storing markings in a set. Reduction techniques like linear algebra, sweep-line methods, symmetries, and stubborn sets are also covered to reduce the state space.
Formale Fundierung und effizientere Implementierung der schrittbasierten TLDA...Universität Rostock
Presentation given by Niels Lohmann on September 23, 2005 in Berlin, Germany; Talk given at the diploma defense ceremony at Humboldt-Universität zu Berlin.
Tool demonstration given by Niels Lohmann on September 1, 2006 in Eindhoven, The Netherlands at the Berlin-Eindhoven Service Technology Colloquium 2006 (B.E.S.T. 2006).
service-technology.org — A tool family for correct business processes and ser...Universität Rostock
Tool demonstration given by Niels Lohmann on September 16, 2010 in Hoboken, NJ, USA at the Eighth International Conference on Business Process Management (BPM 2010).
Invited presentation given by Niels Lohmann on June 27, 2006 in Turku, Finland as part of the Advanced Tutorial on Petri Net Modelling of Business Processes; satellite event of the PETRI NETS 2006/ACSD 2006 conferences.
Workshop presentation given by Niels Lohmann on August 16, 2007 in Eindhoven, The Netherlands at the Berlin-Eindhoven Service Technology Colloquium 2007 (B.E.S.T. 2007).
Conference presentation given by Niels Lohmann on December 6, 2011 in Paphos, Cyprus at the Ninth International Conference on Service-Oriented Computing (ICSOC 2011).
Workshop presentation given by Niels Lohmann on December 5, 2011 in Paphos, Cyprus at the 6th International Workshop on Engineering Service-Oriented Applications (WESOA'11).
LoLA is an explicit-state model checker for Petri nets that focuses on standard properties and uses many reduction techniques such as stubborn sets, symmetries, and sweep-line heuristics to efficiently analyze large state spaces. It takes Petri nets as input in the form of place/transition nets or high-level algebraic nets and allows users to specify verification tasks involving properties such as boundedness, reachability, and temporal logics. LoLA is open source and has been used in several case studies to generate experimental results tables exploring the impact of basic design decisions.
The document describes various techniques for implementing a Petri net state space search:
1. It discusses how transitions are fired and states are evaluated by marking changed places and checking enabled transitions.
2. State predicates are stored in negation-free normal form to efficiently check state properties.
3. The state space is managed by representing states as bit vectors and organizing them in a decision tree for fast lookup and insertion.
4. Search organization involves firing transitions, finding/inserting states, and backtracking with a search stack and write-only memory approach.
This document discusses integrating the LoLA model checker as a web service for verifying Petri net properties. It lists soundness checks that LoLA can perform, including classical, weak, and relaxed soundness. It provides URLs for editing Petri nets in Oryx and calling the LoLA web service from the University of Rostock service technology site to verify properties by translating nets from PNML to LoLA format and running LoLA as a system call.
Niels Lohmann explores several case studies applying symbolic systems biology techniques:
1) Analyzing biochemical reaction chains using the tool LoLA for fast reachability queries.
2) Finding hazards in Globally Asynchronous Locally Synchronous (GALS) circuits design using Petri nets and partial order reduction.
3) Verifying service choreographies for deadlocks by translating models to open workflow nets and discovering a design flaw.
LoLA is a tool for verifying properties of Petri nets. This document discusses how to:
1. Choose and manage LoLA configurations to optimally verify properties.
2. Ask the right verification questions in a specific, modular way to efficiently verify properties.
3. Optimize Petri net modeling to take advantage of LoLA's reduction techniques and scale verification.
4. Employ scripts and makefiles to automate calling LoLA and analyzing results.
5. Integrate calling LoLA from other tools using UNIX streams for modular verification.
The document summarizes the stubborn set method for state space reduction in Petri nets. It explains that the method works by defining a stubborn set of transitions in each marking that can fire independently of transitions outside the set. This allows reducing the state space by only exploring firings within each stubborn set, while still preserving properties like deadlocks. The proof for deadlock preservation is also outlined.
LoLA is an open source tool for verifying properties of Petri nets through explicit state space generation. It features many state space reduction techniques and can verify standard properties like boundedness, reachability, and LTL/CTL formulas. LoLA was created to generate experimental results tables and explore basic design decisions like having no GUI and generating a dedicated state space for each property. It has been under development since 1998 and is aimed at helping users verify realistic models efficiently.
The document describes the input language for the LoLA model checker. It allows specifying Petri nets and verification tasks in a high-level algebraic style. Key elements include:
1. Defining sorts, operations, and their interpretations to specify the types and functions used.
2. Declaring high-level places and markings as terms over sorts to represent multiple low-level places and tokens.
3. Specifying high-level transitions as procedures with guards and input/output terms to represent multiple low-level transitions.
4. Providing verification tasks as logical formulas involving state predicates to check properties over the unfolded net.
The document discusses applying counterexample guided abstraction refinement (CEGAR) to verifying properties of Petri nets. It summarizes using the Petri net state equation to represent reachable markings as solutions to a system of linear equations. It then describes using CEGAR to iteratively check solutions and refine the abstraction by adding increments when solutions are found to be infeasible. The approach is implemented in a tool called Sara which shows better performance than other tools on verification problems involving large Petri nets and parameterized systems.
This document describes a joint research project between the University of Rostock's Computer Science and Electrical Engineering departments. The project aims to develop tools and formal methods for analyzing systems and synthesizing web services for resource-constrained devices. This will be done by applying the Devices Profile for Web Services (DPWS) standard, which allows using web service technology on embedded systems and sensor networks in a way that is compatible with existing enterprise web services. The goal is to enable web service capabilities on more intelligent devices that increasingly communicate with each other.
Workshop presentation given by Niels Lohmann on February 22, 2011 in Karlsruhe, Germany at the Third Central-European Workshop on Services and their Composition (ZEUS 2011).
This document compares Petri nets and state spaces for modeling and verification. It discusses that state spaces allow modeling global state changes over time, while Petri nets consider asynchronous components and causality of events. The document also describes techniques for efficient state space generation from Petri nets, such as checking enabled transitions with constant time, firing transitions with constant effort, backtracking transitions, and storing markings in a set. Reduction techniques like linear algebra, sweep-line methods, symmetries, and stubborn sets are also covered to reduce the state space.
Formale Fundierung und effizientere Implementierung der schrittbasierten TLDA...Universität Rostock
Presentation given by Niels Lohmann on September 23, 2005 in Berlin, Germany; Talk given at the diploma defense ceremony at Humboldt-Universität zu Berlin.
Tool demonstration given by Niels Lohmann on September 1, 2006 in Eindhoven, The Netherlands at the Berlin-Eindhoven Service Technology Colloquium 2006 (B.E.S.T. 2006).
service-technology.org — A tool family for correct business processes and ser...Universität Rostock
Tool demonstration given by Niels Lohmann on September 16, 2010 in Hoboken, NJ, USA at the Eighth International Conference on Business Process Management (BPM 2010).
Invited presentation given by Niels Lohmann on June 27, 2006 in Turku, Finland as part of the Advanced Tutorial on Petri Net Modelling of Business Processes; satellite event of the PETRI NETS 2006/ACSD 2006 conferences.
Workshop presentation given by Niels Lohmann on August 16, 2007 in Eindhoven, The Netherlands at the Berlin-Eindhoven Service Technology Colloquium 2007 (B.E.S.T. 2007).
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
12. CORRECTNESS BY DESIGN 3
SPECIFICATION CORRECT MODEL
BEHAVIOR
SOUNDNESS
DESCRIPTION
COMPLIANCE RULES COMPLIANCE
13. CORRECTNESS BY DESIGN 3
3
SPECIFICATION CORRECT MODEL
BEHAVIOR
DESCRIPTION 2 SOUNDNESS
COMPLIANCE RULES 1 COMPLIANCE
14. COMPLIANCE RULES 4
LEGAL TEXTS + REGULATIONS
OFTEN PROCESS-INDEPENDENT
TRANSLATED INTO
RULES BY DOMAIN
EXPERTS
ASSUMPTION:
RULES AFFECT MODEL’S BEHAVIOR
15. COMPLIANCE RULES 4
LEGAL TEXTS + REGULATIONS
OFTEN PROCESS-INDEPENDENT
TRANSLATED INTO
RULES BY DOMAIN
EXPERTS
ASSUMPTION:
RULES AFFECT MODEL’S BEHAVIOR
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
16. COMPLIANCE RULES 4
LEGAL TEXTS + REGULATIONS
OFTEN PROCESS-INDEPENDENT
TRANSLATED INTO
RULES BY DOMAIN
EXPERTS
ASSUMPTION:
RULES AFFECT MODEL’S BEHAVIOR
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
17. COMPLIANCE RULES 4
LEGAL TEXTS + REGULATIONS
OFTEN PROCESS-INDEPENDENT
TRANSLATED INTO
RULES BY DOMAIN
EXPERTS
ASSUMPTION:
RULES AFFECT MODEL’S BEHAVIOR
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
18. COMPLIANCE RULES 4
LEGAL TEXTS + REGULATIONS
OFTEN PROCESS-INDEPENDENT
TRANSLATED INTO
RULES BY DOMAIN
EXPERTS
ASSUMPTION:
RULES AFFECT MODEL’S BEHAVIOR
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
19. MODELING COMPLIANCE RULES 5
SUBMIT CREATE ARCHIVE
CLAIM SETTLEMENT CLAIM
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
20. MODELING COMPLIANCE RULES 5
SUBMIT CREATE ARCHIVE
CLAIM SETTLEMENT CLAIM
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
21. MODELING COMPLIANCE RULES 5
SUBMIT CREATE ARCHIVE
CLAIM SETTLEMENT CLAIM
CREATE
SETTLEMENT
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
22. MODELING COMPLIANCE RULES 5
ARCHIVE
CLAIM
SUBMIT CREATE ARCHIVE
CLAIM SETTLEMENT CLAIM
CREATE
SETTLEMENT
“The action ‘create settlement’ must be executed
a"er ‘submit claim’, but before ‘archive claim’.”
23. EXPRESSIVENESS 6
✔ ENFORCEMENT/EXCLUSION OF
ACTIONS AND DATA STATES
✔ ORDERING AND NUMBERING CONSTRAINTS
✔ DATA AND CONTROL FLOW CONCURRENCE
✔ FINITE LTL-X
27. ARTIFACT-CENTRIC BUSINESS PROCESS 7
CREATED
ACCEPTED RECEIVED
REJECTED CONFIRMED
QUOTE
ORDER FILED
“NOUN-CENTRIC”
DECLARATIVE
SENT
PAID ASSEMBLED
INVOICE PACKAGED
CARGO SHIPPED
[LOHMANN AND WOLF, ICSOC 2010]
28. ARTIFACT-CENTRIC BUSINESS PROCESS 7
CREATED
ACCEPTED RECEIVED
REJECTED CONFIRMED
QUOTE
ORDER FILED
“NOUN-CENTRIC”
DECLARATIVE
SENT
PAID ASSEMBLED
INVOICE PACKAGED
CARGO SHIPPED
[LOHMANN AND WOLF, ICSOC 2010]
29. ARTIFACTS 8
OBJECT LIFE CYCLE
EMPTY MODELS ARTIFACT’S
EVOLUTION
CREATED
ACCEPTED REJECTED
QUOTE
[LOHMANN AND WOLF, ICSOC 2010]
30. ARTIFACTS 8
OBJECT LIFE CYCLE
EMPTY MODELS ARTIFACT’S
EVOLUTION
SELLER
CREATED AGENTS
MAY EXECUTE
ARTIFACT’S TASKS
CUSTOMER CUSTOMER
ACCEPTED REJECTED
QUOTE
[LOHMANN AND WOLF, ICSOC 2010]
31. ARTIFACTS 8
OBJECT LIFE CYCLE
EMPTY MODELS ARTIFACT’S
EVOLUTION
SELLER @ SELLER
CREATED AGENTS
MAY EXECUTE
ARTIFACT’S TASKS
CUSTOMER CUSTOMER
LOCATIONS
ACCEPTED REJECTED INFLUENCE
QUOTE EXECUTABILITY @ SELLER
[LOHMANN AND WOLF, ICSOC 2010]
32. ARTIFACT-CENTRIC BUSINESS PROCESS 9
9
ARTIFACTS
+ AGENTS >
>
>
+ LOCATIONS >
>
>
= receive
order
create
quote
send
quote
quote
rejected
! POLICIES
>
>
quote
accepted +
confirm
order
send
invoice
payment
received +
>
> assemble ship
>
cargo cargo
>
; SOUND
✔ GOAL STATES BUSINESS PROCESS
[LOHMANN AND WOLF, ICSOC 2010]
33. ARTIFACT-CENTRIC BUSINESS PROCESS 9
9
ARTIFACTS >
+ AGENTS >
>
+ LOCATIONS >
>
>
=
!
receive create send quote
order quote quote rejected
POLICIES confirm
order
>
>
quote
accepted + send
invoice
payment
received +
✔ >
GOAL STATES >
assemble
cargo
ship
cargo
>
> SOUND AND
COMPLIANCE ; COMPLIANT
RULES BUSINESS PROCESS
34. ARTIFACT-CENTRIC BUSINESS PROCESS 9
9
ARTIFACTS > TOOL
+ AGENTS >
> SUPPORT
+ LOCATIONS >
>
>
=
POLICIES
>
>
>
GOAL STATES >
>
> SOUND AND
COMPLIANCE ; COMPLIANT
RULES BUSINESS PROCESS
35. POLICIES VS. COMPLIANCE RULES 10
POLICIES
! CONSTRAIN ARTIFACT BEHAVIOR
MAY DISABLE ARBITRARY ACTIONS
COMPLIANCE RULES
MONITOR ARTIFACT BEHAVIOR
MUST NOT DISABLE ACTIONS
NONCOMPLIANCE IS REFLECTED
BY NONFINAL STATES
36. DIAGNOSIS INFORMATION 11
COMPLIANCE BY DETECTION
CORRECT MODEL
REPAIR
CHECK COUNTEREXAMPLE MEANS:
CURRENT MODEL IS
SPECIFICATION
NONCOMPLIANT (YET..?)
COMPLIANCE BY CONSTRUCTION
COUNTEREXAMPLE MEANS:
PROCESS SPECIFICATION
CANNOT BE MADE SPECIFICATION CORRECT MODEL
COMPLIANT
37. TAKE-HOME POINTS 12
COMPLIANCE BY DESIGN
1 AVOIDS SUBSEQUENT PROOFS
EXPRESSIVENESS
2 A LOT OF RULES CAN BE EXPRESSED
FLEXIBILITY
3 CHANGED RULES = REPEAT GENERATION
COMPLETENESS
4 GENERATE MAXIMAL COMPLIANT MODEL
38. COMPLIANCE BY DESIGN
FOR ARTIFACT-CENTRIC
BUSINESS PROCESSES
niels.lohmann@uni-rostock.de
http://about.me/nlohmann
Niels Lohmann