Please use this identifier to cite or link to this item:
|Title:||Verification of computation Orchestration via timed automata||Authors:||Dong, J.S.
|Issue Date:||2006||Citation:||Dong, J.S.,Liu, Y.,Sun, J.,Zhang, X. (2006). Verification of computation Orchestration via timed automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 4260 LNCS : 226-245. ScholarBank@NUS Repository.||Abstract:||Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed web services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of sites or communication and so forth. The semantics of Orc is also precisely defined. However, there is no verification tool available to verify critical properties against Orc models. Instead of building one from scratch, we believe the existing mature model-checkers can be reused. In this work, we first define a Timed Automata semantics for the Orc language, which we prove is semantically equivalent to the original operational semantics of Orc. Consequently, Timed Automata models are systematically constructed from Orc models. The practical implication of the construction is that tool supports for Timed Automata, e.g., UPPAAL, can be used to model check Orc models. An experimental tool is implemented to automate our approach. © Springer-Verlag Berlin Heidelberg 2006.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/38954||ISBN:||3540474609||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.