On the valuedness of finite transducers
Acta Informatica
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques
Business Process Management, Models, Techniques, and Empirical Studies
Business artifacts: An approach to operational specification
IBM Systems Journal
A reference monitor for workflow systems with constrained task execution
Proceedings of the tenth ACM symposium on Access control models and technologies
An architecture for workflow scheduling under resource allocation constraints
Information Systems
YAWL: yet another workflow language
Information Systems
A logical framework for scheduling workflows under resource allocation constraints
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Semantics and analysis of business process models in BPMN
Information and Software Technology
On the Decidability of Bounded Valuedness for Transducers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
Scientific workflows and clouds
Crossroads - Plugging Into the Cloud
Scientific workflow: a survey and research directions
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Towards formal analysis of artifact-centric business process models
BPM'07 Proceedings of the 5th international conference on Business process management
Introducing the guard-stage-milestone approach for specifying business entity lifecycles
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
On nondeterministic workflow executions
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Workflow resource patterns: identification, representation and tool support
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
DecSerFlow: towards a truly declarative service flow language
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
For sequential processes and workflows (i.e., pipelined tasks), each enactment (process instance) only has one task being performed at each time instant. When a process allows tasks to be performed in parallel, an enactment may have a number of tasks being performed concurrently and this number may change in time. We define the “degree of parallelism” of a process as the maximum number of tasks to be performed concurrently during an execution of the process. This paper initiates a study on computing degree of parallelism for three classes of BPMN processes, which are defined based on the use of BPMN gateways. For each class, an algorithm for computing degree of parallelism is presented. In particular, the algorithms for “homogeneous” and acyclic “choice-less” processes (respectively) have polynomial time complexity, while the algorithm for “asynchronous” processes runs in exponential time.