On the Complexity of Some Verification Problems in Process Control Specifications (1997) [3 citations — 2 self]
Download:
|
|
by A. H. M. Ter Hofstede, M. E. Orlowska
The Computer Journal
http://www.icis.qut.edu.au/~arthur/articles/PCSFormalVerif.ps.Z
Add To MetaCart
Abstract:
Many techniques in many diverse areas in computer science, such as process modelling, process programming, decision support systems, workflow systems, use concepts for the specification of process control. These typically include concepts for the specification of sequential execution, parallelism, synchronisation, and moments of choice. This paper identifies some typical verification problems in process control specifications, such as reachability, termination, freedom of deadlock and livelock, and determines their computational complexity. These results then provide computational lower bounds for any technique using these, but possibly more, concepts for process control.
Citations
| 194 | Process Algebra – Baeten, Weijland - 1990 |
| 68 | Conceptual Modeling of Workflows – Casati, Ceri, et al. - 1995 |
| 16 | An Environment to Support Problem Solving – Bots - 1989 |
