Zining Cao

Zining Cao

Auto-generated profile, based on publicly available information

Zining Cao

College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics 211106 Nanjing P. R. China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 September 2024 in International Journal of Software Engineering and Knowledge Engineering
Verified
Journal Article
Closed access
FWFujun Wang
Fujun Wang
LTLixing Tan
Lixing Tan
ZCZining Cao
Zining Cao
YLYang Liu
Yang Liu
LZLi Zhang
Li Zhang

3 October 2023 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
LZLi Zhen
Li Zhen
ZCZining Cao
Zining Cao
CXChao Xing
Chao Xing

11 December 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
CXChao Xing
Chao Xing
ZCZining Cao
Zining Cao
ZLZhen Li
Zhen Li

31 July 2024 in Soft Computing
Verified
Journal Article
Closed access
PDF file
LZLi Zhen
Li Zhen
ZCZining Cao
Zining Cao
FWFujun Wang
Fujun Wang
CXChao Xing
Chao Xing

30 January 2025 in arXiv
Verified
Preprint
Open access
PDF file
QYQixian Yu
Qixian Yu
ZCZining Cao
Zining Cao
ZHZong Hui
Zong Hui
YZYuan Zhou
Yuan Zhou
This paper presents a comprehensive framework for modeling and verifying multi-agent systems. The paper introduce an Epistemic Process Calculus for multi-agent systems, which formalizes the syntax and semantics to capture the essential features of agent behavior interactions and epistemic states. Building upon this calculus, we propose ATLE, an extension of Alternating-time Temporal Logic incorporating epistemic operators to express complex properties related to agent epistemic state. To verify ATLE specifications, this paper presents a model checking algorithm that systematically explores the state space of a multi-agent system and evaluates the satisfaction of the specified properties. Finally, a case study is given to demonstrate the method.

27 July 2025 in arXiv
Verified
Preprint
Open access
PDF file
ZCZining Cao
Zining Cao
In this paper, we extend Busy Beaver function to a class of higher order Busy Beaver functions based on Turing oracle machine. We prove some results about the relation between decidability of number theoretical formula and higher order Busy Beaver functions, and the relation between computability of max-min partial recursive functions and higher order Busy Beaver functions. We also present some conjectures on higher order Busy Beaver functions.