A5068932110- Formal Methods in Verification
- Logic, programming, and type systems
- Petri Nets in System Modeling
- Computability, Logic, AI Algorithms
- Cancer, Hypoxia, and Metabolism
- Logic, Reasoning, and Knowledge
- Distributed systems and fault tolerance
- Machine Learning and Algorithms
- Complexity and Algorithms in Graphs
- Heme Oxygenase-1 and Carbon Monoxide
- Software Reliability and Analysis Research
- Metabolism, Diabetes, and Cancer
- Cancer-related gene regulation
- Optimization and Search Problems
- Histone Deacetylase Inhibitors Research
- Pancreatic function and diabetes
- Advanced Memory and Neural Computing
- Genomics, phytochemicals, and oxidative stress
- Gout, Hyperuricemia, Uric Acid
Guangdong Medical College
2024
Affiliated Hospital of Guangdong Medical College Hospital
2024
Shanghai Jiao Tong University
2014-2019
In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given program terminates with probability 1. Scalable approaches analysis often rely on modularity as their theoretical basis. non-probabilistic programs, classical variant rule (V-rule) of Floyd-Hoare logic provides foundation modular analysis. Extension to is quite tricky, and was proposed by Fioriti Hermanns in POPL 2015. While cautiously addresses key issue integrability, show...
Cancer cells can alter their metabolism to meet energy and molecular requirements due unfavorable environments with oxygen nutritional deficiencies. Therefore, metabolic reprogramming is common in a tumor microenvironment (TME). Aryl hydrocarbon receptor (AhR) ligand-activated nuclear transcription factor, which be activated by many exogenous endogenous ligands. Multiple AhR ligands produced both TME cells. By attaching various ligands, regulates cancer dysregulating pathways, including...
Abstract Uric acid (UA) is the end product of purine metabolism. In recent years, UA has been found to be associated with prognosis clinical cancer patients. However, intricate mechanisms by which affects development and tumor patients not well elucidated. this study, we explored role in breast cancer, scrutinizing its impact on cell function treating two types lines UA. The cycle proliferation tumors underlying were further investigated. We that antioxidant effect facilitated scavenging...
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Process) and nBPA Process Algebra). These results lead to the question if there are any other models in hierarchy of PRS (Process Rewrite System) whose decidable. It shown this paper nOCN One Counter Net) nPA Algebra) undecidable. essentially imply has a negative answer.
We put forward an exponential-time algorithm for deciding branching bisimilarity on normed BPA (Bacis Process Algebra) systems. The decidability of (or weak) was once a long standing open problem which closed by Yuxi Fu. EXPTIME-hardness is inference slight modification the reduction presented Richard Mayr. Our result claims that this EXPTIME-complete.
We put forward an exponential-time algorithm for deciding branching bisimilarity on nor med BPA (Bacis Process Algebra) systems. The decidability of was once a long-standing open problem which closed by Yuxi Fu. EXPTIME-hardness is inference slight modification the reduction presented Richard Mayr. result in this paper claims that EXPTIME-complete.
We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach problem. Moreover, using this can obtain explicit optimal tail probabilities of non-termination within given number steps. Second, present new based Central Limit Theorem problem, and establish programs which none existing approaches handle. Finally, discuss algorithmic two above methods lead to automated...
Branching bisimilarity on normed Basic Process Algebra (BPA) was claimed to be EXPTIME-hard in previous papers without any explicit proof. Recently it is reminded by Jan\v{c}ar that the claim not so dependable. In this paper, we develop a new complete proof for EXPTIME-hardness of branching BPA. We also prove associate regularity problem BPA PSPACE-hard and EXPTIME. This improves P-hard NEXPTIME result.
Analyzing probabilistic programs and randomized algorithms are classical problems in computer science. The first basic problem the analysis of stochastic processes is to consider expectation or mean, another concentration bounds, i.e. showing that large deviations from mean have small probability. Similarly, context algorithms, expected termination time/running time their bounds fundamental problems.In this work, we focus on for recurrences algorithms. For programs, technique achieve...