Zobrazeno 1 - 10
of 14
pro vyhledávání: '"ZuXi Chen"'
Publikováno v:
Heliyon, Vol 10, Iss 11, Pp e31776- (2024)
Safety-critical systems, such as the railway signal system, are subject to potentially high costs from failures, including loss of life and property damage. The use of new technology, including communication-based train control (CBTC) systems with so
Externí odkaz:
https://doaj.org/article/1a16e76e96e34b01ba8b8c934c9c7b14
Publikováno v:
PeerJ Computer Science, Vol 9, p e1749 (2023)
This article presents a novel parallel path detection algorithm for identifying suspicious fraudulent accounts in large-scale banking transaction graphs. The proposed algorithm is based on a three-step approach that involves constructing a directed g
Externí odkaz:
https://doaj.org/article/1986173f28c74832a6b8e4df666d929c
Publikováno v:
IEEE Access, Vol 7, Pp 10224-10231 (2019)
Practical Byzantine fault tolerance (PBFT) is one of the most popular consensus protocols of the blockchain. However, in the PBFT, the enthusiasm of reliable nodes cannot be stimulated effectively, and a large amount of communication resources are us
Externí odkaz:
https://doaj.org/article/e21d05ec1d2d42d8b060946514cfd048
Publikováno v:
MATEC Web of Conferences, Vol 128, p 04004 (2017)
Model checking and theorem proving are two key vertification techniques in the formal method, but each has its advantages and disadvantages. In this paper, we first try to present the general model transformation rules from Event-B to SMV in order to
Externí odkaz:
https://doaj.org/article/343c5ac7b7634f4ba304132ef3217570
Publikováno v:
IEEE Transactions on Reliability. 71:933-950
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a77fd19e949c2ac50f12dd7d634a335
https://doi.org/10.1109/tr.2022.3146200
https://doi.org/10.1109/tr.2022.3146200
Publikováno v:
IEEJ Transactions on Electrical and Electronic Engineering. 12:710-720
Bounded model checking (BMC) of timed automata has been successfully applied to verify concurrent real-time systems, but its scalability is still limited by the large bound required to find counter-example, the efficiency of the decision procedure wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b48101eccdc68cafd48c918c3980bf94
https://doi.org/10.1002/tee.22457
https://doi.org/10.1002/tee.22457
Publikováno v:
TASE
To BMC of timed automata network, we present a novel time stamp semantics model for timed automata network with synchronization and shared variables, which allows not only mutually independent transitions but also dependent transitions to be compress
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0760ddd0fe460af1ad9feef5e145596
https://doi.org/10.1109/tase.2019.00-14
https://doi.org/10.1109/tase.2019.00-14
Autor:
Zhongwei Xu, Zuxi Chen
Publikováno v:
IEEJ Transactions on Electrical and Electronic Engineering. 10:S83-S90
In this paper, we adapt lazy abstraction with interpolants for reachability analysis of timed automaton. It involves computing an abstract reachability tree whose nodes are labeled by a location and a given set of predicates. The set of predicates ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acae1bbcba9e3f7c4f72305de27abd47
https://doi.org/10.1002/tee.22168
https://doi.org/10.1002/tee.22168
Publikováno v:
Journal of Computer Applications. 33:3419-3422
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b16e6928d24755b55453ef2c483b3e42
https://doi.org/10.3724/sp.j.1087.2013.03419
https://doi.org/10.3724/sp.j.1087.2013.03419
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9783319017655
In order to do formal verification of interlocking system, which is complicated but safety critical, we choose formal specification language Maude for modeling and verification based on membership equational logic and rewriting logic. In this chapter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f896aa8b3136bf22ffa1855e76f54a9
https://doi.org/10.1007/978-3-319-01766-2_36
https://doi.org/10.1007/978-3-319-01766-2_36
