Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/2297
Title: | Verification of relational transducers for electronic commerce | Authors: | SPIELMANN, Marc | Issue Date: | 2003 | Publisher: | ACADEMIC PRESS INC ELSEVIER SCIENCE | Source: | JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 66(1). p. 40-65 | Abstract: | Motivated by recent work of Abiteboul, Vianu, Fordham, and Yesha, we investigate the verifiability of transaction protocols specifying the interaction of multiple parties via a network. The protocols which we are concerned with typically occur in the context of electronic commerce applications and can be formalized as relational transducers. We introduce a class of powerful relational transducers based on Gurevich's abstract state machines and show that several verification problems related to electronic commerce applications are decidable for these transducers. (C) 2003 Published by Elsevier Science (USA). | Notes: | Univ Limburg, Dept WNI, B-3590 Diepenbeek, Belgium.Spielmann, M, Univ Limburg, Dept WNI, Univ Campus, B-3590 Diepenbeek, Belgium. | Document URI: | http://hdl.handle.net/1942/2297 | ISSN: | 0022-0000 | e-ISSN: | 1090-2724 | DOI: | 10.1016/S0022-0000(02)00029-6 | ISI #: | 000182304200004 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2004 |
Appears in Collections: | Research publications |
Show full item record
SCOPUSTM
Citations
44
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
26
checked on Oct 14, 2024
Page view(s)
456
checked on Jul 31, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.