activity
20132022
most citedA Simple Probabilistic Extension of Modal Mu-calculus

6 citations · 6 across the 3 of their papers we have counts for

collaborators

6 papers

cs.AI2022

Safety Verification for Neural Networks Based on Set-boundary Analysis

Zhen Liang, Dejin Ren, Wanwei Liu +3

Neural networks (NNs) are increasingly applied in safety-critical systems such as autonomous vehicles. However, they are fragile and are often ill-behaved. Consequently, their beha…

cs.AI2020

On Sufficient and Necessary Conditions in Bounded CTL: A Forgetting Approach

Renyan Feng, Erman Acar, Stefan Schlobach +2

Computation Tree Logic (CTL) is one of the central formalisms in formal verification. As a specification language, it is used to express a property that the system at hand is expec…

cs.LO2016

An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties

Yong Li, Wanwei Liu, Andrea Turrini +2

In this paper, we propose an efficient algorithm for the parameter synthesis of PLTL formulas with respect to parametric Markov chains. The PLTL formula is translated to an almost…

cs.FL2016

A Short Note on Infinite Union/Intersection of Omega Regular Languages

Wanwei Liu

We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal…

cs.LO20156 cited

A Simple Probabilistic Extension of Modal Mu-calculus

Wanwei Liu, Lei Song, Ji Wang +1

Probabilistic systems are an important theme in AI domain. As the specification language, the logic PCTL is now the default logic for reasoning about probabilistic properties. In t…

cs.LO2013

Counterexample-Preserving Reduction for Symbolic Model Checking

Wanwei Liu, Rui Wang, Xianjin Fu +3

The cost of LTL model checking is highly sensitive to the length of the formula under verification. We observe that, under some specific conditions, the input LTL formula can be re…