IEEE - Institute of Electrical and Electronics Engineers, Inc. - On the computational complexity of the reachability problem in UML activity diagrams

2009 IEEE International Conference on Intelligent Computing and Intelligent Systems (ICIS 2009)

Author(s): Xing Tan ; Gruninger, M.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 November 2009
Conference Location: Shanghai, China, China
Conference Date: 20 November 2009
Volume: 2
Page(s): 572 - 576
ISBN (CD): 978-1-4244-4738-1
ISBN (Paper): 978-1-4244-4754-1
DOI: 10.1109/ICICISYS.2009.5358318
Regular:

The reachability problem, the problem of checking whether certain node can be reached from some initial settings such that all restrictions on flow of control are satisfied, arises frequently in... View More

Advertisement