81,327 Hits in 2.4 sec

Synchronous Compensators: Models Verified by Tests of Automatic Voltage Regulator, Reactive Power Control, and Voltage Joint Control

J.L. Aguero, P.L. Arnera, R.E. Bianchi Lastra, M.C. Beroqui
2006 IEEE Transactions on Power Systems  
This paper presents models verified by tests of the excitation control systems (ECSs) of six large synchronous compensators (SCs) rated +125/ 120 MVAr.  ...  These tests were made to verify all the models involved and their adjustments. The SCs are a 3901/01/660 type from General Electric, rated 13.8 kV and 125/ 120 MVAr.  ...  INTRODUCTION S EVERAL tests were made at synchronous compensators (SCs) plant during the commissioning of a new excitation control systems (ECSs).  ... 
doi:10.1109/tpwrs.2006.879253 fatcat:jgod4xcg6bh2thikekf3jv2fo4

Verifying Compensating Transactions [chapter]

Michael Emmi, Rupak Majumdar
Lecture Notes in Computer Science  
This illusion of atomicity is maintained through programmer-specified compensation actions that get run to undo previous actions when certain parts of the transaction fail to finish.  ...  Programming languages for business process orchestration provide constructs for declaring compensation actions, which are co-ordinated by the run time system to provide the desired transactional semantics  ...  A long-running transaction is structured as sagas [12] , a sequence of several smaller sub-transactions, each with an associated compensation.  ... 
doi:10.1007/978-3-540-69738-1_2 dblp:conf/vmcai/EmmiM07 fatcat:htn5opahnra33imw4cw6wioj2m

Specifying and Verifying Web Transactions [chapter]

Jing Li, Huibiao Zhu, Jifeng He
2008 Lecture Notes in Computer Science  
For this reason, we suggest that web transactions are constructed through a series of compensable transactions, using the concept of compensation to ensure a relatively relaxed atomicity.  ...  Based on the formal description for a transaction model, we are able to further verify its transactional behavior according to the specified requirement of relaxed atomicity and more precise behavioral  ...  Moreover, this work proposes strict solutions to verify transactional behavior.  ... 
doi:10.1007/978-3-540-68855-6_10 fatcat:kwm7dvj5xja4dauzym445wenai

Failure Recovery Dependency Analysis for Web Composition Transactions Based on Extended Petri-Nets

Xiaoyong Mei, Changqin Huang, Yong Tang, Gansen Zhao, Huijin Wang
2015 International Journal of u- and e- Service, Science and Technology  
Hence the dependency problem between tasks in LRTs must be considered, which affects the effectiveness and efficiency of failure compensation of composition transaction.  ...  In this paper, we propose a task dependency modeling method for LRTs, firstly we present formal description of atomic Web Services (WS) and discuss atomic WS such as pivot, compensable, retriable and vital  ...  It is very important to verify task dependency in LRTs.  ... 
doi:10.14257/ijunesst.2015.8.4.04 fatcat:4lolydyyibb3rbsorjgb5pwylu

Verifying Composite Service Transactional Behavior with EVENT-B [chapter]

Lazhar Hamel, Mohamed Graiet, Mourad Kmimech, Mohamed Tahar Bhiri, Walid Gaaloul
2011 Lecture Notes in Computer Science  
To achieve this, we propose a proof oriented approach for the formalization and verification of transactional behavior of web services composition using Event-B.  ...  To do so, we use ProB animator to verify our specification of transactional web services.  ...  To repair this error we can refer to the initialization of the machine and verify the compensation dependencies.  ... 
doi:10.1007/978-3-642-23798-0_7 fatcat:2c5rgi2rrzfw5av2o56p6nplci

An Event Algebra Based System for Verifying E-Commerce Transactions

Renyi Zhao, V. Lakshmi Narasimhan
2005 Journal of research and practice in information technology  
Furthermore, the transaction architecture is introduced as a unified medium for specifying and verifying distributed, heterogeneous and complex E-Commerce transaction processes.  ...  Based on the BDL, we propose new concepts, namely, transaction patterns and transaction architectures, which have event-based semantics to describe large-scale transaction systems.  ...  In addition, we also provide a formal mechanism to verify complex transactions.  ... 
dblp:journals/acj/ZhaoN05 fatcat:sp3bq7bko5cjvjralmlyrkmp4y

A Framework to Test Advanced Web Services Transactions

Rubén Casado, Javier Tuya, Muhammad Younas
2011 2011 Fourth IEEE International Conference on Software Testing, Verification and Validation  
Web service testing; web service transaction, SOA testing I.  ...  Transactions are a key issue in the reliability of distributed applications because they ensure all the participants achieve a mutually agreed outcome.  ...  [6] use event calculus to verify the transactional behaviour of WS compositions.  ... 
doi:10.1109/icst.2011.44 dblp:conf/icst/CasadoTY11 fatcat:ynhaghzm2jf4jgm4zgsewhnc3u

Augmenting Web Services Composition with Transactional Requirements

Frederic Montagut, Refik Molva
2006 2006 IEEE International Conference on Web Services (ICWS'06)  
In this paper, we propose a new process to automate the design of transactional composite Web services.  ...  Current Web services composition approaches do not take into account transactional requirements defined by designers.  ...  failed ts 4 completed compensated compensated failed ts 5 completed compensated completed failed ts 6 compensated compensated compensated failed ts 7 compensated compensated completed failed ts  ... 
doi:10.1109/icws.2006.32 dblp:conf/icws/MontagutM06 fatcat:npgur2mo75hede66yppmddp5va

How to Vote Privately Using Bitcoin [chapter]

Zhichao Zhao, T.-H. Hubert Chan
2016 Lecture Notes in Computer Science  
The bitcoin transaction syntax is expressive enough to setup digital contracts whose fund transfer can be enforced automatically.  ...  Moreover, we have resolved a security issue in previous protocols that could prevent compensation from being paid. 1 We use the latex code from [6] to generate the bitcoin symbol B.  ...  Note that Verify pk implicitly takes another input which is the hash of the following transaction to be verified, e.g., hash([Y ]).  ... 
doi:10.1007/978-3-319-29814-6_8 fatcat:tmpeawexnfhl5pc4ipzc5y7mz4

Verifying Transactional Requirements of Web Service Compositions Using Temporal Logic Templates [chapter]

Scott Bourne, Claudia Szabo, Quan Z. Sheng
2013 Lecture Notes in Computer Science  
Despite significant research interest, challenges remain in providing an easy-to-use, formal approach to verify transactional behavior of Web service compositions before costly development.  ...  To verify design conformance to a set of implemented templates, we employ model checking.  ...  Compensation and ConditionalCompensation allow users to verify that the compensation actions of the composition meet requirements.  ... 
doi:10.1007/978-3-642-41230-1_21 fatcat:i7u2d6ngoraf5bc6okzx25c5cm

Verification of Service Composition and Compensation by Using Process Algebra

S. Ripon
2016 Journal of Advances in Computer Networks  
Compensating CSP is a language defined to model business transactions within the framework of CSP process algebra. It has the facility to model faults within a transaction as compensations.  ...  By combining the benefits the both cCSP and FSP, this paper illustrates a mechanism to model and verify the composition of services and compensation in FSP by following the mechanism adopted in cCSP.  ...  Compensation is part of a compensable process that is used to compensate a failed transaction.  ... 
doi:10.18178/jacn.2016.4.4.230 fatcat:p3hrksurcfauhbygdebeio2atu

Formal Design and Verification of Long-Running Transactions with Extensible Coordination Tools

Natallia Kokash, Farhad Arbab
2013 IEEE Transactions on Services Computing  
Data integrity in long-running transactions (LRTs) is preserved using compensations, that is, activities explicitly programmed to eliminate the effects of a process terminated by a user or that failed  ...  We illustrate how Reo can be used for modeling termination and compensation handling in a number of commonly used workflow patterns, including sequential and parallel compositions, nested transactions,  ...  Our approach makes it possible to formally verify the process transactional behavior using a number of validation and verification tools.  ... 
doi:10.1109/tsc.2011.46 fatcat:v5uwfpb2ajajvfciyxtojdry6m

Ensuring consistency in long running transactions

Jeffrey Fischer, Rupak Majumdar
2007 Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering - ASE '07  
We formalize a core calculus for representing long-running transactions, providing sequential and parallel composition, as well as exception-handling and compensation actions, within the language.  ...  In each case the consistency requirements can be verified within a second, demonstrating the practicality of our approach.  ...  The undo mechanism is a programmer-specified compensation action. For example, sagas [13] are two-level transactions with compensation actions for each forward action.  ... 
doi:10.1145/1321631.1321642 dblp:conf/kbse/FischerM07 fatcat:kj62whvnorgj5l6utu6oze3ocm

Compensation of a Force-Feedback Pneumatic Servovalve

1971 Transactions of the Society of Instrument and Control Engineers  
As a result, it is verified that the both methods are useful for the compensation of a force-feedback servovalve.  ...  Here, the tank-resistance compensation method suggested by J.L. Shearer is compared with the compensation spring method tried by the author.  ...  As a result, it is verified that the both methods are useful for the compensation of a force-feedback servovalve.  ... 
doi:10.9746/sicetr1965.7.366 fatcat:o7frbseiivazxig6kzruvcclxa

Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model

David Spelt, Susan Even
2001 Concurrency and Computation  
This paper demonstrates the use of a higher-order logic theorem prover for verifying that compensating transactions return a database to its original state.  ...  Section 6 discusses our practical experiments using Isabelle to verify the compensation methods of the example schema. Section 7 discusses related work. Section 8 concludes the paper.  ...  The aim of our research is to provide a tool that can be used to help verify the semantics requirements on a database schema. In this paper, we look at verifying compensation.  ... 
doi:10.1002/cpe.610 fatcat:62i5frj6vzeojblbewlj7nnf5m
« Previous Showing results 1 — 15 out of 81,327 results