The following pages link to Tingting Han (Q458373):
Displaying 28 items.
- Continuous-time orbit problems are decidable in polynomial-time (Q458374) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Bisimulations for fuzzy transition systems revisited (Q1648774) (← links)
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs (Q1708395) (← links)
- Probabilistic verification of hierarchical leader election protocol in dynamic systems (Q1713851) (← links)
- Polynomial-time algorithms for computing distances of fuzzy transition systems (Q1749476) (← links)
- On the complexity of model checking interval-valued discrete time Markov chains (Q1943636) (← links)
- Edge-colored complete graphs containing no properly colored odd cycles (Q2045403) (← links)
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs (Q2057600) (← links)
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs (Q2112656) (← links)
- Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments (Q2404382) (← links)
- (Q2844039) (← links)
- (Q2845515) (← links)
- On the complexity of computing maximum entropy for Markovian Models (Q2978546) (← links)
- Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
- Observing Continuous-Time MDPs by 1-Clock Timed Automata (Q3172860) (← links)
- (Q3385781) (← links)
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking (Q3510805) (← links)
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains (Q3523111) (← links)
- LTL Model Checking of Time-Inhomogeneous Markov Chains (Q3648693) (← links)
- (Q4574477) (← links)
- (Q4992525) (← links)
- Specification and verification for semi-structured data (Q5291135) (← links)
- (Q5491512) (← links)
- (Q5697792) (← links)
- Counterexamples in Probabilistic Model Checking (Q5758104) (← links)
- Properly colored cycles of different lengths in edge-colored complete graphs (Q6056740) (← links)
