Aalst, van der, W.M.P. · Data Archiving and Networked Services (DANS) · 1997
Workflow management systems will change the architecture of future information systems dramatically. The explicit representation of business procedures is one of the main issues when introducing a workflow management system. In this paper we focus on a class of Petri nets suitable for the representation, validation and verification of these procedures. We will show that the correctness of a procedure represented by such a Petri net can be verified by using standard Petri-net-based techniques. Based on this result we provide a comprehensive set of transformation rules which can be used to construct and modify correct procedures.
Cited by 0
Amaury Bosso André · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2010
Orientador: Jacques Wainer
Cited by 0Open access
C. Karamanolis, D. Giannakopoulou, J. Magee et al. · 2000
Practical experience indicates that the definition of real-world workflow applications is a complex and error-prone process. Existing workflow management systems provide the means, in the best case, for very primitive syntactic verification, which is not enough to guarantee the overall correctness and robustness of workflow applications. The report introduces a method for formal verification of system behaviour which, in C3DS, is defined as workflow schemas. Workflows are modelled by means of an automata-based method, which facilitates exhaustive compositional reachability analysis. The workflow behaviour is checked against safety properties, which can be either generic (applicable to all workflow schemas) or domain specific (applicable to a given schema). The analysis is performed in an automated way using the LTSA toolkit, which is accessible by designers who are not experts in formal methods. 1
Cited by 0
Shiyong Lu, Arthur Bernstein, Philip Lewis · Theoretical Computer Science · 2005
Cited by 39
Jeff Dallien, Wendy Maccaull, Allen Tien · 2013
This research is initial work in the design and development of verifiable Workflow Management Systems (WfMS) for application to biomedical research, clinical care and public health. Though many software products are sold as workflow systems, existing products are weak in 3 areas: (i) representation of workflow
Cited by 0
Wasim Sadiq, Wasim Sadiq, Maria E. Orlowska et al. · 1996
The workflow technology has been an active area of research for the past few years. The conceptual modeling of workflows is the first, and arguably the most important, step towards understanding business processes. A well defined workflow conceptual model leads to the development of an effective workflow application. This paper presents a graphical modeling technique for workflows. We introduce four graphical modeling objects: tasks, conditions, synchronizers, and flows. The tasks represent the primary modeling concept and could be classified through several generic and workflow specific characteristics, some of which have been identified in this paper. Using the four modeling objects, the following workflow modeling constructs are identified: ordering, alternative, exclusive join, concurrency, synchronization, iteration, start/stop, nesting, and contingency. It is possible to easily get into error situations while building large workflow specifications. We present a set of constraints...
Cited by 0
Steffen Porwollik (39948), Carlos A. Santiviago (209067), Pui Cheng (201404) et al. · Figshare · 2015
<p>A. General procedure and logistics of mutant generation, storage and characterization. B. Identification of obtained mutants and mapping of mutants to specific wells by a “Hypercube” Combinatorial Pooling approach, essentially as described in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0099820#pone.0099820-Goodman1" target="_blank">[30]</a>.</p>
Cited by 0Open access
Jérôme Pfeiffer, Wilhelm Rossak, Andreas Speck · 2004
Model checking is a technique for the verification of temporal logic specifications in state-transition systems. It can be applied to software, at design stages as well as at source code level. The latter in particular is constricted by the large space requirements of model checking. However, model checking is a promising technique for the improvement of software quality. We examined the applicability of existing model checking methods and tools to software in general and with a focus on e-commerce software systems developed at Intershop. Although model checking is currently not applicable to all domains, it is useful for certain restricted fields of application. One of these domains are Intershop's e-commerce systems, consisting of so called pipelines. We show the source code related verification concept for these pipelines and is part of an overall concept for the verification and quality assurance of Intershop's products.
Cited by 12
Henry H. Bi, J. Leon Zhao · Information Technology and Management · 2004
Cited by 88
Hanifa Boucheneb, Kamel Barkaoui · PolyPublie (École Polytechnique de Montréal) · 2012
H. Boucheneb, K. Barkaoui ?Parametric Verification of Time Workflow Nets?, 24th International Conference on Software Engineering (SEKE), pp 375-380, July 2012
Cited by 2
A.H.M.Ter Hofstede A.H.M.Ter HofstedeArthur H.M.A.H.M.Ter Hofstede A.Ter HofstedeArthur H.M.https://api.elsevier.com/content/author/author_id/7004086310 · Queensland's institutional digital repository (The University of Queensland) · 1998
Cited by 0
Hong Ling, Bo Zhou · 2005
To solve the verification problem of workflow process structure, after reviewing related research papers, semantic deduce-based workflow verification method is proposed. Through process structure verification equal theorem, the proposed method firstly transforms a cyclic workflow process into an acyclic one; and then generates all instance graphs of the workflow process; lastly decides whether the workflow process is correct or not according to semantic tables and the acyclic workflow verification theorem. Comparison with related workflow verification methods is presented in the end.
Cited by 7
Ter Hofstede, A. H.M., Orlowska, M. E., Rajapakse, J. · Queensland's institutional digital repository (The University of Queensland) · 1996
Cited by 0
Jiantao Zhou · Journal of Computer Research and Development · 2005
Cited by 5
Kamel Barkaoui, Rahma Ben Ayed · 2010
The development of work process-oriented applications in various domains leads to workflow systems where a large number of flow instances run concurrently. A challenging problem is to provide methods for the uniform verification of these parameterized workflows, ie, proving the soundness of the workflow for any number of instances. In this paper, we show the ability of structure theory of Petri nets to conduct a uniform verification for large subclasses of parameterized workflow nets modelling control flow patterns associated with complex synchronization mechanisms, routing constructs and resource allocation constraints. We can take advantage of these results in domains where collaborative activities and competition for resources are preponderant such as agile manufacturing systems, web service applications or grid computing. Key words: soundness; structure theory of Petri nets; uniform verification; workflow nets. 1.
Cited by 0
Melwin Xavier, Vaisakh M A, Melveena Jolly et al. · arXiv (Cornell University) · 2026
Agent frameworks increasingly encode tool-using behavior as explicit workflow graphs, yet safety enforcement remains a runtime concern. These frameworks expose analyzable graph structure through their APIs, enabling pre-deployment static verification of safety properties that runtime guardrails can only check reactively. This paper presents Agentproof, a system that automatically extracts a unified abstract graph model from four major agent frameworks (LangGraph, CrewAI, AutoGen, Google ADK), applies six structural checks with witness trace generation, and evaluates temporal safety policies via a DSL compiled to deterministic finite automata, both statically through a graph x DFA product construction and at runtime over event traces. Unlike general-purpose model checkers, Agentproof requires no manual modeling. In a curated benchmark of 18 author-constructed workflows, 27% of the benchmark contain structural defects (dead-end nodes, unreachable exits) and 55% violate a human-gate policy when enforced, distinct categories that prior work conflates. All 15 temporal policies defined fit within the seven-form DSL fragment, and verification completes in sub-second time for graphs up to 5,000 nodes. The corpus serves as a reproducible benchmark for evaluating static verification tools rather than as a prevalence study; defect rates reflect tool detection capability on a targeted benchmark, not base rates in production systems. Nonetheless, static graph verification complements runtime guardrails by catching topology-level defects that runtime tools miss unless the offending path is exercised.
Cited by 0Open access
2008
Abstract — In this paper, we show the relevance of workflow model checking and discuss the problems that arise when doing research about workflows. Then, different facts that may cause these problems are proposed. Past research in the field is summarized, and the conclusion sketches some future lines of research based in the previous analysis. Index Terms — workflow, verification, state-of-the-art. I.
Cited by 0
Sinnakkrishnan Perumal, Ambuj Mahanti · 2007
Workflow verification is a critical topic in workflow management. This involves identifying structural conflicts in the workflow process definition. Mahanti-Sinnakkrishnan algorithm is a graph-search based algorithm for verifying workflow graphs and this algorithm is given. In this paper, intricacies of this algorithm in using typical graph search techniques for solving the problem of workflow verification are detailed. AO* and depth first search are the two graph search techniques used in this algorithm
Cited by 7
Melwin Xavier, Vaisakh M A, Melveena Jolly et al. · arXiv (Cornell University) · 2026
Agent frameworks increasingly encode tool-using behavior as explicit workflow graphs, yet safety enforcement remains a runtime concern. These frameworks expose analyzable graph structure through their APIs, enabling pre-deployment static verification of safety properties that runtime guardrails can only check reactively. This paper presents Agentproof, a system that automatically extracts a unified abstract graph model from four major agent frameworks (LangGraph, CrewAI, AutoGen, Google ADK), applies six structural checks with witness trace generation, and evaluates temporal safety policies via a DSL compiled to deterministic finite automata, both statically through a graph x DFA product construction and at runtime over event traces. Unlike general-purpose model checkers, Agentproof requires no manual modeling. In a curated benchmark of 18 author-constructed workflows, 27% of the benchmark contain structural defects (dead-end nodes, unreachable exits) and 55% violate a human-gate policy when enforced, distinct categories that prior work conflates. All 15 temporal policies defined fit within the seven-form DSL fragment, and verification completes in sub-second time for graphs up to 5,000 nodes. The corpus serves as a reproducible benchmark for evaluating static verification tools rather than as a prevalence study; defect rates reflect tool detection capability on a targeted benchmark, not base rates in production systems. Nonetheless, static graph verification complements runtime guardrails by catching topology-level defects that runtime tools miss unless the offending path is exercised.
Cited by 0Open access
James A. Lumley, Gary J. Sharman, Thomas Wilkin et al. · SLAS DISCOVERY · 2020
Adequate characterization of chemical entities made for biological screening in the drug discovery context is critical. Incorrectly characterized structures lead to mistakes in the interpretation of structure-activity relationships and confuse an already multidimensional optimization problem. Mistakes in the later use of these compounds waste money and valuable resources in a discovery process already under cost pressure. Left unidentified, these errors lead to problems in project data packages during quality review. At worst, they put intellectual property and patent integrity at risk. We describe a KNIME workflow for the early and automated identification of these errors during registration of a new chemical entity into the corporate screening catalog. This Automated Structure Verification workflow provides early identification (within 24 hours) of missing or inconsistent analytical data and therefore reduces any mistakes that inevitably get made. Automated identification removes the burden of work from the chemist submitting the compound into the registration system. No additional work is required unless a problem is identified and the submitter alerted. Before implementation, 14% of samples within the existing sample catalog were missing data on initial pass. A year after implementation, only 0.2% were missing data.
Cited by 6Open access