THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
State Of The Art ◽  
Workflow Management ◽  
Explicit Representation ◽  
The Other ◽  
Application Domain ◽  
Analysis Techniques ◽  
The One

Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.

Trying Out Reflective Petri Nets on a Dynamic Workflow Case

2010 ◽  
pp. 218-233
Author(s):  
Lorenzo Capra ◽  
Walter Cazzola
Keyword(s):  
Life Cycle ◽  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
Formal Model ◽  
Discrete Event ◽  
Workflow Management ◽  
Support Tools ◽  
Dynamic Workflow

Industrial/business processes are an evident example of discrete-event systems which are subject to evolution during life-cycle. The design and management of dynamic workflows need adequate formal models and support tools to handle in sound way possible changes occurring during workflow operation. The known, well-established workflow’s models, among which Petri nets play a central role, are lacking in features for representing evolution. We propose a recent Petri net-based reflective layout, called Reflective Petri nets, as a formal model for dynamic workflows. A localized open problem is considered: how to determine what tasks should be redone and which ones do not when transferring a workflow instance from an old to a new template. The problem is efficiently but rather empirically addressed in a workflow management system. Our approach is formal, may be generalized, and is based on the preservation of classical Petri nets structural properties, which permit an efficient characterization of workflow’s soundness.

scholarly journals Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

1992 ◽  
Vol 21 (398) ◽  
Author(s):  
Søren Christensen ◽  
Niels Damgaard Hansen
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
The Other ◽  
Coloured Petri Nets ◽  
Basic Properties ◽  
New Concepts ◽  
Special Cases ◽  
The One ◽  
Net Framework ◽  
Informal Description

In this paper we show how to extend Coloured Petri Nets (CP-nets), with three new modelling primitives - place capacities, test arcs and inhibitor arcs. The new modelling primitives are introduced to improve the possibilities of creating models that are on the one hand compact and comprehensive and on the other hand easy to develop, understand and analyse. A number of different place capacity and inhibitor concepts have been suggested earlier, e.g. integer and multi-set capacities and zero-testing and threshold inhibitors. These concepts can all be described as special cases of the more general place capacity and inhibitor concepts defined in this paper. We give an informal description of the new concepts and show how the concepts can be fonnally defined and integrated in the Petri net framework keeping the basic properties of CP-nets. In contrast to a number of the previously suggested extensions to CP-nets the new modelling primitives preserve the concurrency properties of CP-nets. We show how CP-nets with place capacities, test arcs and inhibitor arcs can be transformed into behaviourally equivalent CP-nets without these primitives. From this we conclude that the basic properties of CP-nets are preserved and that the theory developed for CP-nets can be applied to the extended CP-nets. Finally, we discuss how to generalise the analysis methods of CP-nets to cover the place capacities, test arcs and inhibitor arcs.

scholarly journals Extraction of causal relations based on SBEL and BERT model

Database ◽  
2021 ◽  
Vol 2021 ◽  
Author(s):  
Yifan Shao ◽  
Haoru Li ◽  
Jinghang Gu ◽  
Longhua Qian ◽  
Guodong Zhou
Keyword(s):  
State Of The Art ◽  
Causal Relation ◽  
Relation Extraction ◽  
The Other ◽  
Biomedical Text ◽  
Intermediate Form ◽  
Biomedical Text Mining ◽  
Causal Relations ◽  
The One ◽  
Stage 1

Abstract Extraction of causal relations between biomedical entities in the form of Biological Expression Language (BEL) poses a new challenge to the community of biomedical text mining due to the complexity of BEL statements. We propose a simplified form of BEL statements [Simplified Biological Expression Language (SBEL)] to facilitate BEL extraction and employ BERT (Bidirectional Encoder Representation from Transformers) to improve the performance of causal relation extraction (RE). On the one hand, BEL statement extraction is transformed into the extraction of an intermediate form—SBEL statement, which is then further decomposed into two subtasks: entity RE and entity function detection. On the other hand, we use a powerful pretrained BERT model to both extract entity relations and detect entity functions, aiming to improve the performance of two subtasks. Entity relations and functions are then combined into SBEL statements and finally merged into BEL statements. Experimental results on the BioCreative-V Track 4 corpus demonstrate that our method achieves the state-of-the-art performance in BEL statement extraction with F1 scores of 54.8% in Stage 2 evaluation and of 30.1% in Stage 1 evaluation, respectively. Database URL: https://github.com/grapeff/SBEL_datasets

Efficient reversible quantum design of sig-magnitude to two's complement converters

2020 ◽  
Vol 20 (9&10) ◽  
pp. 747-765
Author(s):  
F. Orts ◽  
G. Ortega ◽  
E.M. E.M. Garzon
Keyword(s):  
Quantum Computing ◽  
Scientific Community ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
State Of The Art ◽  
The Other ◽  
Quantum Computers ◽  
Binary Number ◽  
Quantum Cost ◽  
The One

Despite the great interest that the scientific community has in quantum computing, the scarcity and high cost of resources prevent to advance in this field. Specifically, qubits are very expensive to build, causing the few available quantum computers are tremendously limited in their number of qubits and delaying their progress. This work presents new reversible circuits that optimize the necessary resources for the conversion of a sign binary number into two's complement of N digits. The benefits of our work are two: on the one hand, the proposed two's complement converters are fault tolerant circuits and also are more efficient in terms of resources (essentially, quantum cost, number of qubits, and T-count) than the described in the literature. On the other hand, valuable information about available converters and, what is more, quantum adders, is summarized in tables for interested researchers. The converters have been measured using robust metrics and have been compared with the state-of-the-art circuits. The code to build them in a real quantum computer is given.

The State of the Art in Management Education Applicable to Aerospace Activities

1967 ◽  
Vol 71 (677) ◽  
pp. 342-343
Author(s):  
F. H. East
Keyword(s):  
Research And Development ◽  
Management Education ◽  
State Of The Art ◽  
Development Project ◽  
The State ◽  
The Other ◽  
The Past ◽  
Defence Budget ◽  
The One ◽  
Almost All

The Aviation Group of the Ministry of Technology (formerly the Ministry of Aviation) is responsible for spending a large part of the country's defence budget, both in research and development on the one hand and production or procurement on the other. In addition, it has responsibilities in many non-defence fields, mainly, but not exclusively, in aerospace.Few developments have been carried out entirely within the Ministry's own Establishments; almost all have required continuous co-operation between the Ministry and Industry. In the past the methods of management and collaboration and the relative responsibilities of the Ministry and Industry have varied with time, with the type of equipment to be developed, with the size of the development project and so on. But over the past ten years there has been a growing awareness of the need to put some system into the complex business of translating a requirement into a specification and a specification into a product within reasonable bounds of time and cost.

scholarly journals There Is No Logical Negation Here, But There Are Alternatives: Modeling Conversational Negation with Distributional Semantics

2016 ◽  
Vol 42 (4) ◽  
pp. 637-660 ◽  
Author(s):  
Germán Kruszewski ◽  
Denis Paperno ◽  
Raffaella Bernardi ◽  
Marco Baroni
Keyword(s):  
Large Data ◽  
Semantic Space ◽  
The Other ◽  
Similarity Function ◽  
Distributional Semantics ◽  
Application Domain ◽  
Data Set ◽  
Logical Negation ◽  
The One ◽  
The Right

Logical negation is a challenge for distributional semantics, because predicates and their negations tend to occur in very similar contexts, and consequently their distributional vectors are very similar. Indeed, it is not even clear what properties a “negated” distributional vector should possess. However, when linguistic negation is considered in its actual discourse usage, it often performs a role that is quite different from straightforward logical negation. If someone states, in the middle of a conversation, that “This is not a dog,” the negation strongly suggests a restricted set of alternative predicates that might hold true of the object being talked about. In particular, other canids and middle-sized mammals are plausible alternatives, birds are less likely, skyscrapers and other large buildings virtually impossible. Conversational negation acts like a graded similarity function, of the sort that distributional semantics might be good at capturing. In this article, we introduce a large data set of alternative plausibility ratings for conversationally negated nominal predicates, and we show that simple similarity in distributional semantic space provides an excellent fit to subject data. On the one hand, this fills a gap in the literature on conversational negation, proposing distributional semantics as the right tool to make explicit predictions about potential alternatives of negated predicates. On the other hand, the results suggest that negation, when addressed from a broader pragmatic perspective, far from being a nuisance, is an ideal application domain for distributional semantic methods.

Privacy Compliance Requirements in Workflow Environments

2015 ◽  
pp. 157-177
Author(s):  
Maria N. Koukovini ◽  
Eugenia I. Papagiannakopoulou ◽  
Georgios V. Lioudakis ◽  
Nikolaos L. Dellas ◽  
Dimitra I. Kaklamani ◽  
...  
Keyword(s):  
Information Systems ◽  
Privacy Protection ◽  
Workflow Management ◽  
The Other ◽  
Privacy By Design ◽  
Workflow Management Systems ◽  
Sensitive Data ◽  
Protection Measures ◽  
Compliance Requirements ◽  
The One

Workflow management systems are used to run day-to-day applications in numerous domains, often including exchange and processing of sensitive data. Their native “leakage-proneness,” being the consequence of their distributed and collaborative nature, calls for sophisticated mechanisms able to guarantee proper enforcement of the necessary privacy protection measures. Motivated by the principles of Privacy by Design and its potential for workflow environments, this chapter investigates the associated issues, challenges, and requirements. With the legal and regulatory provisions regarding privacy in information systems as a baseline, the chapter elaborates on the challenges and derived requirements in the context of workflow environments, taking into account the particular needs and implications of the latter. Further, it highlights important aspects that need to be considered regarding, on the one hand, the incorporation of privacy-enhancing features in the workflow models themselves and, on the other, the evaluation of the latter against privacy provisions.

Comparative Study of Graphic Representation Methods on Architectural Heritage

2015 ◽  
pp. 182-209 ◽  
Author(s):  
José Teodoro Garfella ◽  
María Jesús Máñez ◽  
Joaquín Ángel Martínez
Keyword(s):  
Comparative Study ◽  
General Public ◽  
State Of The Art ◽  
The Other ◽  
Graphic Representation ◽  
Digital Photogrammetry ◽  
Architectural Heritage ◽  
Documentation Systems ◽  
The One ◽  
Architectural Survey

Today there are many publications or papers related with several graphic surveys of architectural heritage carried out using a variety of both traditional and cutting edge methods. Yet, the implementation of new graphical documentation systems, such as Automated Digital Photogrammetry, has introduced a fresh approach to dealing with architectural surveys by making them more accessible to the general public and, to a certain extent, increasing their usability (Garfella, Máñez, Cabeza, & Soler, 2014). The present study aims, on the one hand, to offer an overview of architectural survey systems and, on the other hand, to evaluate the differences in the degree of precision or accuracy between the latest state-of-the-art methods and the already well-established ones. This will enable us to examine the results obtained in this experiment to look for concordances and discrepancies between them that can be helpful when using such systems to deal with tasks in the future.

Maintaining the Own Responsibility

2003 ◽  
pp. 43-56
Author(s):  
Ruediger Weissbach
Keyword(s):  
Continuous Improvement ◽  
Business Processes ◽  
The Other ◽  
It Services ◽  
Communication Interface ◽  
Building Society ◽  
Cost Factor ◽  
The One ◽  
It Knowledge ◽  
Competence Centre

This chapter introduces an alternative concept against the dominating trend of a complete outsourcing of IT services, especially in small and medium-sized enterprises (SME). It argues that the undiscriminating adoption of this trend tends to reduce IT on a cost factor and neglects the importance of specific IT knowledge for the continuous improvement of business processes. Also, it neglects the importance of a “communication interface” between the IS users on the one hand and the software development and IT production on the other hand. In opposition to leading management trends, this chapter will present an approach that bases on an internal competence centre for IS and that demands a steady communication between the IT staff and the various departments. In this approach, only selected IT services are externalized and the continuing growth of specific IS knowledge is essential. This approach was developed since the end of the 1990s at the building society, with about 100 employees, in which the author is working.

scholarly journals On the semantics of place/transition Petri nets

1997 ◽  
Vol 7 (4) ◽  
pp. 359-397 ◽  
Author(s):  
JOSÉ MESEGUER ◽  
UGO MONTANARI ◽  
VLADIMIRO SASSONE
Keyword(s):  
Petri Nets ◽  
The Other ◽  
General Category ◽  
Monoidal Categories ◽  
Other Hand ◽  
Models Of Concurrency ◽  
A Chain ◽  
The One ◽  
Algebraic Domains

Place/transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the ‘token game’ is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets. In this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets of PT nets, we introduce a category DecOcc of decorated (nondeterministic) occurrence nets and we define adjunctions between PTNets and DecOcc and between DecOcc and Occ, the category of occurrence nets. The role of DecOcc is to provide natural unfoldings for PT nets, i.e., acyclic safe nets where a notion of family is used to relate multiple instances of the same place. The unfolding functor from PTNets to Occ reduces to Winskel's when restricted to safe nets. Moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom.

Sign in / Sign up

Export Citation Format

Share Document