UM  > Faculty of Science and Technology
Residential Collegefalse
Status已發表Published
Towards machine-readable semantic-based E-business contract representations using Network of Timed Automata (NTA)
Qin, Peng1,2; Hu, Quanyi3; Cui, Menglin2
2024-09-01
Source PublicationFuture Generation Computer Systems
ISSN0167-739X
Volume158Pages:457-471
Abstract

The smart contract is generally stored and executed by a computer program in the blockchain platform. However, the representation of program code is unfriendly for non-software developers since the process of a smart contract involves multiple parties such as lawyers, which is not easy to understand for most humans. To consider a broad acceptance of contracts, we design a novel contract representation to narrow the gap between smart contracts and e-business contracts. This paper proposes a novel semantic-based e-business contract model - Simple Natural Contract (SimNC) to represent a universal contract created by a Supervised Sentence Contract (SSC), which is inputted via a Semantic Input Method (SIM) with strict grammar from a human-understandable natural language contract. Then, the SSC is analyzed through Machine Natural Language (MNL) to enhance contract semantic understanding by enabling case grammar for crossing language parties. In doing so, SimNC analyses various deontic components, and combines them with the operational aspects of a legal contract, to achieve a common and better understanding between hard-code and natural language. In addition, we apply the SimNC into a Network of Timed Automata (NTA) for supporting automation, which builds a formal model including temporal constraints and then translates into an executable SimNC-NTA model. This paper aims to provide a bridge between natural language contracts and e-business contracts, making them universal and intelligible.

KeywordE-business Smart Contract Semantic Analysis Information Processing Knowledge Engineering
DOI10.1016/j.future.2024.04.040
URLView the original
Indexed BySCIE
Language英語English
WOS Research AreaComputer Science
WOS SubjectComputer Science, Theory & Methods
WOS IDWOS:001239467100001
PublisherELSEVIER,RADARWEG 29, 1043 NX AMSTERDAM, NETHERLANDS
Scopus ID2-s2.0-85192236978
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionFaculty of Science and Technology
DEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Corresponding AuthorHu, Quanyi
Affiliation1.Faculty of Data Science, City University of Macau, Macao Special Administrative Region of China
2.Business School, University of Shanghai for Science and Technology, Shanghai, China
3.Department of Computer and Information Science, University of Macau, Macao Special Administrative Region of China
First Author AffilicationUniversity of Macau
Corresponding Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Qin, Peng,Hu, Quanyi,Cui, Menglin. Towards machine-readable semantic-based E-business contract representations using Network of Timed Automata (NTA)[J]. Future Generation Computer Systems, 2024, 158, 457-471.
APA Qin, Peng., Hu, Quanyi., & Cui, Menglin (2024). Towards machine-readable semantic-based E-business contract representations using Network of Timed Automata (NTA). Future Generation Computer Systems, 158, 457-471.
MLA Qin, Peng,et al."Towards machine-readable semantic-based E-business contract representations using Network of Timed Automata (NTA)".Future Generation Computer Systems 158(2024):457-471.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Qin, Peng]'s Articles
[Hu, Quanyi]'s Articles
[Cui, Menglin]'s Articles
Baidu academic
Similar articles in Baidu academic
[Qin, Peng]'s Articles
[Hu, Quanyi]'s Articles
[Cui, Menglin]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Qin, Peng]'s Articles
[Hu, Quanyi]'s Articles
[Cui, Menglin]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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