Soundness of workflow nets with reset arcs

Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation features, a mapping to workflow nets is not always possible. Therefore, it is interesting to consider workflow nets with reset arcs. Unfortunately, soundness is undecidable for workflow nets with reset arcs. In this paper, we provide a proof and insights into the theoretical limits of workflow verification.

The Brisbane Cordon scheme : part A - preliminary investigation

It could be said that road congestion is one of the most significant problems within any modern metropolitan area. For several decades now, around the globe, congestion in metropolitan areas has been worsening for two main reasons. Firstly, road congestion has significantly increased due to a higher demand for road space because of growth in populations, economic activity and incomes (Hensher & Puckett, 2007). This factor, in conjunction with a significant lack of investment in new road and public transport infrastructure, has seen the road network capacities of cities exceeded by traffic volumes and thus, resulted in increased traffic congestion. This relentless increase in road traffic congestion has resulted in a dramatic increase in costs for both the road users and ultimately the metropolitan areas concerned (Bureau of Transport and Regional Economics, 2007). In response to this issue, several major cities around the world, including London, Stockholm and Singapore, have implemented congestion-charging schemes in order to combat the effects of road congestion. A congestion-charging scheme provides a mechanism for regulating traffic flows into the congested areas of a city, whilst simultaneously generating public revenue that can be used to improve both the public transport and road networks of the region. The aim of this paper was to assess the concept of congestion-charging, whilst reflecting on the experiences of various cities that have already implemented such systems. The findings from this paper have been used to inform the design of a congestion-charging scheme for the city of Brisbane in Australia in a supplementary study (Whitehead, Bunker, & Chung, 2011). The first section of this paper examines the background to road congestion; the theory behind different congestion-charging schemes; and the various technologies involved with the concept. The second section of this paper details the experiences, in relation to implementing a congestion-charging scheme, from the city of Stockholm in Sweden. This research has been crucial in forming a list of recommendations and lessons learnt for the design of a congestion-charging scheme in Australia. It is these recommendations that directly inform the proposed design of the Brisbane Cordon Scheme detailed in Whitehead et al. (2011).

The Brisbane Cordon scheme : part B - investigation into feasibility and effects

As detailed in Whitehead, Bunker and Chung (2011), a congestion-charging scheme provides a mechanism to combat congestion whilst simultaneously generating revenue to improve both the road and public transport networks. The aim of this paper is to assess the feasibility of implementing a congestion-charging scheme in the city of Brisbane in Australia and determine the potential effects of this initiative. In order to so, a congestion-charging scheme was designed for Brisbane and modelled using the Brisbane Strategic Transport Model with a base line year of 2026. This paper argues that the implementation of this initiative would prove to be effective in reducing the cities road congestion and increasing the overall sustainability of the region.

Data and process requirements for product recall coordination

When an organisation becomes aware that one of its products may pose a safety risk to customers, it must take appropriate action as soon as possible or it can be held liable. The ability to automatically trace potentially dangerous goods through the supply chain would thus help organisations fulfill their legal obligations in a timely and effective manner. Furthermore, product recall legislation requires manufacturers to separately notify various government agencies, the health department and the public about recall incidents. This duplication of effort and paperwork can introduce errors and data inconsistencies. In this paper, we examine traceability and notification requirements in the product recall domain from two perspectives: the activities carried out during the manufacturing and recall processes and the data collected during the enactment of these processes. We then propose a workflow-based coordination framework to support these data and process requirements.

Workflow support for scheduling in surgical care processes

Real-world business processes rely on the availability of scarce, shared resources, both human and non-human. Current workflow management systems support allocation of individual human resources to tasks but lack support for the full range of resource types used in practice, and the inevitable constraints on their availability and applicability. Based on past experience with resource-intensive workflow applications, we derive generic requirements for a workflow system which can use its knowledge of resource capabilities and availability to help create feasible task schedules. We then define the necessary architecture for implementing such a system and demonstrate its practicality through a proof-of-concept implementation. This work is presented in the context of a real-life surgical care process observed in a number of German hospitals.

Reduction rules for YAWL workflows with cancellation regions and OR-joins

As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.

Soundness of workflow nets: classification, decidability, and analysis

Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets.We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.

Reduction rules for reset/inhibitor nets

Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancellation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive power of Petri nets, they also result in increased complexity of analysis techniques. One way of speeding up Petri net analysis is to apply reduction rules. Unfortunately, many of the rules defined for classical Petri nets do not hold in the presence of reset and/or inhibitor arcs. Moreover, new rules can be added. This is the first paper systematically presenting a comprehensive set of reduction rules for reset/inhibitor nets. These rules are liveness and boundedness preserving and are able to dramatically reduce models and their state spaces. It can be observed that most of the modeling languages used in practice have features related to cancellation and blocking. Therefore, this work is highly relevant for all kinds of application areas where analysis is currently intractable.

Performance analysis of business process models with advanced constructs

The importance of actively managing and analysing business processes is acknowledged more than ever in organisations nowadays. Business processes form an essential part of an organisation and their application areas are manifold. Most organisations keep records of various activities that have been carried out for auditing purposes, but they are rarely used for analysis purposes. This paper describes the design and implementation of a process analysis tool that replays, analyses and visualises a variety of performance metrics using a process definition and its corresponding execution logs. The replayer uses a YAWL process model example to demonstrate its capacity to support advanced language constructs.

Process mining manifesto

Process mining techniques are able to extract knowledge from event logs commonly available in today’s information systems. These techniques provide new means to discover, monitor, and improve processes in a variety of application domains. There are two main drivers for the growing interest in process mining. On the one hand, more and more events are being recorded, thus, providing detailed information about the history of processes. On the other hand, there is a need to improve and support business processes in competitive and rapidly changing environments. This manifesto is created by the IEEE Task Force on Process Mining and aims to promote the topic of process mining. Moreover, by defining a set of guiding principles and listing important challenges, this manifesto hopes to serve as a guide for software developers, scientists, consultants, business managers, and end-users. The goal is to increase the maturity of process mining as a new tool to improve the (re)design, control, and support of operational business processes.