Zhen Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhen Zhang has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Arnd Hartmanns
University of Twente
9 shared publications - Chris J. Myers
University of Colorado Boulder
5 shared publications - Koushik Chakraborty
Utah State University
5 shared publications - Sanghamitra Roy
Utah State University
5 shared publications - Carlos Esteban Budde
Technical University of Denmark
4 shared publications - Prabal Basu
Cadence Design Systems
4 shared publications
Latest Publications
- 13 January 2026
- Published by Springer Nature
- p. 383-407
Probabilistic Verification for Modular Network-on-Chip Systems
- 13 January 2026
- Published by Springer Nature
- p. 383-407
Probabilistic Verification for Modular Network-on-Chip Systems
- Open Access
Probabilistic Verification for Modular Network-on-Chip Systems (extended version)
Quantitative verification can provide deep insights into reliable Network-On-Chip (NoC) designs. It is critical to understanding and mitigating operational issues caused by power supply noise (PSN) early in the design process: fluctuations in network traffic in modern NoC designs cause dramatic variations in power delivery across the network, leading to unreliability and errors in data transfers. Further complicating these challenges, NoC designs vary widely in size, usage, and implementation. This case study paper presents a principled, systematic, and modular NoC modeling approach using the Modest language that closely reflects the standard hierarchical design approach in digital systems. Using the Modest Toolset, functional and quantitative correctness was established for several NoC models, all of which were instantiated from a generic modular router model. Specifically, this work verifies the functional correctness of a generic router, inter-router communication, and the entire NoC. Statistical model checking was used to verify PSN-related properties for NoCs of size up to 8x8.
Open AccessProbabilistic Verification for Modular Network-on-Chip Systems (extended version)
Quantitative verification can provide deep insights into reliable Network-On-Chip (NoC) designs. It is critical to understanding and mitigating operational issues caused by power supply noise (PSN) early in the design process: fluctuations in network traffic in modern NoC designs cause dramatic variations in power delivery across the network, leading to unreliability and errors in data transfers. Further complicating these challenges, NoC designs vary widely in size, usage, and implementation. This case study paper presents a principled, systematic, and modular NoC modeling approach using the Modest language that closely reflects the standard hierarchical design approach in digital systems. Using the Modest Toolset, functional and quantitative correctness was established for several NoC models, all of which were instantiated from a generic modular router model. Specifically, this work verifies the functional correctness of a generic router, inter-router communication, and the entire NoC. Statistical model checking was used to verify PSN-related properties for NoCs of size up to 8x8.
- 13 November 2024
- Published by Springer Nature
- p. 115-142
Modest Models and Tools for Real Stochastic Timed Systems
- 13 November 2024
- Published by Springer Nature
- p. 115-142
Modest Models and Tools for Real Stochastic Timed Systems
- 1 November 2024
- Published by Springer Nature
- p. 90-146
Tools at the Frontiers of Quantitative Verification
- 1 November 2024
- Published by Springer Nature
- p. 90-146
Tools at the Frontiers of Quantitative Verification
- Open Access
Tools at the Frontiers of Quantitative Verification
The analysis of formal models that include quantitative aspects such as timing or probabilistic choices is performed by quantitative verification tools. Broad and mature tool support is available for computing basic properties such as expected rewards on basic models such as Markov chains. Previous editions of QComp, the comparison of tools for the analysis of quantitative formal models, focused on this setting. Many application scenarios, however, require more advanced property types such as LTL and parameter synthesis queries as well as advanced models like stochastic games and partially observable MDPs. For these, tool support is in its infancy today. This paper presents the outcomes of QComp 2023: a survey of the state of the art in quantitative verification tool support for advanced property types and models. With tools ranging from first research prototypes to well-supported integrations into established toolsets, this report highlights today's active areas and tomorrow's challenges in tool-focused research for quantitative verification.
Open AccessTools at the Frontiers of Quantitative Verification
The analysis of formal models that include quantitative aspects such as timing or probabilistic choices is performed by quantitative verification tools. Broad and mature tool support is available for computing basic properties such as expected rewards on basic models such as Markov chains. Previous editions of QComp, the comparison of tools for the analysis of quantitative formal models, focused on this setting. Many application scenarios, however, require more advanced property types such as LTL and parameter synthesis queries as well as advanced models like stochastic games and partially observable MDPs. For these, tool support is in its infancy today. This paper presents the outcomes of QComp 2023: a survey of the state of the art in quantitative verification tool support for advanced property types and models. With tools ranging from first research prototypes to well-supported integrations into established toolsets, this report highlights today's active areas and tomorrow's challenges in tool-focused research for quantitative verification.
- 15 September 2023
- Published by Springer Nature
- p. 101-109
STAMINA in C++: Modernizing an Infinite-State Probabilistic Model Checker
- 15 September 2023
- Published by Springer Nature
- p. 101-109
STAMINA in C++: Modernizing an Infinite-State Probabilistic Model Checker
- 2 May 2023
- Published by Springer Nature
- p. 83-102
Efficient Trace Generation for Rare-Event Analysis in Chemical Reaction Networks
- 2 May 2023
- Published by Springer Nature
- p. 83-102
Efficient Trace Generation for Rare-Event Analysis in Chemical Reaction Networks
- 14 January 2022
- Published by Springer Nature
- p. 319-331
STAMINA 2.0: Improving Scalability of Infinite-State Stochastic Model Checking
- 14 January 2022
- Published by Springer Nature
- p. 319-331
STAMINA 2.0: Improving Scalability of Infinite-State Stochastic Model Checking
- 14 January 2022
- Published by Springer Nature
- p. 378-399
Scaling Up Livelock Verification for Network-on-Chip Routing Algorithms
- 14 January 2022
- Published by Springer Nature
- p. 378-399
Scaling Up Livelock Verification for Network-on-Chip Routing Algorithms
- 19 August 2021
- Published by Springer Nature
- p. 232-248
Probabilistic Verification for Reliability of a Two-by-Two Network-on-Chip System
- 19 August 2021
- Published by Springer Nature
- p. 232-248
Probabilistic Verification for Reliability of a Two-by-Two Network-on-Chip System