Formalization of Workflows Using Fork-Join Automata (extended abstract)

Research output: Working paper and reportsPreprint

Abstract

We survey the current practice of using workflows for business process modeling and we present a simple formalism for reasoning about the structural correctness of fork-join workflow diagrams containing {\em and} and {\em or} nodes.
Original languageEnglish
Place of PublicationHagenberg
PublisherRISC JKU
Number of pages7
Publication statusPublished - Dec 2011

Publication series

NameRISC Report Series
No.12-21

Fields of science

  • 101001 Algebra
  • 101002 Analysis
  • 101 Mathematics
  • 102 Computer Sciences
  • 102011 Formal languages
  • 101009 Geometry
  • 101013 Mathematical logic
  • 101020 Technical mathematics
  • 101025 Number theory
  • 101012 Combinatorics
  • 101005 Computer algebra
  • 101006 Differential geometry
  • 101003 Applied geometry
  • 102025 Distributed systems

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this