A 14← department of mathematics and computer science PROSE 05-10-06 1 Checking Properties of Adaptive Workflow Nets K. van Hee, I. Lomazova, O. Oanea,

Slides:



Advertisements
Similar presentations
Tintu David Joy. Agenda Motivation Better Verification Through Symmetry-basic idea Structural Symmetry and Multiprocessor Systems Mur ϕ verification system.
Advertisements

1 Verification of Parameterized Systems Reducing Model Checking of the Few to the One. E. Allen Emerson, Richard J. Trefler and Thomas Wahl Junaid Surve.
On 1-soundness and Soundness of Workflow Nets Lu Ping, Hu Hao and Lü Jian Department of Computer Science Nanjing University
Techniques to analyze workflows (design-time)
Algorithmic Software Verification VII. Computation tree logic and bisimulations.
Models of Concurrency Manna, Pnueli.
Concurrent Operational Semantics of Safe Time Petri Nets Claude Jard European University of Brittany, ENS Cachan Bretagne, IRISA Campus de Ker-Lann,
An Introduction to Petri Nets
A university for the world real R © 2009, Chapter 3 Advanced Synchronization Moe Wynn Wil van der Aalst Arthur ter Hofstede.
Process Models In this section, we focus on the control-flow perspective of processes. We assume that there is a set of activity labels.
An Introduction to the Model Verifier verds Wenhui Zhang September 15 th, 2010.
Based on: Petri Nets and Industrial Applications: A Tutorial
François Fages MPRI Bio-info 2006 Formal Biology of the Cell Modeling, Computing and Reasoning with Constraints François Fages, Constraints Group, INRIA.
Applying Petri Net Unfoldings for Verification of Mobile Systems Apostolos Niaouris Joint work with V. Khomenko, M. Koutny MOCA ‘06.
Temporal Logic and the NuSMV Model Checker CS 680 Formal Methods Jeremy Johnson.
UPPAAL Introduction Chien-Liang Chen.
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
From Monotonic Transition Systems to Monotonic Games Parosh Aziz Abdulla Uppsala University.
On the Dynamics of PB Systems with Volatile Membranes Giorgio Delzanno* and Laurent Van Begin** * Università di Genova, Italy ** Universitè Libre de Bruxelles,
IE 469 Manufacturing Systems
Equivalence of open Petri nets Modeling and analysis with Petri net components. Marc Voorhoeve (AIS)
10. Petri Nets Prof. O. Nierstrasz. Roadmap  Definition: —places, transitions, inputs, outputs —firing enabled transitions  Modelling: —concurrency.
Department of mathematics and computer science 1 of 21 Rob van Glabbeek (Sydney) Marc Voorhoeve (TUE) Liveness, Fairness and Impossible Futures.
CP — Concurrent Programming 12. Petri Nets Prof. O. Nierstrasz Wintersemester 2005 / 2006.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Regular.
1 Petri Nets H Plan: –Introduce basics of Petri Net models –Define notation and terminology used –Show examples of Petri Net models u Calaway Park model.
/k soundness of free-choice workflow nets 1 of 10 Soundness of Free Choice Workflow Nets K.M. van Hee, M. Voorhoeve Eindhoven Univ. Tech.
Model Checking Anders P. Ravn Department of Computer Science, Aalborg University, Denmark Hybrid Systems – PhD School Aalborg University January 2007.
1 Formal Models for Transactions: Zero Safe Nets Roberto Bruni Dipartimento di Informatica Università di Pisa Models and Languages for Coordination and.
Petri Net Modeling for dynamic MM composite Object.
*Department of Computing Science University of Newcastle upon Tyne **Institut für Informatik, Universität Augsburg Canonical Prefixes of Petri Net Unfoldings.
History-Dependent Petri Nets Kees van Hee, Alexander Serebrenik, Natalia Sidorova, Wil van der Aalst ?
Real-Time Synchronised Petri Nets Giovanna Di Marzo Serugendo Dino Mandrioli, Didier Buchs, Nicolas Guelfi University of Geneva, Switzerland PN’02 / 24th.
Petri Nets An Overview IE 680 Presentation April 30, 2007 Renata Kopach- Konrad.
Chapter 3 : Software Process and Other Models Juthawut Chantharamalee Curriculum of Computer Science Faculty of Science and Technology, Suan Dusit University.
Partial Order Semantics of Types of Nets Robert Lorenz, Gabriel Juhás, Sebastian Mauser SOFSEM 2009, Špindlerův Mlýn, CZ, 27th February 2009.
Linear and Branching Time Safety, Liveness, and Fairness
An Introduction to Petri Nets Marjan Sirjani Formal Methods Laboratory University of Tehran.
Soundness problem for Resource-Constrained Workflow nets revisited Natalia Sidorova and Christian Stahl.
CY2003 Computer Systems Lecture 7 Petri net. © LJMU, 2004CY2003- Week 72 Overview Petri net –concepts –Petri net representation –Firing a transition –Marks.
Semantics & Verification Research Group Department of Computer Science University of Malta FLACOS 2008 Detection of Conflicts in Electronic Contracts Stephen.
Towards a High-Level Petri Net Type DefinitionWorkshop on Interchange Formats for Petri Nets 1/18 June 26, 2004 Towards a High-Level Petri Net Type Definition.
Advanced Topics in Software Engineering Marjan Sirjani Tehran University Faculty of Engineering ECE Department Tehran,
Petri Nets Lecturer: Roohollah Abdipour. Agenda Introduction Petri Net Modelling with Petri Net Analysis of Petri net 2.
Modelling by Petri nets
Lecture 5 1 CSP tools for verification of Sec Prot Overview of the lecture The Casper interface Refinement checking and FDR Model checking Theorem proving.
VERIFICATION OF PARAMETERIZED SYSTEMS MONOTONIC ABSTRACTION IN PARAMETERIZED SYSTEMS NAVNEETA NAVEEN PATHAK Parosh Aziz Abdullah, Giorgio Delzanno, Ahmed.
CSCI1600: Embedded and Real Time Software Lecture 11: Modeling IV: Concurrency Steven Reiss, Fall 2015.
School of Computer Science & Software Engineering
CAP 4800/CAP 5805: Computer Simulation Concepts
Symbolic Algorithms for Infinite-state Systems Rupak Majumdar (UC Berkeley) Joint work with Luca de Alfaro (UC Santa Cruz) Thomas A. Henzinger (UC Berkeley)
1 CS techniques for IT auditing Lecture 6. Dept of Mathematics and Computer Science 2 Transition system (1) Basic process model of CS is a transition.
Diagnostic Information for Control-Flow Analysis of Workflow Graphs (aka Free-Choice Workflow Nets) Cédric Favre(1,2), Hagen Völzer(1), Peter Müller(2)
Technology of information systems Lecture 5 Process management.
Process Mining – Concepts and Algorithms Review of literature on process mining techniques for event log data.
composition of workflows
Polynomial analysis algorithms for free-choice workflow nets
CPE555A: Real-Time Embedded Systems
Clockless Computing COMP
Modeling Arithmetic, Computation, and Languages
Graph-Based Operational Semantics
Recursion.
Concurrent Systems Modeling using Petri Nets – Part II
بسمه‌تعالي فصل چهاردهم شبکه‌هاي پتري.
CSCI1600: Embedded and Real Time Software
CSEP590 – Model Checking and Automated Verification
Wil van der Aalst Eindhoven University of Technology
CSCI1600: Embedded and Real Time Software
An Introduction to Petri Nets
Presentation transcript:

a 14← department of mathematics and computer science PROSE Checking Properties of Adaptive Workflow Nets K. van Hee, I. Lomazova, O. Oanea, A. Serebrenik, N. Sidorova, M. Voorhoeve Program Systems Institute of the Russsian Academy of Science

a 14← department of mathematics and computer science PROSE Overview Workflow (WF) nets and proper termination. Problems with fixed structure of nets especially exception modelling. EWF nets: WF nets with exception transitions. AWF (adaptive WF) nets: nesting. Verification of AWF nets.

a 14← department of mathematics and computer science PROSE Workflow net Petri net with initial (source) and final (sink) place. All other nodes on directed path from source to sink. Soundness: every marking reachable from [ i ] can reach [ f ] Marking: e.g. [p]+2[q] i f b a d c p q r Enabled, firing Reachability: ([ i ] sat AG EF [ f ]) Always:

a 14← department of mathematics and computer science PROSE Problem: modelling exceptions Typical sound WF net with parallelism (normal flow): i f In one thread an exception may occur. The other thread should be interrupted. Soundness should be preserved. superfluous firing needed Model becomes unfeasible.

a 14← department of mathematics and computer science PROSE Reset arcs i f Reset arc empties all places in region. Improves modeling, makes analysis worse. No specific reaction to exceptions. Problem with adaptivity in general, due to fixed structure!

a 14← department of mathematics and computer science PROSE EWF nets i f Labelled exception (sink) transitions; upon firing an exception, the net is terminated. EWF net is sound iff

a 14← department of mathematics and computer science PROSE AWF nets: definition Adaptive WF (AWF) net: coloured EWF net. Arcs and transitions are labeled with expressions n : an EWF net n final( v ) init( n ) v v e(v)e(v) b b b b b 

a 14← department of mathematics and computer science PROSE AWF nets: allowed expressions Out-arc expr’s built from: std nets, variables, operators e.g.:. (seq. composition), + (choice), || (parallel composition) init( n || m ). k In-arc expressions: - b : black, -v (variable): net We presuppose a set of “standard” sound EWF nets (domain dependent). v Transition expressions (guards): - none, - e ( v ) ( e exception  label), - final( v ), final( v )

a 14← department of mathematics and computer science PROSE AWF net firing rules AWF net and token net can fire independently m n init( n+m ) v final( v ) v e(v)e(v) b b b b b init  e(v)e(v) v + t Transitions in the AWF net can fire, producing black or net tokens. init+m+m marked net tokens or synchronized on exception label e e or upon token net having reached the final state. final

a 14← department of mathematics and computer science PROSE Adaptivity Modeling hospital admission; standard cure n. Monitor; if needed extend current cure with m. e(w)e(w) init( n ) init( c ) vv.m w init( c ) v w final( v )  final( w ) c:c: e: extension needed.

a 14← department of mathematics and computer science PROSE Circumspectness AWF net: final( v ) init( n ) v b b b b  b b n:n: Sound, but can not react to exception e in token net n. (not circumspect) AWF net N is circumspect: every exception e of token net can synchronize in any state of N.

a 14← department of mathematics and computer science PROSE Circumspect AWF net Net can synchronize with e before and after firing of t. init( n+m ) v final( v ) v e(v)e(v) b b b b b init  e(v)e(v) v m n + t

a 14← department of mathematics and computer science PROSE Verification of AWF nets Colour sets of AWF nets are infinite, so no direct model checking possible. v. m v Abstract interpretation  : map token colours to sets of exception labels. Theorem: AWF net N sound iff all states reachable in  ( N ) by nonexceptional firings can terminate without synchronising on exceptions. The set of library net exception labels is finite! Similar result for circumspectness.

a 14← department of mathematics and computer science PROSE Conclusions EWF nets: WF nets with exceptions. AWF nets: EWF nets with nesting (e.g. reaction to exceptions). Proper termination and circumspectness of AWF nets can be checked. Extensions: Synchronisation without termination. Checking other temporal properties. Thank you for your attention! department of mathematics and computer science