4 papers
Synthesizing Probabilistic Saturating Counters with Differentially Private Formal Guarantees
Zhiming Chi, Lutan Zhao, Depeng Liu +8
Branch predictors improve instruction-level parallelism in modern processors and are commonly modeled using saturating counters. However, classical saturating counters are determin…
PAC Approximation and DIRECT Optimization for Parametric Markov Models
Zhiming Chi, Ying Liu, Andrea Turrini +2
In this paper, we consider the parameter synthesis and optimization problem for parametric Markov decision processes (pMDPs), the extension of classical MDPs where exact probabilit…
Resource-Constrained Robotic Planning in the face of Mixed Uncertainty
Yihao Yin, Pian Yu, Andrea Turrini +3
Robots operate under significant uncertainty, from quantifiable noise to unquantifiable unknowns, and must account for strict operational constraints, such as limited resources. In…
Efficient Decomposition Identification of Deterministic Finite Automata from Examples
Junjie Meng, Jie An, Yong Li +4
The identification of deterministic finite automata (DFAs) from labeled examples is a cornerstone of automata learning, yet traditional methods focus on learning monolithic DFAs, w…