工作经历：
2025.03至今 |
西安交通大学，数学与统计学院，教授 |
| 2024.11-2025.01 | 中国科学院数学与系统科学研究院，访问学者 |
2024.05-2024.10 |
意大利卡利亚里大学，访问教授 |
2022.04-2024.03 |
英国萨里大学，讲师 |
2020.07-2022.04 |
德国柏林工业大学，洪堡学者（博士后） |
2017.09-2020.04 |
瑞典皇家理工学院，博士后 |
2016.09-2017.08 |
德国慕尼黑工业大学，博士后 |
学习经历：
| 2009.09-2014.12 | 哈尔滨工程大学，自动化学院，博士 |
| 2005.09-2009.06 | 哈尔滨工程大学，理学院，学士 |
研究方向：
理论计算机科学、控制论
离散状态动态系统的形式化验证、可判定性理论、计算复杂性理论
有限自动机、幺半群上的加权有限自动机、Petri网、布尔控制网络等多种离散状态动态系统
提出幺半群上的加权有限自动机、布尔控制网络的能观性图、离散事件系统的并发合成算子和新理论框架，为相应研究方向的发展奠定基础
布尔控制网络的能观性图或其邻接矩阵（被称为能观性矩阵或并行扩展（parallel extension））已经被同行学者广泛使用做出大量增量性工作（一个简短的关于布尔控制网络能观性的教学视频见https://m-stp.lcu.edu.cn/xzyd/xzzm/565246.htm）：
[1] Cheng, D., Qi, H., Liu, T., and Wang, Y. (2016). A note on observability of Boolean control networks. Systems & Control Letters, 87:76-82.
[2] Cheng, D., Li, C., and He, F. (2018). Observability of Boolean networks via set controllability approach. Systems & Control Letters, 115:22-25.
[3] Zhu, Q., Liu, Y., Lu, J., and Cao, J. (2018). Observability of Boolean control networks. Science China Information Sciences, 61(9):092201.
[4] Guo, Y. (2018). Observability of Boolean control networks using parallel extension and set reachability. IEEE Transactions on Neural Networks and Learning Systems, 29(12):6402-6408.
[5] Li, T., Feng, J., and Wang, B. (2020). Reconstructibility of singular Boolean control networks via automata approach. Neurocomputing, 416:19-27.
[6] Li, Y., Li, H., and Xiao, G. (2025). Observability verification system analysis for observability and reconstructibility of probabilistic logical control networks. IEEE Transactions on Circuits and Systems I: Regular Papers, 72(8):4273-4283.
[6] Lin, L. and Lam, J. (2023). Observability categorization for Boolean control networks. IEEE Transactions on Network Science and Engineering, pages 1-12.
[7] Liu, Y., Wang, L., Yang, Y., and Wu, Z. (2022). Minimal observability of Boolean control networks. Systems & Control Letters, 163:105204 (1-9).
[8] Liu, Y., Zhong, J., Ho, D., and Gui, W. (2022). Minimal observability of Boolean networks. Science China Information Sciences, 65(5):152203(1-12).
[9] Wang, L., Xia, Z., Liu, Y., Azuma, S., and Gui, W. (2025). Minimal finite-time observability of Markovian jump Boolean networks. Systems & Control Letters, 196:106007(1-9).
[10] Wang, S. and Li, H. (2021). Graph-based function perturbation analysis for observability of multivalued logical networks. IEEE Transactions on Neural Networks and Learning Systems, 32(11):4839-4848.
[11] Yu, Y., Meng, M., Feng, J., and Chen, G. (2022). Observability criteria for Boolean networks. IEEE Transactions on Automatic Control, 67(11):6248-6254.
[12] Zhou, R., Guo, Y., and Gui, W. (2019). Set reachability and observability of probabilistic Boolean networks. Automatica, 106:230-241.
[12] Zhu, S., Cao, J., Lin, L., Rutkowski, L., Lu, J., and Lu, G. (2023). Observability and detectability of stochastic labeled graphs. IEEE Transactions on Automatic Control, 68(12):7299-7311.
[14] Zhu, S., Jia, Y., and Feng, J. (2023). Observability of probabilistic Boolean networks via matrix approach. IEEE Transactions on Control of Network Systems, 10(2):834-840.