Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/50691
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nasi Tantitharanukul | en_US |
dc.contributor.author | Watcharee Jumpamule | en_US |
dc.date.accessioned | 2018-09-04T04:44:24Z | - |
dc.date.available | 2018-09-04T04:44:24Z | - |
dc.date.issued | 2010-12-20 | en_US |
dc.identifier.issn | 18650929 | en_US |
dc.identifier.other | 2-s2.0-78650163604 | en_US |
dc.identifier.other | 10.1007/978-3-642-16699-0_18 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78650163604&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/50691 | - |
dc.description.abstract | Although 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.subject | Computer Science | en_US |
dc.title | Detection of LiveLock in BPMN using process expression | en_US |
dc.type | Book Series | en_US |
article.title.sourcetitle | Communications in Computer and Information Science | en_US |
article.volume | 114 CCIS | en_US |
article.stream.affiliations | Chiang Mai University | en_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.