Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/50691
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNasi Tantitharanukulen_US
dc.contributor.authorWatcharee Jumpamuleen_US
dc.date.accessioned2018-09-04T04:44:24Z-
dc.date.available2018-09-04T04:44:24Z-
dc.date.issued2010-12-20en_US
dc.identifier.issn18650929en_US
dc.identifier.other2-s2.0-78650163604en_US
dc.identifier.other10.1007/978-3-642-16699-0_18en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78650163604&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/50691-
dc.description.abstractAlthough the Business Process Modeling Notation (BPMN) is a popular tool for modeling business process in conceptual level, the result diagram may contain structural problem. One of the structural problems is livelock. In this problem, one token proceeds to end event, while other token is still in process with no progression. In this paper, we introduce an expression liked method to detect livelock in the BPMN diagram. Our approach utilizes the power of the declarative ability of expression to determine all of the possible process chains, and indicate whether there are livelock or not. As a result, we have shown that our method can detect livelock, if any. © 2010 Springer-Verlag.en_US
dc.subjectComputer Scienceen_US
dc.titleDetection of LiveLock in BPMN using process expressionen_US
dc.typeBook Seriesen_US
article.title.sourcetitleCommunications in Computer and Information Scienceen_US
article.volume114 CCISen_US
article.stream.affiliationsChiang Mai Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.