Skip Navigation

The Computer Journal 1999 42(5):349-359; doi:10.1093/comjnl/42.5.349
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by ter Hofstede, A. H. M.
Right arrow Articles by Orlowska, M. E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On the Complexity of Some Verification Problems in Process Control Specifications

A. H. M. ter HofstedeA1 and M. E. OrlowskaA2

A1 Cooperative Information Systems Research Centre, Faculty of Information Technology, Queensland University of Technology, GPO Box 2434, Brisbane Qld 4001, Australia Email: arthur@icis.qut.edu.au A2 School of Information Technology, The University of Queensland, Brisbane, Qld 4072, Australia

Many techniques in many diverse areas in computer science, such as process modelling, process programming, decision support systems and workflow systems, use concepts for the specification of process control. These typically include concepts for the specification of sequential execution, parallelism, synchronization 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 concepts for process control.

Received 28 January, 1999. Revised 1 June, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.