The Biconnected Verification of Workflow Nets

Artem Polyvyanyy
Artem PolyvyanyyResearch Fellow at Queensland University of Technology (QUT)
The Biconnected Verification
of Workflow Nets
Cooperative Information Systems
October 2010, Crete, Greece
Artem Polyvyanyy
Matthias Weidlich
Mathias Weske
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Correctness of Process Models
A process model is
correct if and only if the
corresponding workflow
net is sound
A sound workflow net
always terminates properly
and each transition can
contribute to the
completion of the net
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Research Problem:
Correctness and Connectedness
Soundness Connectedness
To which extent …
Strong Connectedness Theorem
A net N for which there exists a marking M0, such that (N,M0) is live and
bounded, is strongly connected
Soundness Connectedness
live and bounded
short-circuit net
Strong …
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Connectivity
■ A separating set of a graph is a set of elements, each a vertex or an edge,
whose removal renders the graph disconnected
■ A graph is k-connected if it has no separating set of size k−1
■ The vertex Cv (edge Ce) connectivity of a graph is the size of the smallest
separating set composed of vertices (edges)
Cv ≤ Ce
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Connectivity-based Decomposition (I)
A k-connected graph can be decomposed into (k+1)-connected components
If a connected graph has no
separating sets, then the
graph is complete
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Connectivity-based Decomposition (II)
The connectivity-based graph decomposition produces
separating sets, connected components, and their relations “ ”
The derived structural
information can be used for
analysis purposes
1
2
3 4
1
2
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Connectivity-based Decomposition
Framework (I)
A graph is (n,e)-connected if there exists no set of n nodes and there exists no
set of e edges, whose removal renders the graph disconnected
An (n,e)-connected graph
An (n1,e1)-connected graph
can be decomposed into
(n2,e2)-connected
components
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Connectivity-based Decomposition
Framework (II): Node vs. Edge
Edge-based decomposition Node-based decomposition
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
Connectivity-based Decomposition
Framework (III): Related Work
O(|G|)*
O(|G|n+e-1
)**
single-entry-
single-exit edge
(SESE-edge)
[Johnson et al 94]
single-entry-
single-exit node
(SESE-node)
[Tarjan and Valdes 80,
Vanhatalo et al 08,
Polyvyanyy et al 10]
* |G| is the size of the graph
** n,e are parameters of the (n,e)-connected decomposition
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
0
The Biconnected Verification (I)
1. A WF-net can be sound only if all the
cutvertices of the corresponding
short-circuit net are places
2. Each biconnected WF-net of a WF-net
is safe and sound, if and only if the WF-
net is safe and sound
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
1
The Biconnected Verification (II)
Transition t1 and the biconnected
WF-net A3 constitute valuable
diagnostic information:
■ t1 is never enabled
■ A3 is not sound
(t4 is never enabled in A3)
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
2
Towards the Triconnected Verification
The Refined Process Structure Tree
The triconnected subnets
Future work: How do separation
pairs and triconnected subnets
influence soundness?
Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15
3
Conclusion
■ Connectivity-based decomposition is a stepwise approach to a discovery of structural
information in WF-nets, i.e., separating sets, connected subnets, and their relations
■ Connectivity-based decomposition has various applications: Translation between
process languages, control-flow and data-flow analysis, process comparison and
merging, process abstraction, process comprehension, model layout, pattern
application in process modeling, etc
■ In this work, we have investigated the relation between the connectivity property of a
workflow net and its behavioral correctness (soundness)
■ In case of unsoundness, the method provides diagnostic information
■ The biconnected verification can be performed in linear time and requires linear space
to the size of the WF-net, whereas more fine grained decomposition steps can be
accomplished in low-polynomial time
■ Future Work: Follow the research agenda defined by the decomposition framework
to obtain new results on behavioral correctness
1 of 13

Recommended

Applications of Information Theory by
Applications of Information TheoryApplications of Information Theory
Applications of Information TheoryDarshan Bhatt
4.6K views21 slides
P1151133713 by
P1151133713P1151133713
P1151133713Ashraf Aboshosha
331 views27 slides
Visualisation of Large Networks by
Visualisation of Large Networks Visualisation of Large Networks
Visualisation of Large Networks Mithileysh Sathiyanarayanan
340 views22 slides
FUAT – A Fuzzy Clustering Analysis Tool by
FUAT – A Fuzzy Clustering Analysis ToolFUAT – A Fuzzy Clustering Analysis Tool
FUAT – A Fuzzy Clustering Analysis ToolSelman Bozkır
2.3K views19 slides
Bloom Graph by
Bloom GraphBloom Graph
Bloom Graphijcoa
131 views1 slide
Intro to network Science by
Intro to network ScienceIntro to network Science
Intro to network SciencePyData
2.3K views41 slides

More Related Content

Similar to The Biconnected Verification of Workflow Nets

Synthesis and performance analysis of network topology using graph theory by
Synthesis and performance analysis of network topology using graph theorySynthesis and performance analysis of network topology using graph theory
Synthesis and performance analysis of network topology using graph theoryAlexander Decker
426 views9 slides
Synthesis and performance analysis of network topology using graph theory by
Synthesis and performance analysis of network topology using graph theorySynthesis and performance analysis of network topology using graph theory
Synthesis and performance analysis of network topology using graph theoryAlexander Decker
249 views9 slides
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS by
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSEVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSAIRCC Publishing Corporation
44 views12 slides
Analysis of Hill Road Network Structure in Developing Countries by
Analysis of Hill Road Network Structure in Developing CountriesAnalysis of Hill Road Network Structure in Developing Countries
Analysis of Hill Road Network Structure in Developing CountriesIJRTEMJOURNAL
6 views5 slides
Analysis of Hill Road Network Structure in Developing Countries by
Analysis of Hill Road Network Structure in Developing CountriesAnalysis of Hill Road Network Structure in Developing Countries
Analysis of Hill Road Network Structure in Developing CountriesIJRTEMJOURNAL
21 views5 slides
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS by
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSEVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
12 views12 slides

Similar to The Biconnected Verification of Workflow Nets(20)

Synthesis and performance analysis of network topology using graph theory by Alexander Decker
Synthesis and performance analysis of network topology using graph theorySynthesis and performance analysis of network topology using graph theory
Synthesis and performance analysis of network topology using graph theory
Alexander Decker426 views
Synthesis and performance analysis of network topology using graph theory by Alexander Decker
Synthesis and performance analysis of network topology using graph theorySynthesis and performance analysis of network topology using graph theory
Synthesis and performance analysis of network topology using graph theory
Alexander Decker249 views
Analysis of Hill Road Network Structure in Developing Countries by IJRTEMJOURNAL
Analysis of Hill Road Network Structure in Developing CountriesAnalysis of Hill Road Network Structure in Developing Countries
Analysis of Hill Road Network Structure in Developing Countries
IJRTEMJOURNAL6 views
Analysis of Hill Road Network Structure in Developing Countries by IJRTEMJOURNAL
Analysis of Hill Road Network Structure in Developing CountriesAnalysis of Hill Road Network Structure in Developing Countries
Analysis of Hill Road Network Structure in Developing Countries
IJRTEMJOURNAL21 views
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS by ijcsit
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSEVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
ijcsit12 views
Centrality Prediction in Mobile Social Networks by IJERA Editor
Centrality Prediction in Mobile Social NetworksCentrality Prediction in Mobile Social Networks
Centrality Prediction in Mobile Social Networks
IJERA Editor311 views
Load balancing to extend life of wireless sensor network by Gaurang Rathod
Load balancing to extend life of wireless sensor networkLoad balancing to extend life of wireless sensor network
Load balancing to extend life of wireless sensor network
Gaurang Rathod501 views
Literature Review: Convey the Data in Massive Parallel Computing by AM Publications,India
Literature Review: Convey the Data in Massive Parallel ComputingLiterature Review: Convey the Data in Massive Parallel Computing
Literature Review: Convey the Data in Massive Parallel Computing
Networks Navigability: Theory and Applications by Christoph Trattner
Networks Navigability: Theory and ApplicationsNetworks Navigability: Theory and Applications
Networks Navigability: Theory and Applications
Christoph Trattner1.5K views
Intelligent Routing Algorithm Using Antnet by ijtsrd
Intelligent Routing Algorithm Using AntnetIntelligent Routing Algorithm Using Antnet
Intelligent Routing Algorithm Using Antnet
ijtsrd54 views
Embedding bus and ring into hex cell by IJCNCJournal
Embedding bus and ring into hex cellEmbedding bus and ring into hex cell
Embedding bus and ring into hex cell
IJCNCJournal190 views
20190725 li chun_lab_intro_v5 by 俊廷 陳
20190725 li chun_lab_intro_v520190725 li chun_lab_intro_v5
20190725 li chun_lab_intro_v5
俊廷 陳288 views
An Algorithm for Computing Average Packet Delay by CSCJournals
An Algorithm for Computing Average Packet DelayAn Algorithm for Computing Average Packet Delay
An Algorithm for Computing Average Packet Delay
CSCJournals159 views
A Modified Diagonal Mesh Shuffle Exchange Interconnection Network by IJECEIAES
A Modified Diagonal Mesh Shuffle Exchange Interconnection Network A Modified Diagonal Mesh Shuffle Exchange Interconnection Network
A Modified Diagonal Mesh Shuffle Exchange Interconnection Network
IJECEIAES36 views
E0333021025 by theijes
E0333021025E0333021025
E0333021025
theijes230 views

Recently uploaded

PharoJS - Zürich Smalltalk Group Meetup November 2023 by
PharoJS - Zürich Smalltalk Group Meetup November 2023PharoJS - Zürich Smalltalk Group Meetup November 2023
PharoJS - Zürich Smalltalk Group Meetup November 2023Noury Bouraqadi
132 views17 slides
Data Integrity for Banking and Financial Services by
Data Integrity for Banking and Financial ServicesData Integrity for Banking and Financial Services
Data Integrity for Banking and Financial ServicesPrecisely
25 views26 slides
Zero to Automated in Under a Year by
Zero to Automated in Under a YearZero to Automated in Under a Year
Zero to Automated in Under a YearNetwork Automation Forum
15 views23 slides
Vertical User Stories by
Vertical User StoriesVertical User Stories
Vertical User StoriesMoisés Armani Ramírez
14 views16 slides
SUPPLIER SOURCING.pptx by
SUPPLIER SOURCING.pptxSUPPLIER SOURCING.pptx
SUPPLIER SOURCING.pptxangelicacueva6
16 views1 slide
Voice Logger - Telephony Integration Solution at Aegis by
Voice Logger - Telephony Integration Solution at AegisVoice Logger - Telephony Integration Solution at Aegis
Voice Logger - Telephony Integration Solution at AegisNirmal Sharma
39 views1 slide

Recently uploaded(20)

PharoJS - Zürich Smalltalk Group Meetup November 2023 by Noury Bouraqadi
PharoJS - Zürich Smalltalk Group Meetup November 2023PharoJS - Zürich Smalltalk Group Meetup November 2023
PharoJS - Zürich Smalltalk Group Meetup November 2023
Noury Bouraqadi132 views
Data Integrity for Banking and Financial Services by Precisely
Data Integrity for Banking and Financial ServicesData Integrity for Banking and Financial Services
Data Integrity for Banking and Financial Services
Precisely25 views
Voice Logger - Telephony Integration Solution at Aegis by Nirmal Sharma
Voice Logger - Telephony Integration Solution at AegisVoice Logger - Telephony Integration Solution at Aegis
Voice Logger - Telephony Integration Solution at Aegis
Nirmal Sharma39 views
iSAQB Software Architecture Gathering 2023: How Process Orchestration Increas... by Bernd Ruecker
iSAQB Software Architecture Gathering 2023: How Process Orchestration Increas...iSAQB Software Architecture Gathering 2023: How Process Orchestration Increas...
iSAQB Software Architecture Gathering 2023: How Process Orchestration Increas...
Bernd Ruecker40 views
6g - REPORT.pdf by Liveplex
6g - REPORT.pdf6g - REPORT.pdf
6g - REPORT.pdf
Liveplex10 views
STPI OctaNE CoE Brochure.pdf by madhurjyapb
STPI OctaNE CoE Brochure.pdfSTPI OctaNE CoE Brochure.pdf
STPI OctaNE CoE Brochure.pdf
madhurjyapb14 views
GDG Cloud Southlake 28 Brad Taylor and Shawn Augenstein Old Problems in the N... by James Anderson
GDG Cloud Southlake 28 Brad Taylor and Shawn Augenstein Old Problems in the N...GDG Cloud Southlake 28 Brad Taylor and Shawn Augenstein Old Problems in the N...
GDG Cloud Southlake 28 Brad Taylor and Shawn Augenstein Old Problems in the N...
James Anderson92 views
TrustArc Webinar - Managing Online Tracking Technology Vendors_ A Checklist f... by TrustArc
TrustArc Webinar - Managing Online Tracking Technology Vendors_ A Checklist f...TrustArc Webinar - Managing Online Tracking Technology Vendors_ A Checklist f...
TrustArc Webinar - Managing Online Tracking Technology Vendors_ A Checklist f...
TrustArc11 views
TouchLog: Finger Micro Gesture Recognition Using Photo-Reflective Sensors by sugiuralab
TouchLog: Finger Micro Gesture Recognition  Using Photo-Reflective SensorsTouchLog: Finger Micro Gesture Recognition  Using Photo-Reflective Sensors
TouchLog: Finger Micro Gesture Recognition Using Photo-Reflective Sensors
sugiuralab21 views

The Biconnected Verification of Workflow Nets

  • 1. The Biconnected Verification of Workflow Nets Cooperative Information Systems October 2010, Crete, Greece Artem Polyvyanyy Matthias Weidlich Mathias Weske
  • 2. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Correctness of Process Models A process model is correct if and only if the corresponding workflow net is sound A sound workflow net always terminates properly and each transition can contribute to the completion of the net
  • 3. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Research Problem: Correctness and Connectedness Soundness Connectedness To which extent … Strong Connectedness Theorem A net N for which there exists a marking M0, such that (N,M0) is live and bounded, is strongly connected Soundness Connectedness live and bounded short-circuit net Strong …
  • 4. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Connectivity ■ A separating set of a graph is a set of elements, each a vertex or an edge, whose removal renders the graph disconnected ■ A graph is k-connected if it has no separating set of size k−1 ■ The vertex Cv (edge Ce) connectivity of a graph is the size of the smallest separating set composed of vertices (edges) Cv ≤ Ce
  • 5. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Connectivity-based Decomposition (I) A k-connected graph can be decomposed into (k+1)-connected components If a connected graph has no separating sets, then the graph is complete
  • 6. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Connectivity-based Decomposition (II) The connectivity-based graph decomposition produces separating sets, connected components, and their relations “ ” The derived structural information can be used for analysis purposes 1 2 3 4 1 2
  • 7. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Connectivity-based Decomposition Framework (I) A graph is (n,e)-connected if there exists no set of n nodes and there exists no set of e edges, whose removal renders the graph disconnected An (n,e)-connected graph An (n1,e1)-connected graph can be decomposed into (n2,e2)-connected components
  • 8. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Connectivity-based Decomposition Framework (II): Node vs. Edge Edge-based decomposition Node-based decomposition
  • 9. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 Connectivity-based Decomposition Framework (III): Related Work O(|G|)* O(|G|n+e-1 )** single-entry- single-exit edge (SESE-edge) [Johnson et al 94] single-entry- single-exit node (SESE-node) [Tarjan and Valdes 80, Vanhatalo et al 08, Polyvyanyy et al 10] * |G| is the size of the graph ** n,e are parameters of the (n,e)-connected decomposition
  • 10. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 0 The Biconnected Verification (I) 1. A WF-net can be sound only if all the cutvertices of the corresponding short-circuit net are places 2. Each biconnected WF-net of a WF-net is safe and sound, if and only if the WF- net is safe and sound
  • 11. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 1 The Biconnected Verification (II) Transition t1 and the biconnected WF-net A3 constitute valuable diagnostic information: ■ t1 is never enabled ■ A3 is not sound (t4 is never enabled in A3)
  • 12. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 2 Towards the Triconnected Verification The Refined Process Structure Tree The triconnected subnets Future work: How do separation pairs and triconnected subnets influence soundness?
  • 13. Artem Polyvyanyy | Crete, Greece | October 2010 30.01.15 3 Conclusion ■ Connectivity-based decomposition is a stepwise approach to a discovery of structural information in WF-nets, i.e., separating sets, connected subnets, and their relations ■ Connectivity-based decomposition has various applications: Translation between process languages, control-flow and data-flow analysis, process comparison and merging, process abstraction, process comprehension, model layout, pattern application in process modeling, etc ■ In this work, we have investigated the relation between the connectivity property of a workflow net and its behavioral correctness (soundness) ■ In case of unsoundness, the method provides diagnostic information ■ The biconnected verification can be performed in linear time and requires linear space to the size of the WF-net, whereas more fine grained decomposition steps can be accomplished in low-polynomial time ■ Future Work: Follow the research agenda defined by the decomposition framework to obtain new results on behavioral correctness