ABSTRACT
Recently, different kinds of controllability have been proposed for workflow schemata modeling real world processes made of tasks and coordination activities. Temporal controllability is the capability of executing a workflow for all possible durations of all tasks satisfying all temporal constraints. Three different types of controllability are possible -- strong controllability, history-dependent controllability, and weak controllability -- and a general exponential-time algorithm to determine the kind of controllability has been proposed. In this paper we analyze the computational complexity of the temporal controllability problem to verify the quality of proposed algorithms. We show that the weak controllability problem is coNP-complete, while strong controllability problem ε Σ2P and it is coNP-hard. Regarding the history-dependent controllability problem, we are able to show that it is a PSPACE problem but further research is required to determine its hardness characterization.
- S. Arora and B. Barak. Computational complexity: a modern approach. Cambridge Univ. Press, 2009. Google ScholarDigital Library
- C. Bettini, X. S. Wang, and S. Jajodia. Temporal reasoning in workflow systems. Dist. & Paral. Data., 11(3): 269--306, 2002. Google ScholarDigital Library
- C. Combi, M. Gozzi, J. M. Juárez, B. Oliboni, and G. Pozzi. Conceptual modeling of temporal clinical workflows. In TIME, pages 70--81. IEEE, 2007. Google ScholarDigital Library
- C. Combi and R. Posenato. Controllability in temporal conceptual workflow schemata. In U. Dayal, J. Eder, J. Koehler, and H. A. Reijers, editors, BPM, volume 5701 of LNCS, pages 64--79. Springer, 2009. Google ScholarDigital Library
- C. Combi and R. Posenato. Towards temporal controllabilities for workflow schemata. In Markey and Wijsen {10}, pages 129--136. Google ScholarDigital Library
- R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artif. Intell., 49(1-3): 61--95, 1991. Google ScholarDigital Library
- M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979. Google ScholarDigital Library
- L. Hunsberger. Fixing the semantics for dynamic controllability and providing a more practical characterization of dynamic execution strategies. In C. Lutz and J.-F. Raskin, editors, TIME, pages 155--162. IEEE, 2009. Google ScholarDigital Library
- L. Hunsberger. A fast incremental algorithm for managing the execution of dynamically controllable temporal networks. In Markey and Wijsen {10}, pages 121--128. Google ScholarDigital Library
- N. Markey and J. Wijsen, editors. TIME 2010 - 17th Int. Symp. on Temporal Repres. and Reas., Paris. IEEE, 2010.Google Scholar
- P. Morris. A structural characterization of temporal dynamic controllability. In F. Benhamou, editor, CP, volume 4204 of LNCS, pages 375--389. Springer, 2006. Google ScholarDigital Library
- P. H. Morris and N. Muscettola. Temporal dynamic controllability revisited. In M. M. Veloso and S. Kambhampati, editors, AAAI, pages 1193--1198. AAAI Press, 2005. Google ScholarDigital Library
- Object Management Group (OMG). Business process definition metamodel (bpdm), Beta 1. http://www.omg.org, 2007.Google Scholar
- C. M. Papadimitriou. Computational complexity. Addison, 1994.Google Scholar
- I. Tsamardinos, T. Vidal, and M. E. Pollack. CTP: A new constraint-based formalism for conditional, temporal planning. Constraints, 8: 365--388, 2003. Google ScholarDigital Library
- T. Vidal and H. Fargier. Handling contingency in temporal constraint networks: from consistency to controllabilities. J. Exp. Theor. AI, 11(1): 23--45, 1999.Google ScholarCross Ref
Recommendations
Towards Temporal Controllabilities for Workflow Schemata
TIME '10: Proceedings of the 2010 17th International Symposium on Temporal Representation and ReasoningThe modelling and management of temporal constraints over business processes has received some attention in the past years. Recently, we have introduced and discussed the concept of "controllability" for workflow schemata modelling real world business ...
Contingent durations in temporal CSPs: from consistency to controllabilities
TIME '97: Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)Temporal Constraint Networks (TCSP) allow to express minimal and maximal durations between time-points. Though being used in many research areas, this model disregards the contingent nature of some constraints, whose effective duration cannot be decided ...
Computational Complexity of Controllability/Observability Problems for Combinational Circuits
The computational complexity of fault detection problems and various controllability and observability problems for combinational logic circuits are analyzed. It is shown that the fault detection problem is still NP-complete for monotone circuits ...
Comments