6 citations · 8 across the 10 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2022
On Probabilistic -Pushdown Systems, and -Probabilistic Computational Tree Logic
Deren Lin, Tianrong Lin
In this paper, we define the notion of a {\em probabilistic -pushdown automaton} and study its model-checking problem against -probabilistic computational tree logic (-PCT…
cs.LO2011
Simple characterizations for commutativity of quantum weakest preconditions
Tianrong Lin
In a recent letter [Information Processing Letters~104 (2007) 152-158], it has shown some sufficient conditions for commutativity of quantum weakest preconditions. This paper provi…