Timed Parallel Automaton: A Mathematical Tool for Defining Highly Expressive Formal Workflows

Abstract

The definition and simulation of processes using Work flow technology is becoming more and more popular. In that way, to standardize and simulate complex processes it is needed high expressive languages able to be automatically executed by computers. Currently, high expressive languages that can be used for simulation and definition of processes are based in Petri Nets technology. Nevertheless, Petri Nets are difficult to understand by processes experts with no computer science training or expertise and are more complex to be executed than other simpler approaches like finite automatons. In this paper an automata based mathematical tool with a high expressivity capacity is presented. This framework is easier to understand also by non computer science expert sand its automation is simple in order to allow to experts to define formal work flows that can be easily automated.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 30 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.