Conference presentation given by Niels Lohmann on December 6, 2011 in Paphos, Cyprus at the Ninth International Conference on Service-Oriented Computing (ICSOC 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.
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).
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).
Compliance by Design for Artifact-Centric Business ProcessesUniversität Rostock
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.
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.
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.
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).
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).
Compliance by Design for Artifact-Centric Business ProcessesUniversität Rostock
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.
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).
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 document discusses key questions around service-oriented architecture (SOA) including how services are discovered and matched, what information about services should be published, and how services bind together. Specifically, it raises questions about how to design a service broker to facilitate finding and publishing services, what criteria determine when one service matches the needs of another service requester, and how services connect and interact with each other.
Tool demonstration given by Niels Lohmann on July 21, 2006 in Dagstuhl, Germany at the The Role of Business Processes in Service Oriented Architectures (Dagstuhl-Seminar 06291).
Analyzing Interacting BPEL Processes - An Overview of the Chair’s WorkUniversität Rostock
The document discusses analyzing interacting BPEL processes through translating them to open Workflow Nets (oWFN). It describes generating an Interaction Graph (IG) and Operating Guideline (OG) from the oWFN to analyze properties like controllability. An example of an online shop is used to illustrate the approach, showing the oWFN, IG, and OG generated. A modified version of the shop is also analyzed to demonstrate how the techniques can identify issues.
Conference presentation given by Niels Lohmann on December 8, 2010 in San Francisco, CA, USA at the Eighth International Conference on Service-Oriented Computing (ICSOC 2010).
The document discusses reachability analysis of Petri nets via their structure. It defines the reachability problem for Petri nets and describes solving the state equation and adding constraints using a CEGAR (counterexample-guided abstraction refinement) approach. An example Petri net is used to illustrate finding partial solutions to the state equation and generating constraints to rule out unreachable solutions.
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).
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 document discusses key questions around service-oriented architecture (SOA) including how services are discovered and matched, what information about services should be published, and how services bind together. Specifically, it raises questions about how to design a service broker to facilitate finding and publishing services, what criteria determine when one service matches the needs of another service requester, and how services connect and interact with each other.
Tool demonstration given by Niels Lohmann on July 21, 2006 in Dagstuhl, Germany at the The Role of Business Processes in Service Oriented Architectures (Dagstuhl-Seminar 06291).
Analyzing Interacting BPEL Processes - An Overview of the Chair’s WorkUniversität Rostock
The document discusses analyzing interacting BPEL processes through translating them to open Workflow Nets (oWFN). It describes generating an Interaction Graph (IG) and Operating Guideline (OG) from the oWFN to analyze properties like controllability. An example of an online shop is used to illustrate the approach, showing the oWFN, IG, and OG generated. A modified version of the shop is also analyzed to demonstrate how the techniques can identify issues.
Conference presentation given by Niels Lohmann on December 8, 2010 in San Francisco, CA, USA at the Eighth International Conference on Service-Oriented Computing (ICSOC 2010).
The document discusses reachability analysis of Petri nets via their structure. It defines the reachability problem for Petri nets and describes solving the state equation and adding constraints using a CEGAR (counterexample-guided abstraction refinement) approach. An example Petri net is used to illustrate finding partial solutions to the state equation and generating constraints to rule out unreachable solutions.
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
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.
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
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.
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.
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.