Open quantum random walks and quantum Markov Chains on trees II: The recurrence
The present paper is a continuation of earlier appeared work, where we have constructed
Quantum Markov Chains (QMC) associated with Open Quantum Random Walks and …
Quantum Markov Chains (QMC) associated with Open Quantum Random Walks and …
Model checking QCTL plus on quantum Markov chains
Verifying temporal properties of quantum systems, including quantum Markov chains
(QMCs), has attracted an increasing interest in the last decade. Typically, the properties are …
(QMCs), has attracted an increasing interest in the last decade. Typically, the properties are …
Termination and Universal Termination Problems for Nondeterministic Quantum Programs
Verifying quantum programs has attracted a lot of interest in recent years. In this article, we
consider the following two categories of termination problems of quantum programs with …
consider the following two categories of termination problems of quantum programs with …
Design and performance analysis of prime number based backoff counter adjustment (PBCA) algorithm for wireless body area networks
Abstract Wireless Body Area Networks (WBANs) are critical in medical emergency services
within the Internet of Things (IoT). Ensuring efficient channel utilization while avoiding …
within the Internet of Things (IoT). Ensuring efficient channel utilization while avoiding …
Model checking quantum continuous-time Markov chains
Verifying quantum systems has attracted a lot of interests in the last decades. In this paper,
we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a …
we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a …
A Sample-Driven Solving Procedure for the Repeated Reachability of Quantum Continuous-time Markov Chains
Reachability analysis plays a central role in system design and verification. The reachability
problem, denoted◊ jΦ, asks whether the system will meet the property Φ after some time in a …
problem, denoted◊ jΦ, asks whether the system will meet the property Φ after some time in a …
Algorithmic Analysis of Termination Problems for Nondeterministic Quantum Programs
We consider the two categories of termination problems of quantum programs with
nondeterminism: 1) Is an input of a program terminating with probability one under all …
nondeterminism: 1) Is an input of a program terminating with probability one under all …
A Sample-Driven Solving Procedure for the Repeated Reachability of Quantum CTMCs
Reachability analysis plays a central role in system design and verification. The reachability
problem, denoted $\Diamond^ J\,\Phi $, asks whether the system will meet the property $\Phi …
problem, denoted $\Diamond^ J\,\Phi $, asks whether the system will meet the property $\Phi …